./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/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 bf350eece4e5f8a5f96c7b11a45bc95e4e002e5b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/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 bf350eece4e5f8a5f96c7b11a45bc95e4e002e5b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:26:36,403 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:26:36,405 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:26:36,417 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:26:36,417 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:26:36,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:26:36,420 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:26:36,422 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:26:36,425 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:26:36,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:26:36,427 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:26:36,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:26:36,429 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:26:36,430 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:26:36,431 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:26:36,432 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:26:36,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:26:36,434 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:26:36,436 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:26:36,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:26:36,440 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:26:36,441 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:26:36,443 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:26:36,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:26:36,446 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:26:36,447 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:26:36,447 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:26:36,448 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:26:36,449 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:26:36,450 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:26:36,450 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:26:36,451 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:26:36,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:26:36,452 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:26:36,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:26:36,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:26:36,455 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:26:36,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:26:36,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:26:36,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:26:36,457 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:26:36,458 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:26:36,472 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:26:36,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:26:36,474 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:26:36,474 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:26:36,474 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:26:36,475 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:26:36,475 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:26:36,475 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:26:36,476 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:26:36,476 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:26:36,476 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:26:36,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:26:36,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:26:36,477 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:26:36,477 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:26:36,478 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:26:36,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:26:36,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:26:36,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:26:36,479 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:26:36,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:26:36,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:26:36,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:26:36,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:26:36,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:26:36,481 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:26:36,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:26:36,481 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:26:36,481 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_f11436cf-0b1c-4ca7-919b-b4996ebbd018/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 -> bf350eece4e5f8a5f96c7b11a45bc95e4e002e5b [2019-11-15 22:26:36,512 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:26:36,523 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:26:36,527 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:26:36,529 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:26:36,529 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:26:36,530 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-1.c [2019-11-15 22:26:36,596 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/data/512cdcc13/668fe16d6811478293f831c151995e58/FLAG035312473 [2019-11-15 22:26:37,126 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:26:37,127 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-1.c [2019-11-15 22:26:37,150 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/data/512cdcc13/668fe16d6811478293f831c151995e58/FLAG035312473 [2019-11-15 22:26:37,357 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/data/512cdcc13/668fe16d6811478293f831c151995e58 [2019-11-15 22:26:37,361 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:26:37,363 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:26:37,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:26:37,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:26:37,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:26:37,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:26:37" (1/1) ... [2019-11-15 22:26:37,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5629fed1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:37, skipping insertion in model container [2019-11-15 22:26:37,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:26:37" (1/1) ... [2019-11-15 22:26:37,384 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:26:37,477 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:26:38,148 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:26:38,178 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:26:38,322 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:26:38,356 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:26:38,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:38 WrapperNode [2019-11-15 22:26:38,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:26:38,359 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:26:38,359 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:26:38,359 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:26:38,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:38" (1/1) ... [2019-11-15 22:26:38,411 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:38" (1/1) ... [2019-11-15 22:26:38,459 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:26:38,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:26:38,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:26:38,460 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:26:38,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:38" (1/1) ... [2019-11-15 22:26:38,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:38" (1/1) ... [2019-11-15 22:26:38,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:38" (1/1) ... [2019-11-15 22:26:38,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:38" (1/1) ... [2019-11-15 22:26:38,526 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:38" (1/1) ... [2019-11-15 22:26:38,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:38" (1/1) ... [2019-11-15 22:26:38,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:38" (1/1) ... [2019-11-15 22:26:38,548 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:26:38,549 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:26:38,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:26:38,549 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:26:38,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:26:38,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:26:38,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:26:38,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:26:38,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:26:38,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:26:38,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:26:38,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:26:38,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:26:38,962 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 22:26:40,032 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 22:26:40,033 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 22:26:40,034 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:26:40,034 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:26:40,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:26:40 BoogieIcfgContainer [2019-11-15 22:26:40,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:26:40,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:26:40,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:26:40,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:26:40,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:26:37" (1/3) ... [2019-11-15 22:26:40,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25235af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:26:40, skipping insertion in model container [2019-11-15 22:26:40,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:38" (2/3) ... [2019-11-15 22:26:40,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25235af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:26:40, skipping insertion in model container [2019-11-15 22:26:40,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:26:40" (3/3) ... [2019-11-15 22:26:40,046 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.14.i.cil-1.c [2019-11-15 22:26:40,060 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:26:40,070 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:26:40,083 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:26:40,117 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:26:40,118 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:26:40,118 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:26:40,118 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:26:40,118 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:26:40,118 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:26:40,118 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:26:40,119 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:26:40,145 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-11-15 22:26:40,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 22:26:40,162 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:40,163 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:40,166 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:40,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:40,171 INFO L82 PathProgramCache]: Analyzing trace with hash 102131601, now seen corresponding path program 1 times [2019-11-15 22:26:40,178 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:40,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72748143] [2019-11-15 22:26:40,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:40,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:40,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:40,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:40,497 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72748143] [2019-11-15 22:26:40,498 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:40,498 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:40,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328214106] [2019-11-15 22:26:40,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:40,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:40,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:40,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:40,521 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 4 states. [2019-11-15 22:26:41,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:41,163 INFO L93 Difference]: Finished difference Result 335 states and 571 transitions. [2019-11-15 22:26:41,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:41,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-11-15 22:26:41,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:41,183 INFO L225 Difference]: With dead ends: 335 [2019-11-15 22:26:41,183 INFO L226 Difference]: Without dead ends: 169 [2019-11-15 22:26:41,187 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:41,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-15 22:26:41,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2019-11-15 22:26:41,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-15 22:26:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 238 transitions. [2019-11-15 22:26:41,240 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 238 transitions. Word has length 43 [2019-11-15 22:26:41,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:41,241 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 238 transitions. [2019-11-15 22:26:41,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:41,242 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 238 transitions. [2019-11-15 22:26:41,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 22:26:41,247 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:41,247 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:41,247 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:41,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:41,248 INFO L82 PathProgramCache]: Analyzing trace with hash -946849282, now seen corresponding path program 1 times [2019-11-15 22:26:41,248 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:41,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410082985] [2019-11-15 22:26:41,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:41,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:41,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:41,467 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:41,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410082985] [2019-11-15 22:26:41,468 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:41,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:41,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675539910] [2019-11-15 22:26:41,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:41,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:41,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:41,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:41,471 INFO L87 Difference]: Start difference. First operand 152 states and 238 transitions. Second operand 4 states. [2019-11-15 22:26:41,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:41,989 INFO L93 Difference]: Finished difference Result 302 states and 467 transitions. [2019-11-15 22:26:41,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:41,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-15 22:26:41,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:41,992 INFO L225 Difference]: With dead ends: 302 [2019-11-15 22:26:41,992 INFO L226 Difference]: Without dead ends: 169 [2019-11-15 22:26:41,994 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:41,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-15 22:26:42,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2019-11-15 22:26:42,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-15 22:26:42,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 237 transitions. [2019-11-15 22:26:42,010 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 237 transitions. Word has length 56 [2019-11-15 22:26:42,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:42,011 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 237 transitions. [2019-11-15 22:26:42,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:42,011 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 237 transitions. [2019-11-15 22:26:42,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 22:26:42,014 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:42,015 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:42,015 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:42,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:42,015 INFO L82 PathProgramCache]: Analyzing trace with hash 186857616, now seen corresponding path program 1 times [2019-11-15 22:26:42,016 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:42,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701429146] [2019-11-15 22:26:42,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:42,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:42,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:42,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:42,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701429146] [2019-11-15 22:26:42,181 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:42,181 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:42,181 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652109062] [2019-11-15 22:26:42,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:42,183 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:42,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:42,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:42,184 INFO L87 Difference]: Start difference. First operand 152 states and 237 transitions. Second operand 4 states. [2019-11-15 22:26:42,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:42,564 INFO L93 Difference]: Finished difference Result 301 states and 465 transitions. [2019-11-15 22:26:42,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:42,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-15 22:26:42,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:42,567 INFO L225 Difference]: With dead ends: 301 [2019-11-15 22:26:42,567 INFO L226 Difference]: Without dead ends: 168 [2019-11-15 22:26:42,568 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:42,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-15 22:26:42,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 152. [2019-11-15 22:26:42,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-15 22:26:42,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 236 transitions. [2019-11-15 22:26:42,584 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 236 transitions. Word has length 57 [2019-11-15 22:26:42,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:42,584 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 236 transitions. [2019-11-15 22:26:42,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:42,586 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 236 transitions. [2019-11-15 22:26:42,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 22:26:42,593 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:42,594 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:42,594 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:42,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:42,595 INFO L82 PathProgramCache]: Analyzing trace with hash -781576005, now seen corresponding path program 1 times [2019-11-15 22:26:42,595 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:42,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206795602] [2019-11-15 22:26:42,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:42,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:42,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:42,744 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:42,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206795602] [2019-11-15 22:26:42,745 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:42,746 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:42,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690434001] [2019-11-15 22:26:42,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:42,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:42,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:42,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:42,748 INFO L87 Difference]: Start difference. First operand 152 states and 236 transitions. Second operand 4 states. [2019-11-15 22:26:43,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:43,197 INFO L93 Difference]: Finished difference Result 299 states and 462 transitions. [2019-11-15 22:26:43,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:43,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-15 22:26:43,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:43,200 INFO L225 Difference]: With dead ends: 299 [2019-11-15 22:26:43,200 INFO L226 Difference]: Without dead ends: 166 [2019-11-15 22:26:43,201 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:43,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-15 22:26:43,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 152. [2019-11-15 22:26:43,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-15 22:26:43,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 235 transitions. [2019-11-15 22:26:43,225 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 235 transitions. Word has length 57 [2019-11-15 22:26:43,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:43,227 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 235 transitions. [2019-11-15 22:26:43,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:43,227 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 235 transitions. [2019-11-15 22:26:43,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 22:26:43,234 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:43,234 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:43,234 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:43,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:43,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1221644283, now seen corresponding path program 1 times [2019-11-15 22:26:43,235 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:43,235 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838228571] [2019-11-15 22:26:43,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:43,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:43,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:43,359 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838228571] [2019-11-15 22:26:43,359 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:43,359 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:43,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818060086] [2019-11-15 22:26:43,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:43,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:43,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:43,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:43,363 INFO L87 Difference]: Start difference. First operand 152 states and 235 transitions. Second operand 4 states. [2019-11-15 22:26:43,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:43,763 INFO L93 Difference]: Finished difference Result 298 states and 460 transitions. [2019-11-15 22:26:43,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:43,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-15 22:26:43,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:43,765 INFO L225 Difference]: With dead ends: 298 [2019-11-15 22:26:43,765 INFO L226 Difference]: Without dead ends: 165 [2019-11-15 22:26:43,766 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:43,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-15 22:26:43,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 152. [2019-11-15 22:26:43,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-15 22:26:43,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 234 transitions. [2019-11-15 22:26:43,775 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 234 transitions. Word has length 57 [2019-11-15 22:26:43,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:43,775 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 234 transitions. [2019-11-15 22:26:43,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:43,776 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 234 transitions. [2019-11-15 22:26:43,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 22:26:43,777 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:43,777 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:43,777 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:43,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:43,778 INFO L82 PathProgramCache]: Analyzing trace with hash 2073761060, now seen corresponding path program 1 times [2019-11-15 22:26:43,778 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:43,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482733108] [2019-11-15 22:26:43,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:43,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:43,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:43,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:43,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482733108] [2019-11-15 22:26:43,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:43,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:43,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264514116] [2019-11-15 22:26:43,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:43,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:43,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:43,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:43,841 INFO L87 Difference]: Start difference. First operand 152 states and 234 transitions. Second operand 4 states. [2019-11-15 22:26:44,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:44,202 INFO L93 Difference]: Finished difference Result 298 states and 459 transitions. [2019-11-15 22:26:44,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:44,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-15 22:26:44,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:44,205 INFO L225 Difference]: With dead ends: 298 [2019-11-15 22:26:44,205 INFO L226 Difference]: Without dead ends: 165 [2019-11-15 22:26:44,205 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:44,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-15 22:26:44,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 152. [2019-11-15 22:26:44,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-15 22:26:44,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 233 transitions. [2019-11-15 22:26:44,213 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 233 transitions. Word has length 57 [2019-11-15 22:26:44,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:44,214 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 233 transitions. [2019-11-15 22:26:44,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:44,214 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 233 transitions. [2019-11-15 22:26:44,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 22:26:44,215 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:44,215 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:44,216 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:44,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:44,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1080146745, now seen corresponding path program 1 times [2019-11-15 22:26:44,217 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:44,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186693710] [2019-11-15 22:26:44,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:44,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:44,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:44,277 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:44,278 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186693710] [2019-11-15 22:26:44,278 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:44,278 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:44,278 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63945506] [2019-11-15 22:26:44,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:44,279 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:44,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:44,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:44,280 INFO L87 Difference]: Start difference. First operand 152 states and 233 transitions. Second operand 4 states. [2019-11-15 22:26:44,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:44,670 INFO L93 Difference]: Finished difference Result 298 states and 458 transitions. [2019-11-15 22:26:44,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:44,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-15 22:26:44,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:44,674 INFO L225 Difference]: With dead ends: 298 [2019-11-15 22:26:44,674 INFO L226 Difference]: Without dead ends: 165 [2019-11-15 22:26:44,675 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:44,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-15 22:26:44,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 152. [2019-11-15 22:26:44,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-15 22:26:44,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 232 transitions. [2019-11-15 22:26:44,681 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 232 transitions. Word has length 58 [2019-11-15 22:26:44,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:44,682 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 232 transitions. [2019-11-15 22:26:44,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:44,682 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 232 transitions. [2019-11-15 22:26:44,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 22:26:44,684 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:44,684 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:44,684 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:44,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:44,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1197721801, now seen corresponding path program 1 times [2019-11-15 22:26:44,685 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:44,686 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242548720] [2019-11-15 22:26:44,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:44,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:44,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:44,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:44,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242548720] [2019-11-15 22:26:44,773 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:44,773 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:44,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123355540] [2019-11-15 22:26:44,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:44,774 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:44,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:44,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:44,775 INFO L87 Difference]: Start difference. First operand 152 states and 232 transitions. Second operand 4 states. [2019-11-15 22:26:45,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:45,116 INFO L93 Difference]: Finished difference Result 298 states and 457 transitions. [2019-11-15 22:26:45,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:45,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 22:26:45,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:45,119 INFO L225 Difference]: With dead ends: 298 [2019-11-15 22:26:45,119 INFO L226 Difference]: Without dead ends: 165 [2019-11-15 22:26:45,120 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:45,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-15 22:26:45,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 152. [2019-11-15 22:26:45,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-15 22:26:45,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2019-11-15 22:26:45,126 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 59 [2019-11-15 22:26:45,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:45,127 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2019-11-15 22:26:45,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:45,127 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2019-11-15 22:26:45,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 22:26:45,128 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:45,128 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:45,129 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:45,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:45,129 INFO L82 PathProgramCache]: Analyzing trace with hash 61965388, now seen corresponding path program 1 times [2019-11-15 22:26:45,129 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:45,130 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640280748] [2019-11-15 22:26:45,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:45,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:45,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:45,197 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:45,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640280748] [2019-11-15 22:26:45,198 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:45,198 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:45,198 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145679640] [2019-11-15 22:26:45,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:45,199 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:45,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:45,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:45,200 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand 4 states. [2019-11-15 22:26:45,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:45,545 INFO L93 Difference]: Finished difference Result 288 states and 443 transitions. [2019-11-15 22:26:45,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:45,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-15 22:26:45,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:45,547 INFO L225 Difference]: With dead ends: 288 [2019-11-15 22:26:45,547 INFO L226 Difference]: Without dead ends: 155 [2019-11-15 22:26:45,548 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:45,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-15 22:26:45,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2019-11-15 22:26:45,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-15 22:26:45,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 230 transitions. [2019-11-15 22:26:45,557 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 230 transitions. Word has length 60 [2019-11-15 22:26:45,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:45,558 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 230 transitions. [2019-11-15 22:26:45,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:45,559 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 230 transitions. [2019-11-15 22:26:45,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 22:26:45,562 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:45,562 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:45,563 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:45,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:45,563 INFO L82 PathProgramCache]: Analyzing trace with hash -549908044, now seen corresponding path program 1 times [2019-11-15 22:26:45,563 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:45,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684415527] [2019-11-15 22:26:45,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:45,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:45,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:45,666 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:45,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684415527] [2019-11-15 22:26:45,666 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:45,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:45,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066402961] [2019-11-15 22:26:45,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:45,668 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:45,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:45,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:45,668 INFO L87 Difference]: Start difference. First operand 152 states and 230 transitions. Second operand 4 states. [2019-11-15 22:26:46,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:46,065 INFO L93 Difference]: Finished difference Result 328 states and 504 transitions. [2019-11-15 22:26:46,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:46,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-15 22:26:46,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:46,067 INFO L225 Difference]: With dead ends: 328 [2019-11-15 22:26:46,067 INFO L226 Difference]: Without dead ends: 195 [2019-11-15 22:26:46,068 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:46,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-15 22:26:46,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 174. [2019-11-15 22:26:46,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-15 22:26:46,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 268 transitions. [2019-11-15 22:26:46,075 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 268 transitions. Word has length 60 [2019-11-15 22:26:46,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:46,075 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 268 transitions. [2019-11-15 22:26:46,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:46,076 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 268 transitions. [2019-11-15 22:26:46,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 22:26:46,077 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:46,077 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:46,077 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:46,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:46,078 INFO L82 PathProgramCache]: Analyzing trace with hash 2128896187, now seen corresponding path program 1 times [2019-11-15 22:26:46,078 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:46,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165686750] [2019-11-15 22:26:46,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:46,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:46,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:46,143 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:46,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165686750] [2019-11-15 22:26:46,143 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:46,144 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:46,144 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616020522] [2019-11-15 22:26:46,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:46,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:46,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:46,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:46,146 INFO L87 Difference]: Start difference. First operand 174 states and 268 transitions. Second operand 4 states. [2019-11-15 22:26:46,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:46,623 INFO L93 Difference]: Finished difference Result 350 states and 541 transitions. [2019-11-15 22:26:46,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:46,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-15 22:26:46,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:46,625 INFO L225 Difference]: With dead ends: 350 [2019-11-15 22:26:46,625 INFO L226 Difference]: Without dead ends: 195 [2019-11-15 22:26:46,625 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:46,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-15 22:26:46,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 174. [2019-11-15 22:26:46,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-15 22:26:46,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 267 transitions. [2019-11-15 22:26:46,633 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 267 transitions. Word has length 73 [2019-11-15 22:26:46,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:46,634 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 267 transitions. [2019-11-15 22:26:46,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:46,634 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 267 transitions. [2019-11-15 22:26:46,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 22:26:46,635 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:46,635 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:46,636 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:46,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:46,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1045686643, now seen corresponding path program 1 times [2019-11-15 22:26:46,636 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:46,637 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818871737] [2019-11-15 22:26:46,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:46,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:46,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:46,704 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:46,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818871737] [2019-11-15 22:26:46,704 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:46,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:46,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473345491] [2019-11-15 22:26:46,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:46,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:46,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:46,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:46,707 INFO L87 Difference]: Start difference. First operand 174 states and 267 transitions. Second operand 4 states. [2019-11-15 22:26:47,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:47,246 INFO L93 Difference]: Finished difference Result 349 states and 538 transitions. [2019-11-15 22:26:47,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:47,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-15 22:26:47,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:47,249 INFO L225 Difference]: With dead ends: 349 [2019-11-15 22:26:47,249 INFO L226 Difference]: Without dead ends: 194 [2019-11-15 22:26:47,250 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:47,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-15 22:26:47,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 174. [2019-11-15 22:26:47,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-15 22:26:47,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 266 transitions. [2019-11-15 22:26:47,257 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 266 transitions. Word has length 74 [2019-11-15 22:26:47,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:47,257 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 266 transitions. [2019-11-15 22:26:47,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:47,257 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 266 transitions. [2019-11-15 22:26:47,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 22:26:47,258 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:47,259 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:47,259 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:47,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:47,263 INFO L82 PathProgramCache]: Analyzing trace with hash 77253022, now seen corresponding path program 1 times [2019-11-15 22:26:47,263 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:47,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712956582] [2019-11-15 22:26:47,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:47,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:47,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:47,336 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:47,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712956582] [2019-11-15 22:26:47,336 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:47,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:47,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267266315] [2019-11-15 22:26:47,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:47,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:47,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:47,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:47,339 INFO L87 Difference]: Start difference. First operand 174 states and 266 transitions. Second operand 4 states. [2019-11-15 22:26:47,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:47,749 INFO L93 Difference]: Finished difference Result 347 states and 534 transitions. [2019-11-15 22:26:47,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:47,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-15 22:26:47,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:47,752 INFO L225 Difference]: With dead ends: 347 [2019-11-15 22:26:47,752 INFO L226 Difference]: Without dead ends: 192 [2019-11-15 22:26:47,753 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:47,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-15 22:26:47,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 174. [2019-11-15 22:26:47,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-15 22:26:47,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 265 transitions. [2019-11-15 22:26:47,759 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 265 transitions. Word has length 74 [2019-11-15 22:26:47,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:47,760 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 265 transitions. [2019-11-15 22:26:47,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:47,760 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 265 transitions. [2019-11-15 22:26:47,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 22:26:47,761 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:47,761 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:47,762 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:47,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:47,762 INFO L82 PathProgramCache]: Analyzing trace with hash 2080473310, now seen corresponding path program 1 times [2019-11-15 22:26:47,762 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:47,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267690058] [2019-11-15 22:26:47,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:47,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:47,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:47,823 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:47,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267690058] [2019-11-15 22:26:47,824 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:47,824 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:47,824 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715019597] [2019-11-15 22:26:47,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:47,825 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:47,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:47,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:47,826 INFO L87 Difference]: Start difference. First operand 174 states and 265 transitions. Second operand 4 states. [2019-11-15 22:26:48,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:48,235 INFO L93 Difference]: Finished difference Result 346 states and 531 transitions. [2019-11-15 22:26:48,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:48,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-15 22:26:48,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:48,237 INFO L225 Difference]: With dead ends: 346 [2019-11-15 22:26:48,237 INFO L226 Difference]: Without dead ends: 191 [2019-11-15 22:26:48,238 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:48,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-15 22:26:48,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 174. [2019-11-15 22:26:48,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-15 22:26:48,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 264 transitions. [2019-11-15 22:26:48,244 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 264 transitions. Word has length 74 [2019-11-15 22:26:48,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:48,245 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 264 transitions. [2019-11-15 22:26:48,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:48,245 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 264 transitions. [2019-11-15 22:26:48,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 22:26:48,246 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:48,246 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:48,247 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:48,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:48,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1362377209, now seen corresponding path program 1 times [2019-11-15 22:26:48,247 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:48,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298491193] [2019-11-15 22:26:48,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:48,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:48,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:48,297 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:48,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298491193] [2019-11-15 22:26:48,298 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:48,298 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:48,298 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61757339] [2019-11-15 22:26:48,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:48,299 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:48,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:48,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:48,300 INFO L87 Difference]: Start difference. First operand 174 states and 264 transitions. Second operand 4 states. [2019-11-15 22:26:48,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:48,718 INFO L93 Difference]: Finished difference Result 346 states and 529 transitions. [2019-11-15 22:26:48,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:48,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-15 22:26:48,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:48,720 INFO L225 Difference]: With dead ends: 346 [2019-11-15 22:26:48,720 INFO L226 Difference]: Without dead ends: 191 [2019-11-15 22:26:48,721 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:48,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-15 22:26:48,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 174. [2019-11-15 22:26:48,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-15 22:26:48,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 263 transitions. [2019-11-15 22:26:48,731 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 263 transitions. Word has length 74 [2019-11-15 22:26:48,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:48,731 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 263 transitions. [2019-11-15 22:26:48,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:48,732 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 263 transitions. [2019-11-15 22:26:48,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 22:26:48,733 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:48,733 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:48,733 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:48,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:48,734 INFO L82 PathProgramCache]: Analyzing trace with hash -226250684, now seen corresponding path program 1 times [2019-11-15 22:26:48,734 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:48,734 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831739902] [2019-11-15 22:26:48,734 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:48,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:48,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:48,789 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:48,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831739902] [2019-11-15 22:26:48,791 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:48,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:48,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395838336] [2019-11-15 22:26:48,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:48,793 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:48,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:48,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:48,793 INFO L87 Difference]: Start difference. First operand 174 states and 263 transitions. Second operand 4 states. [2019-11-15 22:26:49,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:49,187 INFO L93 Difference]: Finished difference Result 346 states and 527 transitions. [2019-11-15 22:26:49,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:49,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-15 22:26:49,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:49,190 INFO L225 Difference]: With dead ends: 346 [2019-11-15 22:26:49,190 INFO L226 Difference]: Without dead ends: 191 [2019-11-15 22:26:49,190 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:49,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-15 22:26:49,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 174. [2019-11-15 22:26:49,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-15 22:26:49,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 262 transitions. [2019-11-15 22:26:49,200 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 262 transitions. Word has length 75 [2019-11-15 22:26:49,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:49,200 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 262 transitions. [2019-11-15 22:26:49,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:49,201 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 262 transitions. [2019-11-15 22:26:49,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 22:26:49,204 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:49,204 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:49,204 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:49,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:49,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1898695916, now seen corresponding path program 1 times [2019-11-15 22:26:49,205 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:49,205 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466614992] [2019-11-15 22:26:49,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:49,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:49,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:49,265 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:49,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466614992] [2019-11-15 22:26:49,266 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:49,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:49,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973068017] [2019-11-15 22:26:49,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:49,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:49,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:49,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:49,268 INFO L87 Difference]: Start difference. First operand 174 states and 262 transitions. Second operand 4 states. [2019-11-15 22:26:49,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:49,718 INFO L93 Difference]: Finished difference Result 346 states and 525 transitions. [2019-11-15 22:26:49,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:49,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 22:26:49,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:49,720 INFO L225 Difference]: With dead ends: 346 [2019-11-15 22:26:49,720 INFO L226 Difference]: Without dead ends: 191 [2019-11-15 22:26:49,721 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:49,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-15 22:26:49,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 174. [2019-11-15 22:26:49,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-15 22:26:49,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 261 transitions. [2019-11-15 22:26:49,728 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 261 transitions. Word has length 76 [2019-11-15 22:26:49,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:49,729 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 261 transitions. [2019-11-15 22:26:49,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:49,729 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 261 transitions. [2019-11-15 22:26:49,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-15 22:26:49,730 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:49,730 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:49,731 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:49,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:49,731 INFO L82 PathProgramCache]: Analyzing trace with hash 317326473, now seen corresponding path program 1 times [2019-11-15 22:26:49,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:49,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6969976] [2019-11-15 22:26:49,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:49,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:49,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:49,804 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:49,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6969976] [2019-11-15 22:26:49,805 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:49,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:49,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635919931] [2019-11-15 22:26:49,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:49,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:49,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:49,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:49,807 INFO L87 Difference]: Start difference. First operand 174 states and 261 transitions. Second operand 4 states. [2019-11-15 22:26:50,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:50,159 INFO L93 Difference]: Finished difference Result 336 states and 510 transitions. [2019-11-15 22:26:50,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:50,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-15 22:26:50,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:50,161 INFO L225 Difference]: With dead ends: 336 [2019-11-15 22:26:50,161 INFO L226 Difference]: Without dead ends: 181 [2019-11-15 22:26:50,162 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:50,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-15 22:26:50,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 174. [2019-11-15 22:26:50,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-15 22:26:50,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 260 transitions. [2019-11-15 22:26:50,168 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 260 transitions. Word has length 77 [2019-11-15 22:26:50,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:50,168 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 260 transitions. [2019-11-15 22:26:50,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:50,168 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 260 transitions. [2019-11-15 22:26:50,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 22:26:50,169 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:50,170 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:50,170 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:50,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:50,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1100428173, now seen corresponding path program 1 times [2019-11-15 22:26:50,171 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:50,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509752757] [2019-11-15 22:26:50,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:50,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:50,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:50,266 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:26:50,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509752757] [2019-11-15 22:26:50,267 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:50,267 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:50,267 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794459642] [2019-11-15 22:26:50,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:50,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:50,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:50,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:50,272 INFO L87 Difference]: Start difference. First operand 174 states and 260 transitions. Second operand 4 states. [2019-11-15 22:26:50,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:50,933 INFO L93 Difference]: Finished difference Result 441 states and 673 transitions. [2019-11-15 22:26:50,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:50,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-15 22:26:50,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:50,937 INFO L225 Difference]: With dead ends: 441 [2019-11-15 22:26:50,937 INFO L226 Difference]: Without dead ends: 286 [2019-11-15 22:26:50,938 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:50,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-11-15 22:26:50,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 215. [2019-11-15 22:26:50,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-11-15 22:26:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 334 transitions. [2019-11-15 22:26:50,947 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 334 transitions. Word has length 82 [2019-11-15 22:26:50,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:50,948 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 334 transitions. [2019-11-15 22:26:50,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:50,948 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 334 transitions. [2019-11-15 22:26:50,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 22:26:50,950 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:50,950 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:50,950 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:50,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:50,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1524074895, now seen corresponding path program 1 times [2019-11-15 22:26:50,951 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:50,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011226226] [2019-11-15 22:26:50,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:50,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:50,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:51,035 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:26:51,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011226226] [2019-11-15 22:26:51,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:51,036 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:51,036 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590015709] [2019-11-15 22:26:51,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:51,037 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:51,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:51,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:51,037 INFO L87 Difference]: Start difference. First operand 215 states and 334 transitions. Second operand 4 states. [2019-11-15 22:26:51,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:51,533 INFO L93 Difference]: Finished difference Result 461 states and 723 transitions. [2019-11-15 22:26:51,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:51,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-15 22:26:51,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:51,537 INFO L225 Difference]: With dead ends: 461 [2019-11-15 22:26:51,537 INFO L226 Difference]: Without dead ends: 265 [2019-11-15 22:26:51,537 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:51,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-11-15 22:26:51,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 239. [2019-11-15 22:26:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-11-15 22:26:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 376 transitions. [2019-11-15 22:26:51,546 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 376 transitions. Word has length 82 [2019-11-15 22:26:51,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:51,547 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 376 transitions. [2019-11-15 22:26:51,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:51,547 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 376 transitions. [2019-11-15 22:26:51,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 22:26:51,549 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:51,549 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:51,549 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:51,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:51,550 INFO L82 PathProgramCache]: Analyzing trace with hash 866488115, now seen corresponding path program 1 times [2019-11-15 22:26:51,550 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:51,551 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111901972] [2019-11-15 22:26:51,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:51,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:51,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:51,690 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:26:51,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111901972] [2019-11-15 22:26:51,691 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:51,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:51,691 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039103241] [2019-11-15 22:26:51,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:51,692 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:51,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:51,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:51,694 INFO L87 Difference]: Start difference. First operand 239 states and 376 transitions. Second operand 4 states. [2019-11-15 22:26:52,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:52,245 INFO L93 Difference]: Finished difference Result 522 states and 819 transitions. [2019-11-15 22:26:52,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:52,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-11-15 22:26:52,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:52,248 INFO L225 Difference]: With dead ends: 522 [2019-11-15 22:26:52,249 INFO L226 Difference]: Without dead ends: 302 [2019-11-15 22:26:52,249 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:52,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-15 22:26:52,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 240. [2019-11-15 22:26:52,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-11-15 22:26:52,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 377 transitions. [2019-11-15 22:26:52,257 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 377 transitions. Word has length 83 [2019-11-15 22:26:52,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:52,257 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 377 transitions. [2019-11-15 22:26:52,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:52,258 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 377 transitions. [2019-11-15 22:26:52,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 22:26:52,259 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:52,259 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:52,259 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:52,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:52,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1900267394, now seen corresponding path program 1 times [2019-11-15 22:26:52,260 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:52,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662741238] [2019-11-15 22:26:52,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:52,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:52,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:52,365 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:26:52,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662741238] [2019-11-15 22:26:52,366 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:52,366 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:52,367 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535801124] [2019-11-15 22:26:52,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:52,367 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:52,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:52,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:52,368 INFO L87 Difference]: Start difference. First operand 240 states and 377 transitions. Second operand 4 states. [2019-11-15 22:26:53,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:53,011 INFO L93 Difference]: Finished difference Result 523 states and 819 transitions. [2019-11-15 22:26:53,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:53,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 22:26:53,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:53,017 INFO L225 Difference]: With dead ends: 523 [2019-11-15 22:26:53,017 INFO L226 Difference]: Without dead ends: 302 [2019-11-15 22:26:53,018 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:53,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-15 22:26:53,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 240. [2019-11-15 22:26:53,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-11-15 22:26:53,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 376 transitions. [2019-11-15 22:26:53,028 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 376 transitions. Word has length 95 [2019-11-15 22:26:53,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:53,028 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 376 transitions. [2019-11-15 22:26:53,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:53,028 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 376 transitions. [2019-11-15 22:26:53,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 22:26:53,030 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:53,030 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:53,030 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:53,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:53,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1518680896, now seen corresponding path program 1 times [2019-11-15 22:26:53,031 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:53,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615428855] [2019-11-15 22:26:53,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:53,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:53,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:53,110 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:26:53,111 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615428855] [2019-11-15 22:26:53,111 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:53,111 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:53,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088624466] [2019-11-15 22:26:53,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:53,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:53,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:53,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:53,114 INFO L87 Difference]: Start difference. First operand 240 states and 376 transitions. Second operand 4 states. [2019-11-15 22:26:53,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:53,632 INFO L93 Difference]: Finished difference Result 487 states and 764 transitions. [2019-11-15 22:26:53,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:53,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 22:26:53,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:53,635 INFO L225 Difference]: With dead ends: 487 [2019-11-15 22:26:53,635 INFO L226 Difference]: Without dead ends: 266 [2019-11-15 22:26:53,636 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:53,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-15 22:26:53,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 240. [2019-11-15 22:26:53,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-11-15 22:26:53,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 375 transitions. [2019-11-15 22:26:53,644 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 375 transitions. Word has length 95 [2019-11-15 22:26:53,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:53,645 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 375 transitions. [2019-11-15 22:26:53,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:53,645 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 375 transitions. [2019-11-15 22:26:53,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 22:26:53,646 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:53,646 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:53,647 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:53,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:53,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1746838644, now seen corresponding path program 1 times [2019-11-15 22:26:53,648 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:53,648 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264147227] [2019-11-15 22:26:53,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:53,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:53,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:53,716 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:26:53,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264147227] [2019-11-15 22:26:53,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:53,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:53,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656595694] [2019-11-15 22:26:53,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:53,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:53,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:53,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:53,719 INFO L87 Difference]: Start difference. First operand 240 states and 375 transitions. Second operand 4 states. [2019-11-15 22:26:54,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:54,314 INFO L93 Difference]: Finished difference Result 522 states and 814 transitions. [2019-11-15 22:26:54,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:54,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 22:26:54,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:54,318 INFO L225 Difference]: With dead ends: 522 [2019-11-15 22:26:54,318 INFO L226 Difference]: Without dead ends: 301 [2019-11-15 22:26:54,320 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:54,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-15 22:26:54,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 240. [2019-11-15 22:26:54,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-11-15 22:26:54,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 374 transitions. [2019-11-15 22:26:54,329 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 374 transitions. Word has length 96 [2019-11-15 22:26:54,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:54,330 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 374 transitions. [2019-11-15 22:26:54,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:54,330 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 374 transitions. [2019-11-15 22:26:54,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 22:26:54,331 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:54,332 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:54,332 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:54,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:54,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1579695031, now seen corresponding path program 1 times [2019-11-15 22:26:54,333 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:54,333 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000863219] [2019-11-15 22:26:54,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:54,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:54,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:54,434 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:26:54,434 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000863219] [2019-11-15 22:26:54,435 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:54,435 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:54,435 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50551057] [2019-11-15 22:26:54,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:54,436 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:54,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:54,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:54,437 INFO L87 Difference]: Start difference. First operand 240 states and 374 transitions. Second operand 4 states. [2019-11-15 22:26:54,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:54,996 INFO L93 Difference]: Finished difference Result 520 states and 810 transitions. [2019-11-15 22:26:54,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:54,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 22:26:54,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:54,999 INFO L225 Difference]: With dead ends: 520 [2019-11-15 22:26:54,999 INFO L226 Difference]: Without dead ends: 299 [2019-11-15 22:26:55,000 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:55,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-15 22:26:55,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 240. [2019-11-15 22:26:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-11-15 22:26:55,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 373 transitions. [2019-11-15 22:26:55,007 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 373 transitions. Word has length 96 [2019-11-15 22:26:55,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:55,007 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 373 transitions. [2019-11-15 22:26:55,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:55,007 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 373 transitions. [2019-11-15 22:26:55,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 22:26:55,009 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:55,009 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:55,009 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:55,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:55,010 INFO L82 PathProgramCache]: Analyzing trace with hash -712051977, now seen corresponding path program 1 times [2019-11-15 22:26:55,010 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:55,011 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366202728] [2019-11-15 22:26:55,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:55,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:55,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:55,094 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:26:55,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366202728] [2019-11-15 22:26:55,096 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:55,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:55,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347532713] [2019-11-15 22:26:55,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:55,097 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:55,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:55,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:55,098 INFO L87 Difference]: Start difference. First operand 240 states and 373 transitions. Second operand 4 states. [2019-11-15 22:26:55,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:55,663 INFO L93 Difference]: Finished difference Result 519 states and 807 transitions. [2019-11-15 22:26:55,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:55,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 22:26:55,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:55,666 INFO L225 Difference]: With dead ends: 519 [2019-11-15 22:26:55,667 INFO L226 Difference]: Without dead ends: 298 [2019-11-15 22:26:55,667 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:55,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-15 22:26:55,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 240. [2019-11-15 22:26:55,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-11-15 22:26:55,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 372 transitions. [2019-11-15 22:26:55,675 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 372 transitions. Word has length 96 [2019-11-15 22:26:55,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:55,676 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 372 transitions. [2019-11-15 22:26:55,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:55,676 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 372 transitions. [2019-11-15 22:26:55,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 22:26:55,678 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:55,678 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:55,678 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:55,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:55,679 INFO L82 PathProgramCache]: Analyzing trace with hash 140064800, now seen corresponding path program 1 times [2019-11-15 22:26:55,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:55,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056902524] [2019-11-15 22:26:55,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:55,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:55,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:55,788 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 22:26:55,790 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056902524] [2019-11-15 22:26:55,790 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:55,790 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:26:55,790 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999395725] [2019-11-15 22:26:55,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:26:55,791 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:55,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:26:55,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:55,792 INFO L87 Difference]: Start difference. First operand 240 states and 372 transitions. Second operand 5 states. [2019-11-15 22:26:56,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:56,379 INFO L93 Difference]: Finished difference Result 482 states and 752 transitions. [2019-11-15 22:26:56,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:26:56,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-11-15 22:26:56,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:56,381 INFO L225 Difference]: With dead ends: 482 [2019-11-15 22:26:56,381 INFO L226 Difference]: Without dead ends: 261 [2019-11-15 22:26:56,382 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:26:56,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-15 22:26:56,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 260. [2019-11-15 22:26:56,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-15 22:26:56,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 398 transitions. [2019-11-15 22:26:56,390 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 398 transitions. Word has length 96 [2019-11-15 22:26:56,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:56,391 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 398 transitions. [2019-11-15 22:26:56,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:26:56,391 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 398 transitions. [2019-11-15 22:26:56,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 22:26:56,392 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:56,393 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:56,393 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:56,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:56,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1328486855, now seen corresponding path program 1 times [2019-11-15 22:26:56,394 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:56,394 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617483237] [2019-11-15 22:26:56,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:56,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:56,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:56,462 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:26:56,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617483237] [2019-11-15 22:26:56,463 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:56,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:56,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725275260] [2019-11-15 22:26:56,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:56,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:56,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:56,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:56,465 INFO L87 Difference]: Start difference. First operand 260 states and 398 transitions. Second operand 4 states. [2019-11-15 22:26:56,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:56,796 INFO L93 Difference]: Finished difference Result 524 states and 804 transitions. [2019-11-15 22:26:56,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:56,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 22:26:56,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:56,799 INFO L225 Difference]: With dead ends: 524 [2019-11-15 22:26:56,799 INFO L226 Difference]: Without dead ends: 283 [2019-11-15 22:26:56,799 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:56,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-15 22:26:56,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 260. [2019-11-15 22:26:56,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-15 22:26:56,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 397 transitions. [2019-11-15 22:26:56,807 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 397 transitions. Word has length 96 [2019-11-15 22:26:56,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:56,807 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 397 transitions. [2019-11-15 22:26:56,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:56,807 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 397 transitions. [2019-11-15 22:26:56,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 22:26:56,809 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:56,809 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:56,809 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:56,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:56,810 INFO L82 PathProgramCache]: Analyzing trace with hash 674733433, now seen corresponding path program 1 times [2019-11-15 22:26:56,810 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:56,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376183099] [2019-11-15 22:26:56,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:56,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:56,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:56,879 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:26:56,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376183099] [2019-11-15 22:26:56,880 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:56,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:56,881 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275831120] [2019-11-15 22:26:56,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:56,881 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:56,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:56,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:56,882 INFO L87 Difference]: Start difference. First operand 260 states and 397 transitions. Second operand 4 states. [2019-11-15 22:26:57,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:57,277 INFO L93 Difference]: Finished difference Result 523 states and 801 transitions. [2019-11-15 22:26:57,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:57,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 22:26:57,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:57,280 INFO L225 Difference]: With dead ends: 523 [2019-11-15 22:26:57,280 INFO L226 Difference]: Without dead ends: 282 [2019-11-15 22:26:57,280 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:57,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-15 22:26:57,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-11-15 22:26:57,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-15 22:26:57,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 396 transitions. [2019-11-15 22:26:57,288 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 396 transitions. Word has length 96 [2019-11-15 22:26:57,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:57,288 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 396 transitions. [2019-11-15 22:26:57,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:57,288 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 396 transitions. [2019-11-15 22:26:57,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 22:26:57,289 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:57,290 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:57,290 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:57,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:57,291 INFO L82 PathProgramCache]: Analyzing trace with hash -232829186, now seen corresponding path program 1 times [2019-11-15 22:26:57,291 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:57,291 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842557116] [2019-11-15 22:26:57,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:57,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:57,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:57,361 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:26:57,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842557116] [2019-11-15 22:26:57,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:57,362 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:57,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821655112] [2019-11-15 22:26:57,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:57,363 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:57,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:57,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:57,364 INFO L87 Difference]: Start difference. First operand 260 states and 396 transitions. Second operand 4 states. [2019-11-15 22:26:57,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:57,873 INFO L93 Difference]: Finished difference Result 559 states and 852 transitions. [2019-11-15 22:26:57,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:57,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 22:26:57,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:57,878 INFO L225 Difference]: With dead ends: 559 [2019-11-15 22:26:57,878 INFO L226 Difference]: Without dead ends: 318 [2019-11-15 22:26:57,878 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:57,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-15 22:26:57,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 260. [2019-11-15 22:26:57,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-15 22:26:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 395 transitions. [2019-11-15 22:26:57,887 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 395 transitions. Word has length 97 [2019-11-15 22:26:57,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:57,887 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 395 transitions. [2019-11-15 22:26:57,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:57,888 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 395 transitions. [2019-11-15 22:26:57,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 22:26:57,889 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:57,889 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:57,889 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:57,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:57,890 INFO L82 PathProgramCache]: Analyzing trace with hash -192154436, now seen corresponding path program 1 times [2019-11-15 22:26:57,890 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:57,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576973607] [2019-11-15 22:26:57,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:57,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:57,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:57,956 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:26:57,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576973607] [2019-11-15 22:26:57,957 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:57,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:57,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50812475] [2019-11-15 22:26:57,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:57,958 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:57,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:57,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:57,959 INFO L87 Difference]: Start difference. First operand 260 states and 395 transitions. Second operand 4 states. [2019-11-15 22:26:58,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:58,294 INFO L93 Difference]: Finished difference Result 523 states and 797 transitions. [2019-11-15 22:26:58,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:58,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 22:26:58,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:58,296 INFO L225 Difference]: With dead ends: 523 [2019-11-15 22:26:58,296 INFO L226 Difference]: Without dead ends: 282 [2019-11-15 22:26:58,296 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:58,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-15 22:26:58,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-11-15 22:26:58,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-15 22:26:58,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2019-11-15 22:26:58,305 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 97 [2019-11-15 22:26:58,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:58,305 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2019-11-15 22:26:58,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:58,305 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2019-11-15 22:26:58,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:26:58,307 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:58,307 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:58,307 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:58,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:58,308 INFO L82 PathProgramCache]: Analyzing trace with hash 2034051891, now seen corresponding path program 1 times [2019-11-15 22:26:58,308 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:58,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049824960] [2019-11-15 22:26:58,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:58,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:58,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:58,391 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:26:58,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049824960] [2019-11-15 22:26:58,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:58,392 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:58,392 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15589265] [2019-11-15 22:26:58,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:58,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:58,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:58,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:58,393 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 4 states. [2019-11-15 22:26:58,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:58,753 INFO L93 Difference]: Finished difference Result 559 states and 848 transitions. [2019-11-15 22:26:58,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:58,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 22:26:58,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:58,755 INFO L225 Difference]: With dead ends: 559 [2019-11-15 22:26:58,755 INFO L226 Difference]: Without dead ends: 318 [2019-11-15 22:26:58,756 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:58,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-15 22:26:58,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 260. [2019-11-15 22:26:58,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-15 22:26:58,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 393 transitions. [2019-11-15 22:26:58,764 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 393 transitions. Word has length 98 [2019-11-15 22:26:58,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:58,765 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 393 transitions. [2019-11-15 22:26:58,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:58,765 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 393 transitions. [2019-11-15 22:26:58,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:26:58,766 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:58,767 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:58,767 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:58,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:58,767 INFO L82 PathProgramCache]: Analyzing trace with hash -999998155, now seen corresponding path program 1 times [2019-11-15 22:26:58,768 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:58,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105760951] [2019-11-15 22:26:58,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:58,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:58,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:58,853 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:26:58,853 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105760951] [2019-11-15 22:26:58,853 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:58,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:58,854 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376773807] [2019-11-15 22:26:58,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:58,854 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:58,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:58,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:58,855 INFO L87 Difference]: Start difference. First operand 260 states and 393 transitions. Second operand 4 states. [2019-11-15 22:26:59,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:59,170 INFO L93 Difference]: Finished difference Result 523 states and 793 transitions. [2019-11-15 22:26:59,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:59,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 22:26:59,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:59,173 INFO L225 Difference]: With dead ends: 523 [2019-11-15 22:26:59,173 INFO L226 Difference]: Without dead ends: 282 [2019-11-15 22:26:59,174 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:59,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-15 22:26:59,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-11-15 22:26:59,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-15 22:26:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 392 transitions. [2019-11-15 22:26:59,187 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 392 transitions. Word has length 98 [2019-11-15 22:26:59,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:59,188 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 392 transitions. [2019-11-15 22:26:59,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:59,188 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 392 transitions. [2019-11-15 22:26:59,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 22:26:59,190 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:59,190 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:59,191 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:59,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:59,191 INFO L82 PathProgramCache]: Analyzing trace with hash -154140935, now seen corresponding path program 1 times [2019-11-15 22:26:59,191 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:59,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044807246] [2019-11-15 22:26:59,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:59,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:59,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:26:59,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044807246] [2019-11-15 22:26:59,263 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:59,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:59,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071839918] [2019-11-15 22:26:59,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:59,264 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:59,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:59,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:59,264 INFO L87 Difference]: Start difference. First operand 260 states and 392 transitions. Second operand 4 states. [2019-11-15 22:26:59,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:59,814 INFO L93 Difference]: Finished difference Result 559 states and 844 transitions. [2019-11-15 22:26:59,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:59,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-15 22:26:59,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:59,817 INFO L225 Difference]: With dead ends: 559 [2019-11-15 22:26:59,817 INFO L226 Difference]: Without dead ends: 318 [2019-11-15 22:26:59,818 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:59,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-15 22:26:59,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 260. [2019-11-15 22:26:59,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-15 22:26:59,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 391 transitions. [2019-11-15 22:26:59,828 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 391 transitions. Word has length 99 [2019-11-15 22:26:59,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:59,828 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 391 transitions. [2019-11-15 22:26:59,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:59,829 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 391 transitions. [2019-11-15 22:26:59,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 22:26:59,833 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:59,834 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:59,834 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:59,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:59,835 INFO L82 PathProgramCache]: Analyzing trace with hash 279588151, now seen corresponding path program 1 times [2019-11-15 22:26:59,835 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:59,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927638300] [2019-11-15 22:26:59,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:59,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:59,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:59,908 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:26:59,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927638300] [2019-11-15 22:26:59,908 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:59,909 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:59,909 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589205645] [2019-11-15 22:26:59,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:59,910 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:59,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:59,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:59,910 INFO L87 Difference]: Start difference. First operand 260 states and 391 transitions. Second operand 4 states. [2019-11-15 22:27:00,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:00,416 INFO L93 Difference]: Finished difference Result 523 states and 789 transitions. [2019-11-15 22:27:00,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:00,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-15 22:27:00,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:00,419 INFO L225 Difference]: With dead ends: 523 [2019-11-15 22:27:00,419 INFO L226 Difference]: Without dead ends: 282 [2019-11-15 22:27:00,420 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:00,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-15 22:27:00,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-11-15 22:27:00,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-15 22:27:00,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 390 transitions. [2019-11-15 22:27:00,428 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 390 transitions. Word has length 99 [2019-11-15 22:27:00,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:00,429 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 390 transitions. [2019-11-15 22:27:00,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:00,429 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 390 transitions. [2019-11-15 22:27:00,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 22:27:00,430 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:00,431 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:00,431 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:00,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:00,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1284296014, now seen corresponding path program 1 times [2019-11-15 22:27:00,432 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:00,432 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299226223] [2019-11-15 22:27:00,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:00,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:00,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:27:00,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299226223] [2019-11-15 22:27:00,506 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:00,506 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:00,506 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421152142] [2019-11-15 22:27:00,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:00,507 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:00,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:00,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:00,507 INFO L87 Difference]: Start difference. First operand 260 states and 390 transitions. Second operand 4 states. [2019-11-15 22:27:00,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:00,975 INFO L93 Difference]: Finished difference Result 549 states and 828 transitions. [2019-11-15 22:27:00,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:00,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-15 22:27:00,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:00,978 INFO L225 Difference]: With dead ends: 549 [2019-11-15 22:27:00,978 INFO L226 Difference]: Without dead ends: 308 [2019-11-15 22:27:00,979 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:00,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-11-15 22:27:00,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 260. [2019-11-15 22:27:00,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-15 22:27:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 389 transitions. [2019-11-15 22:27:00,988 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 389 transitions. Word has length 100 [2019-11-15 22:27:00,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:00,989 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 389 transitions. [2019-11-15 22:27:00,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:00,989 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 389 transitions. [2019-11-15 22:27:00,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 22:27:00,990 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:00,991 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:00,991 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:00,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:00,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1844995792, now seen corresponding path program 1 times [2019-11-15 22:27:00,992 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:00,992 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283980470] [2019-11-15 22:27:00,992 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:00,992 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:00,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:01,069 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:27:01,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283980470] [2019-11-15 22:27:01,070 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:01,070 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:01,070 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322887563] [2019-11-15 22:27:01,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:01,072 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:01,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:01,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:01,073 INFO L87 Difference]: Start difference. First operand 260 states and 389 transitions. Second operand 4 states. [2019-11-15 22:27:01,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:01,454 INFO L93 Difference]: Finished difference Result 513 states and 773 transitions. [2019-11-15 22:27:01,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:01,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-15 22:27:01,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:01,457 INFO L225 Difference]: With dead ends: 513 [2019-11-15 22:27:01,457 INFO L226 Difference]: Without dead ends: 272 [2019-11-15 22:27:01,458 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:01,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-15 22:27:01,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 260. [2019-11-15 22:27:01,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-15 22:27:01,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 388 transitions. [2019-11-15 22:27:01,467 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 388 transitions. Word has length 100 [2019-11-15 22:27:01,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:01,468 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 388 transitions. [2019-11-15 22:27:01,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:01,468 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 388 transitions. [2019-11-15 22:27:01,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-15 22:27:01,469 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:01,471 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:01,471 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:01,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:01,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1320897196, now seen corresponding path program 1 times [2019-11-15 22:27:01,472 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:01,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344846296] [2019-11-15 22:27:01,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:01,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:01,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:01,543 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:27:01,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344846296] [2019-11-15 22:27:01,544 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:01,544 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:01,544 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199029052] [2019-11-15 22:27:01,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:01,545 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:01,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:01,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:01,545 INFO L87 Difference]: Start difference. First operand 260 states and 388 transitions. Second operand 4 states. [2019-11-15 22:27:01,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:01,995 INFO L93 Difference]: Finished difference Result 549 states and 824 transitions. [2019-11-15 22:27:01,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:01,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-15 22:27:01,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:01,998 INFO L225 Difference]: With dead ends: 549 [2019-11-15 22:27:01,999 INFO L226 Difference]: Without dead ends: 308 [2019-11-15 22:27:01,999 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:02,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-11-15 22:27:02,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 260. [2019-11-15 22:27:02,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-15 22:27:02,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 387 transitions. [2019-11-15 22:27:02,008 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 387 transitions. Word has length 104 [2019-11-15 22:27:02,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:02,008 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 387 transitions. [2019-11-15 22:27:02,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:02,009 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 387 transitions. [2019-11-15 22:27:02,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-15 22:27:02,010 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:02,010 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:02,010 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:02,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:02,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1738293802, now seen corresponding path program 1 times [2019-11-15 22:27:02,011 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:02,011 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531134999] [2019-11-15 22:27:02,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:02,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:02,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:02,077 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 22:27:02,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531134999] [2019-11-15 22:27:02,078 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:02,078 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:27:02,079 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584857310] [2019-11-15 22:27:02,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:27:02,079 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:02,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:27:02,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:02,080 INFO L87 Difference]: Start difference. First operand 260 states and 387 transitions. Second operand 3 states. [2019-11-15 22:27:02,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:02,191 INFO L93 Difference]: Finished difference Result 740 states and 1116 transitions. [2019-11-15 22:27:02,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:27:02,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-15 22:27:02,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:02,195 INFO L225 Difference]: With dead ends: 740 [2019-11-15 22:27:02,195 INFO L226 Difference]: Without dead ends: 499 [2019-11-15 22:27:02,195 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:02,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-11-15 22:27:02,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2019-11-15 22:27:02,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-11-15 22:27:02,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 738 transitions. [2019-11-15 22:27:02,210 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 738 transitions. Word has length 104 [2019-11-15 22:27:02,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:02,211 INFO L462 AbstractCegarLoop]: Abstraction has 499 states and 738 transitions. [2019-11-15 22:27:02,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:27:02,211 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 738 transitions. [2019-11-15 22:27:02,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-15 22:27:02,213 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:02,213 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:02,214 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:02,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:02,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1062546720, now seen corresponding path program 1 times [2019-11-15 22:27:02,214 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:02,215 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566695385] [2019-11-15 22:27:02,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:02,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:02,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:02,281 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 22:27:02,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566695385] [2019-11-15 22:27:02,282 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:02,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:27:02,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327863035] [2019-11-15 22:27:02,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:27:02,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:02,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:27:02,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:02,284 INFO L87 Difference]: Start difference. First operand 499 states and 738 transitions. Second operand 3 states. [2019-11-15 22:27:02,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:02,393 INFO L93 Difference]: Finished difference Result 1218 states and 1818 transitions. [2019-11-15 22:27:02,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:27:02,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-15 22:27:02,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:02,398 INFO L225 Difference]: With dead ends: 1218 [2019-11-15 22:27:02,399 INFO L226 Difference]: Without dead ends: 738 [2019-11-15 22:27:02,399 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:02,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-11-15 22:27:02,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2019-11-15 22:27:02,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-11-15 22:27:02,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1090 transitions. [2019-11-15 22:27:02,424 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1090 transitions. Word has length 106 [2019-11-15 22:27:02,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:02,424 INFO L462 AbstractCegarLoop]: Abstraction has 738 states and 1090 transitions. [2019-11-15 22:27:02,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:27:02,424 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1090 transitions. [2019-11-15 22:27:02,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-15 22:27:02,427 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:02,427 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:02,428 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:02,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:02,428 INFO L82 PathProgramCache]: Analyzing trace with hash 915253032, now seen corresponding path program 1 times [2019-11-15 22:27:02,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:02,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993107036] [2019-11-15 22:27:02,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:02,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:02,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:02,510 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 22:27:02,510 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993107036] [2019-11-15 22:27:02,510 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:02,510 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:02,511 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116344078] [2019-11-15 22:27:02,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:02,512 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:02,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:02,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:02,512 INFO L87 Difference]: Start difference. First operand 738 states and 1090 transitions. Second operand 4 states. [2019-11-15 22:27:03,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:03,083 INFO L93 Difference]: Finished difference Result 1646 states and 2452 transitions. [2019-11-15 22:27:03,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:03,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-11-15 22:27:03,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:03,090 INFO L225 Difference]: With dead ends: 1646 [2019-11-15 22:27:03,090 INFO L226 Difference]: Without dead ends: 927 [2019-11-15 22:27:03,091 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:03,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-11-15 22:27:03,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 822. [2019-11-15 22:27:03,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-11-15 22:27:03,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1237 transitions. [2019-11-15 22:27:03,118 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1237 transitions. Word has length 135 [2019-11-15 22:27:03,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:03,119 INFO L462 AbstractCegarLoop]: Abstraction has 822 states and 1237 transitions. [2019-11-15 22:27:03,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:03,119 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1237 transitions. [2019-11-15 22:27:03,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-15 22:27:03,122 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:03,122 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:03,122 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:03,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:03,123 INFO L82 PathProgramCache]: Analyzing trace with hash 518604743, now seen corresponding path program 1 times [2019-11-15 22:27:03,123 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:03,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795600539] [2019-11-15 22:27:03,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:03,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:03,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:03,207 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 22:27:03,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795600539] [2019-11-15 22:27:03,208 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:03,208 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:03,208 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958364858] [2019-11-15 22:27:03,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:03,209 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:03,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:03,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:03,210 INFO L87 Difference]: Start difference. First operand 822 states and 1237 transitions. Second operand 4 states. [2019-11-15 22:27:03,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:03,841 INFO L93 Difference]: Finished difference Result 1730 states and 2596 transitions. [2019-11-15 22:27:03,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:03,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-15 22:27:03,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:03,847 INFO L225 Difference]: With dead ends: 1730 [2019-11-15 22:27:03,848 INFO L226 Difference]: Without dead ends: 927 [2019-11-15 22:27:03,849 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:03,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-11-15 22:27:03,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 822. [2019-11-15 22:27:03,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-11-15 22:27:03,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1234 transitions. [2019-11-15 22:27:03,877 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1234 transitions. Word has length 148 [2019-11-15 22:27:03,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:03,877 INFO L462 AbstractCegarLoop]: Abstraction has 822 states and 1234 transitions. [2019-11-15 22:27:03,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:03,878 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1234 transitions. [2019-11-15 22:27:03,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-15 22:27:03,880 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:03,881 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:03,881 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:03,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:03,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1697825810, now seen corresponding path program 1 times [2019-11-15 22:27:03,882 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:03,882 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908899847] [2019-11-15 22:27:03,882 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:03,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:03,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:04,022 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 22:27:04,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908899847] [2019-11-15 22:27:04,027 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:04,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:04,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297644646] [2019-11-15 22:27:04,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:04,029 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:04,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:04,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:04,030 INFO L87 Difference]: Start difference. First operand 822 states and 1234 transitions. Second operand 4 states. [2019-11-15 22:27:04,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:04,453 INFO L93 Difference]: Finished difference Result 1724 states and 2584 transitions. [2019-11-15 22:27:04,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:04,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-15 22:27:04,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:04,460 INFO L225 Difference]: With dead ends: 1724 [2019-11-15 22:27:04,460 INFO L226 Difference]: Without dead ends: 921 [2019-11-15 22:27:04,461 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:04,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-11-15 22:27:04,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 822. [2019-11-15 22:27:04,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-11-15 22:27:04,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1231 transitions. [2019-11-15 22:27:04,487 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1231 transitions. Word has length 149 [2019-11-15 22:27:04,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:04,489 INFO L462 AbstractCegarLoop]: Abstraction has 822 states and 1231 transitions. [2019-11-15 22:27:04,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:04,490 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1231 transitions. [2019-11-15 22:27:04,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-15 22:27:04,492 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:04,493 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:04,493 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:04,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:04,494 INFO L82 PathProgramCache]: Analyzing trace with hash -593921198, now seen corresponding path program 1 times [2019-11-15 22:27:04,494 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:04,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123901559] [2019-11-15 22:27:04,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:04,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:04,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:04,577 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 22:27:04,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123901559] [2019-11-15 22:27:04,578 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:04,578 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:04,578 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506688497] [2019-11-15 22:27:04,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:04,580 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:04,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:04,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:04,580 INFO L87 Difference]: Start difference. First operand 822 states and 1231 transitions. Second operand 4 states. [2019-11-15 22:27:04,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:05,000 INFO L93 Difference]: Finished difference Result 1721 states and 2575 transitions. [2019-11-15 22:27:05,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:05,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-15 22:27:05,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:05,008 INFO L225 Difference]: With dead ends: 1721 [2019-11-15 22:27:05,008 INFO L226 Difference]: Without dead ends: 918 [2019-11-15 22:27:05,010 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:05,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-11-15 22:27:05,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 822. [2019-11-15 22:27:05,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-11-15 22:27:05,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1228 transitions. [2019-11-15 22:27:05,044 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1228 transitions. Word has length 149 [2019-11-15 22:27:05,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:05,045 INFO L462 AbstractCegarLoop]: Abstraction has 822 states and 1228 transitions. [2019-11-15 22:27:05,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:05,045 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1228 transitions. [2019-11-15 22:27:05,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-15 22:27:05,048 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:05,048 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:05,048 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:05,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:05,049 INFO L82 PathProgramCache]: Analyzing trace with hash -865742333, now seen corresponding path program 1 times [2019-11-15 22:27:05,049 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:05,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433153503] [2019-11-15 22:27:05,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:05,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:05,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:05,134 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 22:27:05,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433153503] [2019-11-15 22:27:05,135 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:05,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:05,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105887366] [2019-11-15 22:27:05,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:05,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:05,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:05,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:05,137 INFO L87 Difference]: Start difference. First operand 822 states and 1228 transitions. Second operand 4 states. [2019-11-15 22:27:05,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:05,631 INFO L93 Difference]: Finished difference Result 1721 states and 2569 transitions. [2019-11-15 22:27:05,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:05,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-15 22:27:05,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:05,637 INFO L225 Difference]: With dead ends: 1721 [2019-11-15 22:27:05,637 INFO L226 Difference]: Without dead ends: 918 [2019-11-15 22:27:05,638 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:05,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-11-15 22:27:05,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 822. [2019-11-15 22:27:05,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-11-15 22:27:05,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1225 transitions. [2019-11-15 22:27:05,664 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1225 transitions. Word has length 150 [2019-11-15 22:27:05,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:05,664 INFO L462 AbstractCegarLoop]: Abstraction has 822 states and 1225 transitions. [2019-11-15 22:27:05,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:05,665 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1225 transitions. [2019-11-15 22:27:05,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-15 22:27:05,667 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:05,668 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:05,668 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:05,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:05,668 INFO L82 PathProgramCache]: Analyzing trace with hash -406386482, now seen corresponding path program 1 times [2019-11-15 22:27:05,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:05,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850775522] [2019-11-15 22:27:05,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:05,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:05,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:05,749 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 22:27:05,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850775522] [2019-11-15 22:27:05,749 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:05,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:05,750 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750903487] [2019-11-15 22:27:05,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:05,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:05,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:05,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:05,751 INFO L87 Difference]: Start difference. First operand 822 states and 1225 transitions. Second operand 4 states. [2019-11-15 22:27:06,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:06,142 INFO L93 Difference]: Finished difference Result 1721 states and 2563 transitions. [2019-11-15 22:27:06,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:06,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-11-15 22:27:06,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:06,147 INFO L225 Difference]: With dead ends: 1721 [2019-11-15 22:27:06,148 INFO L226 Difference]: Without dead ends: 918 [2019-11-15 22:27:06,148 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:06,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-11-15 22:27:06,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 822. [2019-11-15 22:27:06,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-11-15 22:27:06,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1222 transitions. [2019-11-15 22:27:06,174 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1222 transitions. Word has length 151 [2019-11-15 22:27:06,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:06,175 INFO L462 AbstractCegarLoop]: Abstraction has 822 states and 1222 transitions. [2019-11-15 22:27:06,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:06,175 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1222 transitions. [2019-11-15 22:27:06,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-15 22:27:06,178 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:06,178 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:06,178 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:06,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:06,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1501680830, now seen corresponding path program 1 times [2019-11-15 22:27:06,179 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:06,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016280914] [2019-11-15 22:27:06,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:06,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:06,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:06,265 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 22:27:06,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016280914] [2019-11-15 22:27:06,266 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:06,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:06,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939399149] [2019-11-15 22:27:06,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:06,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:06,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:06,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:06,268 INFO L87 Difference]: Start difference. First operand 822 states and 1222 transitions. Second operand 4 states. [2019-11-15 22:27:06,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:06,830 INFO L93 Difference]: Finished difference Result 1721 states and 2557 transitions. [2019-11-15 22:27:06,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:06,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-15 22:27:06,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:06,837 INFO L225 Difference]: With dead ends: 1721 [2019-11-15 22:27:06,837 INFO L226 Difference]: Without dead ends: 918 [2019-11-15 22:27:06,838 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:06,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-11-15 22:27:06,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 822. [2019-11-15 22:27:06,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-11-15 22:27:06,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1219 transitions. [2019-11-15 22:27:06,863 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1219 transitions. Word has length 152 [2019-11-15 22:27:06,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:06,864 INFO L462 AbstractCegarLoop]: Abstraction has 822 states and 1219 transitions. [2019-11-15 22:27:06,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:06,864 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1219 transitions. [2019-11-15 22:27:06,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-15 22:27:06,867 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:06,867 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:06,868 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:06,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:06,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1075163177, now seen corresponding path program 1 times [2019-11-15 22:27:06,868 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:06,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684327114] [2019-11-15 22:27:06,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:06,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:06,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:06,957 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 22:27:06,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684327114] [2019-11-15 22:27:06,957 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:06,958 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:06,958 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358207286] [2019-11-15 22:27:06,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:06,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:06,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:06,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:06,959 INFO L87 Difference]: Start difference. First operand 822 states and 1219 transitions. Second operand 4 states. [2019-11-15 22:27:07,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:07,437 INFO L93 Difference]: Finished difference Result 1691 states and 2515 transitions. [2019-11-15 22:27:07,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:07,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-11-15 22:27:07,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:07,441 INFO L225 Difference]: With dead ends: 1691 [2019-11-15 22:27:07,441 INFO L226 Difference]: Without dead ends: 888 [2019-11-15 22:27:07,442 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:07,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2019-11-15 22:27:07,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 822. [2019-11-15 22:27:07,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-11-15 22:27:07,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1216 transitions. [2019-11-15 22:27:07,466 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1216 transitions. Word has length 153 [2019-11-15 22:27:07,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:07,467 INFO L462 AbstractCegarLoop]: Abstraction has 822 states and 1216 transitions. [2019-11-15 22:27:07,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:07,467 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1216 transitions. [2019-11-15 22:27:07,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-15 22:27:07,470 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:07,470 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:07,470 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:07,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:07,471 INFO L82 PathProgramCache]: Analyzing trace with hash 496677551, now seen corresponding path program 1 times [2019-11-15 22:27:07,471 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:07,471 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861903523] [2019-11-15 22:27:07,471 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:07,471 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:07,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:07,574 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 22:27:07,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861903523] [2019-11-15 22:27:07,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:07,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:07,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370763909] [2019-11-15 22:27:07,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:07,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:07,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:07,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:07,577 INFO L87 Difference]: Start difference. First operand 822 states and 1216 transitions. Second operand 4 states. [2019-11-15 22:27:07,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:07,982 INFO L93 Difference]: Finished difference Result 1691 states and 2509 transitions. [2019-11-15 22:27:07,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:07,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-15 22:27:07,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:07,990 INFO L225 Difference]: With dead ends: 1691 [2019-11-15 22:27:07,990 INFO L226 Difference]: Without dead ends: 888 [2019-11-15 22:27:07,992 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:07,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2019-11-15 22:27:08,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 822. [2019-11-15 22:27:08,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-11-15 22:27:08,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1213 transitions. [2019-11-15 22:27:08,023 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1213 transitions. Word has length 157 [2019-11-15 22:27:08,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:08,024 INFO L462 AbstractCegarLoop]: Abstraction has 822 states and 1213 transitions. [2019-11-15 22:27:08,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:08,024 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1213 transitions. [2019-11-15 22:27:08,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-15 22:27:08,028 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:08,028 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:08,028 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:08,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:08,029 INFO L82 PathProgramCache]: Analyzing trace with hash 225955140, now seen corresponding path program 1 times [2019-11-15 22:27:08,029 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:08,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634104880] [2019-11-15 22:27:08,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:08,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:08,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:08,164 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 22:27:08,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634104880] [2019-11-15 22:27:08,164 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:08,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:08,165 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167212720] [2019-11-15 22:27:08,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:08,165 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:08,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:08,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:08,166 INFO L87 Difference]: Start difference. First operand 822 states and 1213 transitions. Second operand 4 states. [2019-11-15 22:27:08,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:08,547 INFO L93 Difference]: Finished difference Result 1676 states and 2482 transitions. [2019-11-15 22:27:08,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:08,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-15 22:27:08,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:08,554 INFO L225 Difference]: With dead ends: 1676 [2019-11-15 22:27:08,554 INFO L226 Difference]: Without dead ends: 873 [2019-11-15 22:27:08,555 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:08,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2019-11-15 22:27:08,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 822. [2019-11-15 22:27:08,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-11-15 22:27:08,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1210 transitions. [2019-11-15 22:27:08,578 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1210 transitions. Word has length 158 [2019-11-15 22:27:08,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:08,578 INFO L462 AbstractCegarLoop]: Abstraction has 822 states and 1210 transitions. [2019-11-15 22:27:08,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:08,579 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1210 transitions. [2019-11-15 22:27:08,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-15 22:27:08,581 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:08,582 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:08,582 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:08,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:08,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1486337636, now seen corresponding path program 1 times [2019-11-15 22:27:08,583 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:08,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535679822] [2019-11-15 22:27:08,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:08,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:08,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:08,678 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 22:27:08,679 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535679822] [2019-11-15 22:27:08,679 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:08,679 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:08,679 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161907653] [2019-11-15 22:27:08,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:08,680 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:08,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:08,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:08,681 INFO L87 Difference]: Start difference. First operand 822 states and 1210 transitions. Second operand 4 states. [2019-11-15 22:27:09,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:09,074 INFO L93 Difference]: Finished difference Result 1826 states and 2710 transitions. [2019-11-15 22:27:09,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:09,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-11-15 22:27:09,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:09,079 INFO L225 Difference]: With dead ends: 1826 [2019-11-15 22:27:09,080 INFO L226 Difference]: Without dead ends: 1023 [2019-11-15 22:27:09,080 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:09,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-11-15 22:27:09,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 912. [2019-11-15 22:27:09,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2019-11-15 22:27:09,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1369 transitions. [2019-11-15 22:27:09,106 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1369 transitions. Word has length 160 [2019-11-15 22:27:09,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:09,107 INFO L462 AbstractCegarLoop]: Abstraction has 912 states and 1369 transitions. [2019-11-15 22:27:09,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:09,107 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1369 transitions. [2019-11-15 22:27:09,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-15 22:27:09,109 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:09,109 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:09,110 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:09,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:09,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1561643199, now seen corresponding path program 1 times [2019-11-15 22:27:09,110 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:09,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352175952] [2019-11-15 22:27:09,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:09,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:09,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:09,200 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 22:27:09,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352175952] [2019-11-15 22:27:09,200 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:09,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:27:09,201 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838037966] [2019-11-15 22:27:09,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:27:09,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:09,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:27:09,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:09,202 INFO L87 Difference]: Start difference. First operand 912 states and 1369 transitions. Second operand 3 states. [2019-11-15 22:27:09,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:09,315 INFO L93 Difference]: Finished difference Result 2102 states and 3173 transitions. [2019-11-15 22:27:09,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:27:09,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-11-15 22:27:09,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:09,323 INFO L225 Difference]: With dead ends: 2102 [2019-11-15 22:27:09,323 INFO L226 Difference]: Without dead ends: 1209 [2019-11-15 22:27:09,325 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:09,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2019-11-15 22:27:09,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1209. [2019-11-15 22:27:09,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1209 states. [2019-11-15 22:27:09,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1816 transitions. [2019-11-15 22:27:09,357 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1816 transitions. Word has length 166 [2019-11-15 22:27:09,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:09,358 INFO L462 AbstractCegarLoop]: Abstraction has 1209 states and 1816 transitions. [2019-11-15 22:27:09,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:27:09,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1816 transitions. [2019-11-15 22:27:09,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-15 22:27:09,363 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:09,363 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:09,363 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:09,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:09,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1154466172, now seen corresponding path program 1 times [2019-11-15 22:27:09,364 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:09,364 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713758140] [2019-11-15 22:27:09,364 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:09,364 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:09,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:09,465 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-15 22:27:09,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713758140] [2019-11-15 22:27:09,466 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:09,466 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:09,466 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241425866] [2019-11-15 22:27:09,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:09,467 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:09,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:09,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:09,467 INFO L87 Difference]: Start difference. First operand 1209 states and 1816 transitions. Second operand 4 states. [2019-11-15 22:27:09,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:09,876 INFO L93 Difference]: Finished difference Result 2467 states and 3714 transitions. [2019-11-15 22:27:09,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:09,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-11-15 22:27:09,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:09,882 INFO L225 Difference]: With dead ends: 2467 [2019-11-15 22:27:09,882 INFO L226 Difference]: Without dead ends: 1277 [2019-11-15 22:27:09,883 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:09,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2019-11-15 22:27:09,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1209. [2019-11-15 22:27:09,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1209 states. [2019-11-15 22:27:09,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1812 transitions. [2019-11-15 22:27:09,907 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1812 transitions. Word has length 189 [2019-11-15 22:27:09,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:09,907 INFO L462 AbstractCegarLoop]: Abstraction has 1209 states and 1812 transitions. [2019-11-15 22:27:09,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:09,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1812 transitions. [2019-11-15 22:27:09,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-15 22:27:09,909 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:09,910 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:09,910 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:09,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:09,910 INFO L82 PathProgramCache]: Analyzing trace with hash -774173575, now seen corresponding path program 1 times [2019-11-15 22:27:09,910 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:09,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656780886] [2019-11-15 22:27:09,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:09,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:09,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:10,011 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-15 22:27:10,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656780886] [2019-11-15 22:27:10,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:10,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:10,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315582924] [2019-11-15 22:27:10,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:10,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:10,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:10,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:10,013 INFO L87 Difference]: Start difference. First operand 1209 states and 1812 transitions. Second operand 4 states. [2019-11-15 22:27:10,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:10,390 INFO L93 Difference]: Finished difference Result 2451 states and 3682 transitions. [2019-11-15 22:27:10,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:10,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-11-15 22:27:10,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:10,396 INFO L225 Difference]: With dead ends: 2451 [2019-11-15 22:27:10,397 INFO L226 Difference]: Without dead ends: 1261 [2019-11-15 22:27:10,398 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:10,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2019-11-15 22:27:10,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1209. [2019-11-15 22:27:10,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1209 states. [2019-11-15 22:27:10,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1808 transitions. [2019-11-15 22:27:10,429 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1808 transitions. Word has length 190 [2019-11-15 22:27:10,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:10,430 INFO L462 AbstractCegarLoop]: Abstraction has 1209 states and 1808 transitions. [2019-11-15 22:27:10,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:10,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1808 transitions. [2019-11-15 22:27:10,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-15 22:27:10,432 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:10,433 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:10,433 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:10,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:10,434 INFO L82 PathProgramCache]: Analyzing trace with hash 2142683072, now seen corresponding path program 1 times [2019-11-15 22:27:10,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:10,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809776070] [2019-11-15 22:27:10,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:10,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:10,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:10,530 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 22:27:10,530 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809776070] [2019-11-15 22:27:10,530 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:10,530 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:27:10,531 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650766430] [2019-11-15 22:27:10,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:27:10,531 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:10,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:27:10,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:10,532 INFO L87 Difference]: Start difference. First operand 1209 states and 1808 transitions. Second operand 3 states. [2019-11-15 22:27:10,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:10,616 INFO L93 Difference]: Finished difference Result 2696 states and 4049 transitions. [2019-11-15 22:27:10,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:27:10,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-11-15 22:27:10,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:10,626 INFO L225 Difference]: With dead ends: 2696 [2019-11-15 22:27:10,626 INFO L226 Difference]: Without dead ends: 1506 [2019-11-15 22:27:10,627 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:10,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2019-11-15 22:27:10,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2019-11-15 22:27:10,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1506 states. [2019-11-15 22:27:10,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2254 transitions. [2019-11-15 22:27:10,664 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2254 transitions. Word has length 198 [2019-11-15 22:27:10,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:10,665 INFO L462 AbstractCegarLoop]: Abstraction has 1506 states and 2254 transitions. [2019-11-15 22:27:10,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:27:10,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2254 transitions. [2019-11-15 22:27:10,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-15 22:27:10,667 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:10,667 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:10,667 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:10,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:10,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1472006410, now seen corresponding path program 1 times [2019-11-15 22:27:10,668 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:10,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209157026] [2019-11-15 22:27:10,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:10,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:10,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:10,818 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 22:27:10,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209157026] [2019-11-15 22:27:10,819 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:10,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:27:10,820 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680862634] [2019-11-15 22:27:10,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:27:10,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:10,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:27:10,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:10,821 INFO L87 Difference]: Start difference. First operand 1506 states and 2254 transitions. Second operand 3 states. [2019-11-15 22:27:10,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:10,934 INFO L93 Difference]: Finished difference Result 3290 states and 4941 transitions. [2019-11-15 22:27:10,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:27:10,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-11-15 22:27:10,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:10,940 INFO L225 Difference]: With dead ends: 3290 [2019-11-15 22:27:10,941 INFO L226 Difference]: Without dead ends: 1803 [2019-11-15 22:27:10,943 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:10,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2019-11-15 22:27:10,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1803. [2019-11-15 22:27:10,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2019-11-15 22:27:10,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2701 transitions. [2019-11-15 22:27:10,995 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2701 transitions. Word has length 200 [2019-11-15 22:27:10,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:10,995 INFO L462 AbstractCegarLoop]: Abstraction has 1803 states and 2701 transitions. [2019-11-15 22:27:10,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:27:10,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2701 transitions. [2019-11-15 22:27:11,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-15 22:27:11,000 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:11,000 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:11,000 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:11,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:11,001 INFO L82 PathProgramCache]: Analyzing trace with hash -976858043, now seen corresponding path program 1 times [2019-11-15 22:27:11,001 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:11,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825714439] [2019-11-15 22:27:11,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:11,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:11,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:11,118 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-11-15 22:27:11,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825714439] [2019-11-15 22:27:11,119 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:11,119 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:27:11,119 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994385809] [2019-11-15 22:27:11,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:27:11,120 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:11,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:27:11,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:11,121 INFO L87 Difference]: Start difference. First operand 1803 states and 2701 transitions. Second operand 3 states. [2019-11-15 22:27:11,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:11,206 INFO L93 Difference]: Finished difference Result 3884 states and 5835 transitions. [2019-11-15 22:27:11,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:27:11,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-11-15 22:27:11,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:11,215 INFO L225 Difference]: With dead ends: 3884 [2019-11-15 22:27:11,216 INFO L226 Difference]: Without dead ends: 2100 [2019-11-15 22:27:11,218 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:11,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-15 22:27:11,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2100. [2019-11-15 22:27:11,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-11-15 22:27:11,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 3149 transitions. [2019-11-15 22:27:11,273 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 3149 transitions. Word has length 233 [2019-11-15 22:27:11,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:11,274 INFO L462 AbstractCegarLoop]: Abstraction has 2100 states and 3149 transitions. [2019-11-15 22:27:11,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:27:11,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 3149 transitions. [2019-11-15 22:27:11,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-11-15 22:27:11,278 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:11,278 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:11,279 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:11,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:11,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1698622670, now seen corresponding path program 1 times [2019-11-15 22:27:11,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:11,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368863665] [2019-11-15 22:27:11,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:11,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:11,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:11,422 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-11-15 22:27:11,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368863665] [2019-11-15 22:27:11,423 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:11,423 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:27:11,423 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631460807] [2019-11-15 22:27:11,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:27:11,424 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:11,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:27:11,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:11,425 INFO L87 Difference]: Start difference. First operand 2100 states and 3149 transitions. Second operand 3 states. [2019-11-15 22:27:11,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:11,576 INFO L93 Difference]: Finished difference Result 4472 states and 6722 transitions. [2019-11-15 22:27:11,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:27:11,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2019-11-15 22:27:11,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:11,583 INFO L225 Difference]: With dead ends: 4472 [2019-11-15 22:27:11,583 INFO L226 Difference]: Without dead ends: 2391 [2019-11-15 22:27:11,586 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:11,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2019-11-15 22:27:11,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2391. [2019-11-15 22:27:11,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2391 states. [2019-11-15 22:27:11,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2391 states to 2391 states and 3581 transitions. [2019-11-15 22:27:11,642 INFO L78 Accepts]: Start accepts. Automaton has 2391 states and 3581 transitions. Word has length 268 [2019-11-15 22:27:11,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:11,642 INFO L462 AbstractCegarLoop]: Abstraction has 2391 states and 3581 transitions. [2019-11-15 22:27:11,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:27:11,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3581 transitions. [2019-11-15 22:27:11,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-15 22:27:11,646 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:11,647 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:11,647 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:11,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:11,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1670879313, now seen corresponding path program 1 times [2019-11-15 22:27:11,647 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:11,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669577936] [2019-11-15 22:27:11,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:11,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:11,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:11,800 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2019-11-15 22:27:11,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669577936] [2019-11-15 22:27:11,801 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:11,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:27:11,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135755565] [2019-11-15 22:27:11,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:27:11,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:11,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:27:11,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:11,802 INFO L87 Difference]: Start difference. First operand 2391 states and 3581 transitions. Second operand 3 states. [2019-11-15 22:27:11,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:11,900 INFO L93 Difference]: Finished difference Result 5060 states and 7595 transitions. [2019-11-15 22:27:11,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:27:11,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-11-15 22:27:11,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:11,906 INFO L225 Difference]: With dead ends: 5060 [2019-11-15 22:27:11,906 INFO L226 Difference]: Without dead ends: 2688 [2019-11-15 22:27:11,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 22:27:11,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2688 states. [2019-11-15 22:27:11,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2688 to 2688. [2019-11-15 22:27:11,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2688 states. [2019-11-15 22:27:11,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2688 states to 2688 states and 4031 transitions. [2019-11-15 22:27:11,978 INFO L78 Accepts]: Start accepts. Automaton has 2688 states and 4031 transitions. Word has length 307 [2019-11-15 22:27:11,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:11,979 INFO L462 AbstractCegarLoop]: Abstraction has 2688 states and 4031 transitions. [2019-11-15 22:27:11,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:27:11,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2688 states and 4031 transitions. [2019-11-15 22:27:11,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-11-15 22:27:11,985 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:11,986 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:11,986 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:11,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:11,986 INFO L82 PathProgramCache]: Analyzing trace with hash -249132093, now seen corresponding path program 1 times [2019-11-15 22:27:11,987 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:11,987 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103411689] [2019-11-15 22:27:11,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:11,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:11,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:12,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2019-11-15 22:27:12,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103411689] [2019-11-15 22:27:12,285 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:12,285 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:27:12,285 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374130339] [2019-11-15 22:27:12,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:27:12,286 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:12,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:27:12,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:12,287 INFO L87 Difference]: Start difference. First operand 2688 states and 4031 transitions. Second operand 3 states. [2019-11-15 22:27:12,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:12,433 INFO L93 Difference]: Finished difference Result 5654 states and 8495 transitions. [2019-11-15 22:27:12,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:27:12,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2019-11-15 22:27:12,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:12,441 INFO L225 Difference]: With dead ends: 5654 [2019-11-15 22:27:12,442 INFO L226 Difference]: Without dead ends: 2985 [2019-11-15 22:27:12,445 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:12,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2019-11-15 22:27:12,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2985. [2019-11-15 22:27:12,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2985 states. [2019-11-15 22:27:12,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2985 states to 2985 states and 4482 transitions. [2019-11-15 22:27:12,525 INFO L78 Accepts]: Start accepts. Automaton has 2985 states and 4482 transitions. Word has length 348 [2019-11-15 22:27:12,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:12,526 INFO L462 AbstractCegarLoop]: Abstraction has 2985 states and 4482 transitions. [2019-11-15 22:27:12,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:27:12,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2985 states and 4482 transitions. [2019-11-15 22:27:12,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-11-15 22:27:12,533 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:12,533 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:12,534 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:12,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:12,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1147799121, now seen corresponding path program 1 times [2019-11-15 22:27:12,535 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:12,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850448246] [2019-11-15 22:27:12,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:12,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:12,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:12,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2019-11-15 22:27:12,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850448246] [2019-11-15 22:27:12,766 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:12,767 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:27:12,767 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076757116] [2019-11-15 22:27:12,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:27:12,768 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:12,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:27:12,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:12,768 INFO L87 Difference]: Start difference. First operand 2985 states and 4482 transitions. Second operand 3 states. [2019-11-15 22:27:12,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:12,900 INFO L93 Difference]: Finished difference Result 6243 states and 9390 transitions. [2019-11-15 22:27:12,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:27:12,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 391 [2019-11-15 22:27:12,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:12,908 INFO L225 Difference]: With dead ends: 6243 [2019-11-15 22:27:12,908 INFO L226 Difference]: Without dead ends: 3277 [2019-11-15 22:27:12,912 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:12,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3277 states. [2019-11-15 22:27:12,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3277 to 3277. [2019-11-15 22:27:12,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3277 states. [2019-11-15 22:27:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3277 states to 3277 states and 4915 transitions. [2019-11-15 22:27:12,999 INFO L78 Accepts]: Start accepts. Automaton has 3277 states and 4915 transitions. Word has length 391 [2019-11-15 22:27:13,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:13,000 INFO L462 AbstractCegarLoop]: Abstraction has 3277 states and 4915 transitions. [2019-11-15 22:27:13,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:27:13,000 INFO L276 IsEmpty]: Start isEmpty. Operand 3277 states and 4915 transitions. [2019-11-15 22:27:13,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2019-11-15 22:27:13,008 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:13,009 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:13,009 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:13,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:13,010 INFO L82 PathProgramCache]: Analyzing trace with hash -103706639, now seen corresponding path program 1 times [2019-11-15 22:27:13,010 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:13,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117737404] [2019-11-15 22:27:13,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:13,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:13,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:13,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2019-11-15 22:27:13,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117737404] [2019-11-15 22:27:13,249 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:13,249 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:27:13,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165793442] [2019-11-15 22:27:13,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:27:13,250 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:13,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:27:13,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:13,251 INFO L87 Difference]: Start difference. First operand 3277 states and 4915 transitions. Second operand 3 states. [2019-11-15 22:27:13,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:13,366 INFO L93 Difference]: Finished difference Result 6832 states and 10263 transitions. [2019-11-15 22:27:13,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:27:13,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 431 [2019-11-15 22:27:13,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:13,371 INFO L225 Difference]: With dead ends: 6832 [2019-11-15 22:27:13,372 INFO L226 Difference]: Without dead ends: 3574 [2019-11-15 22:27:13,376 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:13,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3574 states. [2019-11-15 22:27:13,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3574 to 3574. [2019-11-15 22:27:13,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3574 states. [2019-11-15 22:27:13,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 5368 transitions. [2019-11-15 22:27:13,533 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 5368 transitions. Word has length 431 [2019-11-15 22:27:13,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:13,534 INFO L462 AbstractCegarLoop]: Abstraction has 3574 states and 5368 transitions. [2019-11-15 22:27:13,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:27:13,534 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 5368 transitions. [2019-11-15 22:27:13,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2019-11-15 22:27:13,543 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:13,543 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:13,544 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:13,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:13,544 INFO L82 PathProgramCache]: Analyzing trace with hash -877290857, now seen corresponding path program 1 times [2019-11-15 22:27:13,544 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:13,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123774084] [2019-11-15 22:27:13,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:13,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:13,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:13,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2130 backedges. 358 proven. 0 refuted. 0 times theorem prover too weak. 1772 trivial. 0 not checked. [2019-11-15 22:27:13,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123774084] [2019-11-15 22:27:13,805 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:13,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:27:13,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600158590] [2019-11-15 22:27:13,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:27:13,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:13,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:27:13,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:13,806 INFO L87 Difference]: Start difference. First operand 3574 states and 5368 transitions. Second operand 3 states. [2019-11-15 22:27:13,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:13,915 INFO L93 Difference]: Finished difference Result 3873 states and 5824 transitions. [2019-11-15 22:27:13,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:27:13,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 473 [2019-11-15 22:27:13,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:13,919 INFO L225 Difference]: With dead ends: 3873 [2019-11-15 22:27:13,919 INFO L226 Difference]: Without dead ends: 3871 [2019-11-15 22:27:13,920 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:13,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3871 states. [2019-11-15 22:27:14,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3871 to 3871. [2019-11-15 22:27:14,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3871 states. [2019-11-15 22:27:14,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3871 states to 3871 states and 5822 transitions. [2019-11-15 22:27:14,022 INFO L78 Accepts]: Start accepts. Automaton has 3871 states and 5822 transitions. Word has length 473 [2019-11-15 22:27:14,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:14,023 INFO L462 AbstractCegarLoop]: Abstraction has 3871 states and 5822 transitions. [2019-11-15 22:27:14,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:27:14,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3871 states and 5822 transitions. [2019-11-15 22:27:14,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-11-15 22:27:14,031 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:14,031 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:14,031 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:14,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:14,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1920823596, now seen corresponding path program 1 times [2019-11-15 22:27:14,032 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:14,032 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687989260] [2019-11-15 22:27:14,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:14,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:14,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:14,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 1473 proven. 0 refuted. 0 times theorem prover too weak. 1055 trivial. 0 not checked. [2019-11-15 22:27:14,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687989260] [2019-11-15 22:27:14,418 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:14,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:14,419 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011606743] [2019-11-15 22:27:14,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:14,419 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:14,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:14,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:14,420 INFO L87 Difference]: Start difference. First operand 3871 states and 5822 transitions. Second operand 4 states. [2019-11-15 22:27:15,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:15,025 INFO L93 Difference]: Finished difference Result 9109 states and 13733 transitions. [2019-11-15 22:27:15,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:15,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 517 [2019-11-15 22:27:15,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:15,030 INFO L225 Difference]: With dead ends: 9109 [2019-11-15 22:27:15,030 INFO L226 Difference]: Without dead ends: 5257 [2019-11-15 22:27:15,033 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:15,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5257 states. [2019-11-15 22:27:15,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5257 to 4404. [2019-11-15 22:27:15,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4404 states. [2019-11-15 22:27:15,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4404 states to 4404 states and 6797 transitions. [2019-11-15 22:27:15,119 INFO L78 Accepts]: Start accepts. Automaton has 4404 states and 6797 transitions. Word has length 517 [2019-11-15 22:27:15,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:15,119 INFO L462 AbstractCegarLoop]: Abstraction has 4404 states and 6797 transitions. [2019-11-15 22:27:15,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:15,120 INFO L276 IsEmpty]: Start isEmpty. Operand 4404 states and 6797 transitions. [2019-11-15 22:27:15,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-11-15 22:27:15,128 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:15,128 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:15,128 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:15,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:15,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1671368488, now seen corresponding path program 1 times [2019-11-15 22:27:15,129 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:15,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872557364] [2019-11-15 22:27:15,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:15,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:15,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:15,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 1409 proven. 81 refuted. 0 times theorem prover too weak. 1038 trivial. 0 not checked. [2019-11-15 22:27:15,916 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872557364] [2019-11-15 22:27:15,916 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134737659] [2019-11-15 22:27:15,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:27:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:16,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 1703 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-15 22:27:16,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:27:16,519 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:16,520 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-15 22:27:16,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:16,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:16,560 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_164|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2019-11-15 22:27:16,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:16,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:16,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:16,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:16,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:16,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:16,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 22:27:16,627 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:16,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:16,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:16,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:16,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:16,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:16,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:16,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:16,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 22:27:16,689 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:16,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:16,749 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 22:27:16,749 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 22:27:16,750 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:16,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:16,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:27:16,764 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-15 22:27:16,849 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 22:27:16,849 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 22:27:16,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:16,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:16,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:27:16,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 22:27:16,928 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 22:27:16,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 22:27:16,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:16,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:16,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:27:16,945 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 22:27:16,949 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_167|]} [2019-11-15 22:27:16,953 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:27:16,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:17,019 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-15 22:27:17,020 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-15 22:27:17,020 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:17,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:17,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:27:17,031 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-15 22:27:17,092 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 22:27:17,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 22:27:17,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:17,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:17,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:27:17,101 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 22:27:17,146 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 22:27:17,146 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 22:27:17,147 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:17,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:17,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:27:17,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 22:27:17,163 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 12=[|v_#memory_$Pointer$.base_170|]} [2019-11-15 22:27:17,166 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:27:17,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:17,236 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-15 22:27:17,236 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-15 22:27:17,237 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:17,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:17,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:27:17,249 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-15 22:27:17,258 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_159|], 12=[|v_#memory_$Pointer$.base_171|]} [2019-11-15 22:27:17,270 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-15 22:27:17,271 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:27:17,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:17,450 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-11-15 22:27:17,450 INFO L341 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-11-15 22:27:17,451 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-11-15 22:27:17,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:27:17,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:27:17,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:27:17,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:27:17,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:27:17,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:27:17,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:27:17,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:27:17,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:27:17,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:27:17,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:27:17,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:27:17,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:27:17,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:27:17,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:27:17,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:27:17,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:27:17,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:27:17,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:27:17,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:27:17,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:27:17,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:27:17,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:27:17,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:27:17,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:27:17,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:27:17,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:27:17,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:27:17,500 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-11-15 22:27:17,601 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2019-11-15 22:27:17,601 INFO L567 ElimStorePlain]: treesize reduction 1115, result has 4.6 percent of original size [2019-11-15 22:27:17,602 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:27:17,602 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-11-15 22:27:17,612 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_162|], 12=[|v_#memory_$Pointer$.base_172|]} [2019-11-15 22:27:17,615 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:27:17,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:17,681 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-15 22:27:17,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-15 22:27:17,682 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:17,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:17,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:27:17,692 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-15 22:27:17,702 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_160|], 12=[|v_#memory_$Pointer$.base_173|]} [2019-11-15 22:27:17,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-15 22:27:17,711 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:27:17,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:17,859 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-11-15 22:27:17,859 INFO L341 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-11-15 22:27:17,860 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-11-15 22:27:17,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:27:17,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:27:17,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:27:17,864 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:17,895 INFO L567 ElimStorePlain]: treesize reduction 156, result has 25.7 percent of original size [2019-11-15 22:27:17,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:27:17,895 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-11-15 22:27:17,899 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_158|, |v_#memory_int_178|], 2=[|v_#memory_$Pointer$.base_163|], 12=[|v_#memory_$Pointer$.base_174|]} [2019-11-15 22:27:17,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 97 [2019-11-15 22:27:17,904 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:27:17,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:17,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:17,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:17,942 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 34 [2019-11-15 22:27:17,943 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:17,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:17,966 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:27:17,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:17,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 59 [2019-11-15 22:27:17,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:17,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:17,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:17,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:17,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:17,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:17,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:18,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:27:18,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 26 [2019-11-15 22:27:18,002 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:27:18,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:18,007 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:27:18,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:18,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:27:18,016 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:181, output treesize:32 [2019-11-15 22:27:18,098 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 22:27:18,098 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2019-11-15 22:27:18,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:27:18,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:27:18,105 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:27:18,105 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-11-15 22:27:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 1071 proven. 91 refuted. 0 times theorem prover too weak. 1366 trivial. 0 not checked. [2019-11-15 22:27:18,875 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:27:18,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-11-15 22:27:18,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634534506] [2019-11-15 22:27:18,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 22:27:18,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:18,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 22:27:18,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:27:18,878 INFO L87 Difference]: Start difference. First operand 4404 states and 6797 transitions. Second operand 12 states. [2019-11-15 22:27:27,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:27,794 INFO L93 Difference]: Finished difference Result 37587 states and 57832 transitions. [2019-11-15 22:27:27,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-15 22:27:27,795 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 517 [2019-11-15 22:27:27,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:27,864 INFO L225 Difference]: With dead ends: 37587 [2019-11-15 22:27:27,865 INFO L226 Difference]: Without dead ends: 33202 [2019-11-15 22:27:27,878 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 525 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=297, Invalid=1109, Unknown=0, NotChecked=0, Total=1406 [2019-11-15 22:27:27,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33202 states. [2019-11-15 22:27:28,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33202 to 19533. [2019-11-15 22:27:28,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-11-15 22:27:28,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 31279 transitions. [2019-11-15 22:27:28,754 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 31279 transitions. Word has length 517 [2019-11-15 22:27:28,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:28,755 INFO L462 AbstractCegarLoop]: Abstraction has 19533 states and 31279 transitions. [2019-11-15 22:27:28,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 22:27:28,755 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 31279 transitions. [2019-11-15 22:27:28,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2019-11-15 22:27:28,796 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:28,797 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 9, 8, 8, 7, 7, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:29,003 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:27:29,003 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:29,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:29,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1504842958, now seen corresponding path program 1 times [2019-11-15 22:27:29,004 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:29,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095569696] [2019-11-15 22:27:29,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:29,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:29,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:29,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2539 backedges. 1052 proven. 0 refuted. 0 times theorem prover too weak. 1487 trivial. 0 not checked. [2019-11-15 22:27:29,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095569696] [2019-11-15 22:27:29,551 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:29,551 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:29,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924823743] [2019-11-15 22:27:29,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:29,552 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:29,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:29,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:29,552 INFO L87 Difference]: Start difference. First operand 19533 states and 31279 transitions. Second operand 4 states. [2019-11-15 22:27:30,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:30,631 INFO L93 Difference]: Finished difference Result 42011 states and 66483 transitions. [2019-11-15 22:27:30,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:30,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 519 [2019-11-15 22:27:30,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:30,679 INFO L225 Difference]: With dead ends: 42011 [2019-11-15 22:27:30,679 INFO L226 Difference]: Without dead ends: 22497 [2019-11-15 22:27:30,701 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:30,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22497 states. [2019-11-15 22:27:31,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22497 to 19585. [2019-11-15 22:27:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19585 states. [2019-11-15 22:27:31,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19585 states to 19585 states and 31331 transitions. [2019-11-15 22:27:31,314 INFO L78 Accepts]: Start accepts. Automaton has 19585 states and 31331 transitions. Word has length 519 [2019-11-15 22:27:31,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:31,315 INFO L462 AbstractCegarLoop]: Abstraction has 19585 states and 31331 transitions. [2019-11-15 22:27:31,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:31,315 INFO L276 IsEmpty]: Start isEmpty. Operand 19585 states and 31331 transitions. [2019-11-15 22:27:31,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2019-11-15 22:27:31,332 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:31,333 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:31,333 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:31,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:31,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1808752744, now seen corresponding path program 1 times [2019-11-15 22:27:31,333 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:31,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313329762] [2019-11-15 22:27:31,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:31,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:31,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2541 backedges. 1162 proven. 0 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2019-11-15 22:27:31,874 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313329762] [2019-11-15 22:27:31,874 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:31,874 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:27:31,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491603421] [2019-11-15 22:27:31,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:27:31,875 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:31,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:27:31,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:31,876 INFO L87 Difference]: Start difference. First operand 19585 states and 31331 transitions. Second operand 5 states. [2019-11-15 22:27:33,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:33,340 INFO L93 Difference]: Finished difference Result 42869 states and 68508 transitions. [2019-11-15 22:27:33,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:27:33,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 519 [2019-11-15 22:27:33,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:33,370 INFO L225 Difference]: With dead ends: 42869 [2019-11-15 22:27:33,370 INFO L226 Difference]: Without dead ends: 23277 [2019-11-15 22:27:33,387 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:27:33,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23277 states. [2019-11-15 22:27:33,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23277 to 21275. [2019-11-15 22:27:33,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21275 states. [2019-11-15 22:27:33,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21275 states to 21275 states and 34347 transitions. [2019-11-15 22:27:33,966 INFO L78 Accepts]: Start accepts. Automaton has 21275 states and 34347 transitions. Word has length 519 [2019-11-15 22:27:33,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:33,966 INFO L462 AbstractCegarLoop]: Abstraction has 21275 states and 34347 transitions. [2019-11-15 22:27:33,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:27:33,967 INFO L276 IsEmpty]: Start isEmpty. Operand 21275 states and 34347 transitions. [2019-11-15 22:27:33,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2019-11-15 22:27:33,988 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:33,988 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:33,989 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:33,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:33,989 INFO L82 PathProgramCache]: Analyzing trace with hash 160121730, now seen corresponding path program 1 times [2019-11-15 22:27:33,989 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:33,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057117512] [2019-11-15 22:27:33,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:33,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:33,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:34,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2694 backedges. 1072 proven. 0 refuted. 0 times theorem prover too weak. 1622 trivial. 0 not checked. [2019-11-15 22:27:34,275 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057117512] [2019-11-15 22:27:34,275 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:34,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:34,276 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240651907] [2019-11-15 22:27:34,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:34,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:34,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:34,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:34,276 INFO L87 Difference]: Start difference. First operand 21275 states and 34347 transitions. Second operand 4 states. [2019-11-15 22:27:35,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:35,130 INFO L93 Difference]: Finished difference Result 43714 states and 70292 transitions. [2019-11-15 22:27:35,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:35,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 525 [2019-11-15 22:27:35,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:35,324 INFO L225 Difference]: With dead ends: 43714 [2019-11-15 22:27:35,324 INFO L226 Difference]: Without dead ends: 22458 [2019-11-15 22:27:35,333 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:35,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22458 states. [2019-11-15 22:27:35,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22458 to 21275. [2019-11-15 22:27:35,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21275 states. [2019-11-15 22:27:35,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21275 states to 21275 states and 34308 transitions. [2019-11-15 22:27:35,851 INFO L78 Accepts]: Start accepts. Automaton has 21275 states and 34308 transitions. Word has length 525 [2019-11-15 22:27:35,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:35,851 INFO L462 AbstractCegarLoop]: Abstraction has 21275 states and 34308 transitions. [2019-11-15 22:27:35,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:35,851 INFO L276 IsEmpty]: Start isEmpty. Operand 21275 states and 34308 transitions. [2019-11-15 22:27:35,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2019-11-15 22:27:35,877 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:35,877 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 14, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:35,878 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:35,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:35,878 INFO L82 PathProgramCache]: Analyzing trace with hash 522101649, now seen corresponding path program 1 times [2019-11-15 22:27:35,878 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:35,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110954101] [2019-11-15 22:27:35,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:35,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:35,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:36,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2681 backedges. 957 proven. 0 refuted. 0 times theorem prover too weak. 1724 trivial. 0 not checked. [2019-11-15 22:27:36,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110954101] [2019-11-15 22:27:36,184 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:36,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:36,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614486191] [2019-11-15 22:27:36,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:36,186 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:36,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:36,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:36,186 INFO L87 Difference]: Start difference. First operand 21275 states and 34308 transitions. Second operand 4 states. [2019-11-15 22:27:36,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:36,980 INFO L93 Difference]: Finished difference Result 43207 states and 69626 transitions. [2019-11-15 22:27:36,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:36,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 526 [2019-11-15 22:27:36,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:37,003 INFO L225 Difference]: With dead ends: 43207 [2019-11-15 22:27:37,003 INFO L226 Difference]: Without dead ends: 21951 [2019-11-15 22:27:37,017 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:37,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21951 states. [2019-11-15 22:27:37,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21951 to 21275. [2019-11-15 22:27:37,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21275 states. [2019-11-15 22:27:37,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21275 states to 21275 states and 34256 transitions. [2019-11-15 22:27:37,491 INFO L78 Accepts]: Start accepts. Automaton has 21275 states and 34256 transitions. Word has length 526 [2019-11-15 22:27:37,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:37,491 INFO L462 AbstractCegarLoop]: Abstraction has 21275 states and 34256 transitions. [2019-11-15 22:27:37,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:37,491 INFO L276 IsEmpty]: Start isEmpty. Operand 21275 states and 34256 transitions. [2019-11-15 22:27:37,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2019-11-15 22:27:37,510 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:37,510 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:37,510 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:37,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:37,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1827151813, now seen corresponding path program 1 times [2019-11-15 22:27:37,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:37,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227768581] [2019-11-15 22:27:37,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:37,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:37,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:38,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1087 proven. 0 refuted. 0 times theorem prover too weak. 1622 trivial. 0 not checked. [2019-11-15 22:27:38,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227768581] [2019-11-15 22:27:38,085 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:38,085 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:38,085 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236312573] [2019-11-15 22:27:38,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:38,085 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:38,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:38,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:38,086 INFO L87 Difference]: Start difference. First operand 21275 states and 34256 transitions. Second operand 4 states. [2019-11-15 22:27:38,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:38,953 INFO L93 Difference]: Finished difference Result 43636 states and 70032 transitions. [2019-11-15 22:27:38,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:38,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 526 [2019-11-15 22:27:38,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:38,975 INFO L225 Difference]: With dead ends: 43636 [2019-11-15 22:27:38,976 INFO L226 Difference]: Without dead ends: 22380 [2019-11-15 22:27:38,987 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:39,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22380 states. [2019-11-15 22:27:39,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22380 to 21275. [2019-11-15 22:27:39,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21275 states. [2019-11-15 22:27:39,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21275 states to 21275 states and 34217 transitions. [2019-11-15 22:27:39,475 INFO L78 Accepts]: Start accepts. Automaton has 21275 states and 34217 transitions. Word has length 526 [2019-11-15 22:27:39,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:39,475 INFO L462 AbstractCegarLoop]: Abstraction has 21275 states and 34217 transitions. [2019-11-15 22:27:39,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:39,475 INFO L276 IsEmpty]: Start isEmpty. Operand 21275 states and 34217 transitions. [2019-11-15 22:27:39,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2019-11-15 22:27:39,494 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:39,494 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:39,495 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:39,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:39,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1159735547, now seen corresponding path program 1 times [2019-11-15 22:27:39,495 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:39,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183634692] [2019-11-15 22:27:39,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:39,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:39,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:39,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2724 backedges. 1102 proven. 0 refuted. 0 times theorem prover too weak. 1622 trivial. 0 not checked. [2019-11-15 22:27:39,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183634692] [2019-11-15 22:27:39,791 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:39,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:39,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972830279] [2019-11-15 22:27:39,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:39,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:39,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:39,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:39,792 INFO L87 Difference]: Start difference. First operand 21275 states and 34217 transitions. Second operand 4 states. [2019-11-15 22:27:40,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:40,686 INFO L93 Difference]: Finished difference Result 43597 states and 69915 transitions. [2019-11-15 22:27:40,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:40,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 526 [2019-11-15 22:27:40,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:40,709 INFO L225 Difference]: With dead ends: 43597 [2019-11-15 22:27:40,709 INFO L226 Difference]: Without dead ends: 22341 [2019-11-15 22:27:40,719 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:40,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22341 states. [2019-11-15 22:27:41,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22341 to 21275. [2019-11-15 22:27:41,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21275 states. [2019-11-15 22:27:41,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21275 states to 21275 states and 34178 transitions. [2019-11-15 22:27:41,473 INFO L78 Accepts]: Start accepts. Automaton has 21275 states and 34178 transitions. Word has length 526 [2019-11-15 22:27:41,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:41,473 INFO L462 AbstractCegarLoop]: Abstraction has 21275 states and 34178 transitions. [2019-11-15 22:27:41,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:41,473 INFO L276 IsEmpty]: Start isEmpty. Operand 21275 states and 34178 transitions. [2019-11-15 22:27:41,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2019-11-15 22:27:41,493 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:41,493 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 14, 14, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:41,494 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:41,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:41,494 INFO L82 PathProgramCache]: Analyzing trace with hash 40252289, now seen corresponding path program 1 times [2019-11-15 22:27:41,494 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:41,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591204162] [2019-11-15 22:27:41,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:41,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:41,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:41,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2695 backedges. 971 proven. 0 refuted. 0 times theorem prover too weak. 1724 trivial. 0 not checked. [2019-11-15 22:27:41,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591204162] [2019-11-15 22:27:41,774 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:41,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:41,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867947357] [2019-11-15 22:27:41,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:41,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:41,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:41,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:41,776 INFO L87 Difference]: Start difference. First operand 21275 states and 34178 transitions. Second operand 4 states. [2019-11-15 22:27:42,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:42,583 INFO L93 Difference]: Finished difference Result 43207 states and 69366 transitions. [2019-11-15 22:27:42,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:42,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 527 [2019-11-15 22:27:42,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:42,606 INFO L225 Difference]: With dead ends: 43207 [2019-11-15 22:27:42,606 INFO L226 Difference]: Without dead ends: 21951 [2019-11-15 22:27:42,618 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:42,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21951 states. [2019-11-15 22:27:43,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21951 to 21275. [2019-11-15 22:27:43,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21275 states. [2019-11-15 22:27:43,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21275 states to 21275 states and 34126 transitions. [2019-11-15 22:27:43,108 INFO L78 Accepts]: Start accepts. Automaton has 21275 states and 34126 transitions. Word has length 527 [2019-11-15 22:27:43,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:43,108 INFO L462 AbstractCegarLoop]: Abstraction has 21275 states and 34126 transitions. [2019-11-15 22:27:43,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:43,109 INFO L276 IsEmpty]: Start isEmpty. Operand 21275 states and 34126 transitions. [2019-11-15 22:27:43,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2019-11-15 22:27:43,128 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:43,128 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:43,128 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:43,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:43,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1257177922, now seen corresponding path program 1 times [2019-11-15 22:27:43,129 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:43,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916518742] [2019-11-15 22:27:43,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:43,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:43,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:43,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2634 backedges. 1012 proven. 0 refuted. 0 times theorem prover too weak. 1622 trivial. 0 not checked. [2019-11-15 22:27:43,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916518742] [2019-11-15 22:27:43,375 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:43,375 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:43,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070858800] [2019-11-15 22:27:43,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:43,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:43,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:43,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:43,376 INFO L87 Difference]: Start difference. First operand 21275 states and 34126 transitions. Second operand 4 states. [2019-11-15 22:27:44,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:44,240 INFO L93 Difference]: Finished difference Result 32450 states and 51735 transitions. [2019-11-15 22:27:44,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:44,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 527 [2019-11-15 22:27:44,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:44,271 INFO L225 Difference]: With dead ends: 32450 [2019-11-15 22:27:44,271 INFO L226 Difference]: Without dead ends: 22341 [2019-11-15 22:27:44,283 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:44,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22341 states. [2019-11-15 22:27:45,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22341 to 21275. [2019-11-15 22:27:45,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21275 states. [2019-11-15 22:27:45,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21275 states to 21275 states and 34087 transitions. [2019-11-15 22:27:45,208 INFO L78 Accepts]: Start accepts. Automaton has 21275 states and 34087 transitions. Word has length 527 [2019-11-15 22:27:45,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:45,208 INFO L462 AbstractCegarLoop]: Abstraction has 21275 states and 34087 transitions. [2019-11-15 22:27:45,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:45,208 INFO L276 IsEmpty]: Start isEmpty. Operand 21275 states and 34087 transitions. [2019-11-15 22:27:45,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2019-11-15 22:27:45,226 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:45,227 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:45,227 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:45,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:45,228 INFO L82 PathProgramCache]: Analyzing trace with hash 3628438, now seen corresponding path program 1 times [2019-11-15 22:27:45,228 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:45,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152264908] [2019-11-15 22:27:45,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:45,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:45,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:45,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 985 proven. 0 refuted. 0 times theorem prover too weak. 1724 trivial. 0 not checked. [2019-11-15 22:27:45,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152264908] [2019-11-15 22:27:45,527 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:45,527 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:45,528 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90414066] [2019-11-15 22:27:45,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:45,528 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:45,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:45,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:45,529 INFO L87 Difference]: Start difference. First operand 21275 states and 34087 transitions. Second operand 4 states. [2019-11-15 22:27:46,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:46,536 INFO L93 Difference]: Finished difference Result 43051 states and 68984 transitions. [2019-11-15 22:27:46,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:46,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 528 [2019-11-15 22:27:46,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:46,558 INFO L225 Difference]: With dead ends: 43051 [2019-11-15 22:27:46,558 INFO L226 Difference]: Without dead ends: 21795 [2019-11-15 22:27:46,569 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:46,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21795 states. [2019-11-15 22:27:47,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21795 to 21275. [2019-11-15 22:27:47,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21275 states. [2019-11-15 22:27:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21275 states to 21275 states and 34035 transitions. [2019-11-15 22:27:47,059 INFO L78 Accepts]: Start accepts. Automaton has 21275 states and 34035 transitions. Word has length 528 [2019-11-15 22:27:47,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:47,059 INFO L462 AbstractCegarLoop]: Abstraction has 21275 states and 34035 transitions. [2019-11-15 22:27:47,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:47,059 INFO L276 IsEmpty]: Start isEmpty. Operand 21275 states and 34035 transitions. [2019-11-15 22:27:47,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2019-11-15 22:27:47,078 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:47,078 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:47,079 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:47,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:47,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1459194495, now seen corresponding path program 1 times [2019-11-15 22:27:47,079 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:47,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745337040] [2019-11-15 22:27:47,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:47,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:47,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:47,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2649 backedges. 1027 proven. 0 refuted. 0 times theorem prover too weak. 1622 trivial. 0 not checked. [2019-11-15 22:27:47,367 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745337040] [2019-11-15 22:27:47,367 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:47,368 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:47,368 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613059353] [2019-11-15 22:27:47,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:47,369 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:47,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:47,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:47,369 INFO L87 Difference]: Start difference. First operand 21275 states and 34035 transitions. Second operand 4 states. [2019-11-15 22:27:48,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:48,246 INFO L93 Difference]: Finished difference Result 32450 states and 51605 transitions. [2019-11-15 22:27:48,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:48,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 528 [2019-11-15 22:27:48,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:48,269 INFO L225 Difference]: With dead ends: 32450 [2019-11-15 22:27:48,270 INFO L226 Difference]: Without dead ends: 22341 [2019-11-15 22:27:48,277 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:48,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22341 states. [2019-11-15 22:27:49,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22341 to 21275. [2019-11-15 22:27:49,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21275 states. [2019-11-15 22:27:49,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21275 states to 21275 states and 33996 transitions. [2019-11-15 22:27:49,217 INFO L78 Accepts]: Start accepts. Automaton has 21275 states and 33996 transitions. Word has length 528 [2019-11-15 22:27:49,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:49,217 INFO L462 AbstractCegarLoop]: Abstraction has 21275 states and 33996 transitions. [2019-11-15 22:27:49,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:49,218 INFO L276 IsEmpty]: Start isEmpty. Operand 21275 states and 33996 transitions. [2019-11-15 22:27:49,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2019-11-15 22:27:49,237 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:49,237 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:49,238 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:49,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:49,238 INFO L82 PathProgramCache]: Analyzing trace with hash 742873721, now seen corresponding path program 1 times [2019-11-15 22:27:49,238 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:49,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809544283] [2019-11-15 22:27:49,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:49,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:49,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:49,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1042 proven. 0 refuted. 0 times theorem prover too weak. 1622 trivial. 0 not checked. [2019-11-15 22:27:49,540 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809544283] [2019-11-15 22:27:49,540 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:49,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:49,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722359478] [2019-11-15 22:27:49,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:49,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:49,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:49,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:49,542 INFO L87 Difference]: Start difference. First operand 21275 states and 33996 transitions. Second operand 4 states. [2019-11-15 22:27:50,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:50,457 INFO L93 Difference]: Finished difference Result 32450 states and 51553 transitions. [2019-11-15 22:27:50,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:50,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 529 [2019-11-15 22:27:50,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:50,480 INFO L225 Difference]: With dead ends: 32450 [2019-11-15 22:27:50,480 INFO L226 Difference]: Without dead ends: 22341 [2019-11-15 22:27:50,488 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:50,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22341 states. [2019-11-15 22:27:50,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22341 to 21275. [2019-11-15 22:27:50,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21275 states. [2019-11-15 22:27:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21275 states to 21275 states and 33957 transitions. [2019-11-15 22:27:50,984 INFO L78 Accepts]: Start accepts. Automaton has 21275 states and 33957 transitions. Word has length 529 [2019-11-15 22:27:50,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:50,984 INFO L462 AbstractCegarLoop]: Abstraction has 21275 states and 33957 transitions. [2019-11-15 22:27:50,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:50,984 INFO L276 IsEmpty]: Start isEmpty. Operand 21275 states and 33957 transitions. [2019-11-15 22:27:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2019-11-15 22:27:51,003 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:51,003 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:51,003 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:51,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:51,004 INFO L82 PathProgramCache]: Analyzing trace with hash 162159068, now seen corresponding path program 1 times [2019-11-15 22:27:51,004 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:51,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792401222] [2019-11-15 22:27:51,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:51,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:51,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:51,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2679 backedges. 1057 proven. 0 refuted. 0 times theorem prover too weak. 1622 trivial. 0 not checked. [2019-11-15 22:27:51,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792401222] [2019-11-15 22:27:51,282 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:51,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:51,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026019651] [2019-11-15 22:27:51,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:51,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:51,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:51,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:51,284 INFO L87 Difference]: Start difference. First operand 21275 states and 33957 transitions. Second operand 4 states. [2019-11-15 22:27:52,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:52,158 INFO L93 Difference]: Finished difference Result 32320 states and 51345 transitions. [2019-11-15 22:27:52,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:52,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 530 [2019-11-15 22:27:52,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:52,181 INFO L225 Difference]: With dead ends: 32320 [2019-11-15 22:27:52,181 INFO L226 Difference]: Without dead ends: 22211 [2019-11-15 22:27:52,189 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:52,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22211 states. [2019-11-15 22:27:52,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22211 to 21275. [2019-11-15 22:27:52,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21275 states. [2019-11-15 22:27:52,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21275 states to 21275 states and 33918 transitions. [2019-11-15 22:27:52,709 INFO L78 Accepts]: Start accepts. Automaton has 21275 states and 33918 transitions. Word has length 530 [2019-11-15 22:27:52,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:52,709 INFO L462 AbstractCegarLoop]: Abstraction has 21275 states and 33918 transitions. [2019-11-15 22:27:52,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:52,709 INFO L276 IsEmpty]: Start isEmpty. Operand 21275 states and 33918 transitions. [2019-11-15 22:27:52,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2019-11-15 22:27:52,735 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:52,735 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:52,735 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:52,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:52,736 INFO L82 PathProgramCache]: Analyzing trace with hash 456753415, now seen corresponding path program 1 times [2019-11-15 22:27:52,736 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:52,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265000112] [2019-11-15 22:27:52,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:52,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:52,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:53,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2694 backedges. 1263 proven. 0 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-11-15 22:27:53,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265000112] [2019-11-15 22:27:53,431 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:53,431 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:53,431 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011247725] [2019-11-15 22:27:53,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:53,432 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:53,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:53,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:53,432 INFO L87 Difference]: Start difference. First operand 21275 states and 33918 transitions. Second operand 4 states. [2019-11-15 22:27:54,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:54,413 INFO L93 Difference]: Finished difference Result 45859 states and 73094 transitions. [2019-11-15 22:27:54,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:54,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 531 [2019-11-15 22:27:54,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:54,439 INFO L225 Difference]: With dead ends: 45859 [2019-11-15 22:27:54,439 INFO L226 Difference]: Without dead ends: 24603 [2019-11-15 22:27:54,450 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:54,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24603 states. [2019-11-15 22:27:54,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24603 to 21249. [2019-11-15 22:27:54,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21249 states. [2019-11-15 22:27:54,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21249 states to 21249 states and 33866 transitions. [2019-11-15 22:27:54,939 INFO L78 Accepts]: Start accepts. Automaton has 21249 states and 33866 transitions. Word has length 531 [2019-11-15 22:27:54,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:54,940 INFO L462 AbstractCegarLoop]: Abstraction has 21249 states and 33866 transitions. [2019-11-15 22:27:54,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:54,940 INFO L276 IsEmpty]: Start isEmpty. Operand 21249 states and 33866 transitions. [2019-11-15 22:27:54,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2019-11-15 22:27:54,957 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:54,958 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:54,958 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:54,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:54,958 INFO L82 PathProgramCache]: Analyzing trace with hash -554087904, now seen corresponding path program 1 times [2019-11-15 22:27:54,958 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:54,959 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359394406] [2019-11-15 22:27:54,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:54,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:54,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:55,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2724 backedges. 1292 proven. 0 refuted. 0 times theorem prover too weak. 1432 trivial. 0 not checked. [2019-11-15 22:27:55,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359394406] [2019-11-15 22:27:55,217 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:55,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:55,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711209928] [2019-11-15 22:27:55,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:55,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:55,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:55,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:55,218 INFO L87 Difference]: Start difference. First operand 21249 states and 33866 transitions. Second operand 4 states. [2019-11-15 22:27:56,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:56,295 INFO L93 Difference]: Finished difference Result 45391 states and 71553 transitions. [2019-11-15 22:27:56,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:56,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 532 [2019-11-15 22:27:56,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:56,318 INFO L225 Difference]: With dead ends: 45391 [2019-11-15 22:27:56,318 INFO L226 Difference]: Without dead ends: 24161 [2019-11-15 22:27:56,330 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:56,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24161 states. [2019-11-15 22:27:56,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24161 to 21249. [2019-11-15 22:27:56,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21249 states. [2019-11-15 22:27:56,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21249 states to 21249 states and 33814 transitions. [2019-11-15 22:27:56,821 INFO L78 Accepts]: Start accepts. Automaton has 21249 states and 33814 transitions. Word has length 532 [2019-11-15 22:27:56,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:56,821 INFO L462 AbstractCegarLoop]: Abstraction has 21249 states and 33814 transitions. [2019-11-15 22:27:56,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:56,821 INFO L276 IsEmpty]: Start isEmpty. Operand 21249 states and 33814 transitions. [2019-11-15 22:27:56,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2019-11-15 22:27:56,838 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:56,839 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:56,839 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:56,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:56,839 INFO L82 PathProgramCache]: Analyzing trace with hash -82340626, now seen corresponding path program 1 times [2019-11-15 22:27:56,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:56,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597321970] [2019-11-15 22:27:56,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:56,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:56,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:57,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2733 backedges. 1301 proven. 0 refuted. 0 times theorem prover too weak. 1432 trivial. 0 not checked. [2019-11-15 22:27:57,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597321970] [2019-11-15 22:27:57,055 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:57,055 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:57,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581269648] [2019-11-15 22:27:57,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:57,056 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:57,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:57,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:57,056 INFO L87 Difference]: Start difference. First operand 21249 states and 33814 transitions. Second operand 4 states. [2019-11-15 22:27:58,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:58,278 INFO L93 Difference]: Finished difference Result 45079 states and 71017 transitions. [2019-11-15 22:27:58,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:58,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 533 [2019-11-15 22:27:58,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:58,302 INFO L225 Difference]: With dead ends: 45079 [2019-11-15 22:27:58,302 INFO L226 Difference]: Without dead ends: 23849 [2019-11-15 22:27:58,314 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:58,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23849 states. [2019-11-15 22:27:58,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23849 to 21249. [2019-11-15 22:27:58,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21249 states. [2019-11-15 22:27:58,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21249 states to 21249 states and 33762 transitions. [2019-11-15 22:27:58,864 INFO L78 Accepts]: Start accepts. Automaton has 21249 states and 33762 transitions. Word has length 533 [2019-11-15 22:27:58,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:58,864 INFO L462 AbstractCegarLoop]: Abstraction has 21249 states and 33762 transitions. [2019-11-15 22:27:58,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:58,864 INFO L276 IsEmpty]: Start isEmpty. Operand 21249 states and 33762 transitions. [2019-11-15 22:27:58,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2019-11-15 22:27:58,883 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:58,884 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:58,884 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:58,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:58,884 INFO L82 PathProgramCache]: Analyzing trace with hash 338029827, now seen corresponding path program 1 times [2019-11-15 22:27:58,885 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:58,885 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946523262] [2019-11-15 22:27:58,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:58,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:58,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:59,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2634 backedges. 1291 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2019-11-15 22:27:59,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946523262] [2019-11-15 22:27:59,325 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:59,325 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:27:59,325 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442168839] [2019-11-15 22:27:59,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:27:59,326 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:59,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:27:59,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:27:59,326 INFO L87 Difference]: Start difference. First operand 21249 states and 33762 transitions. Second operand 7 states. [2019-11-15 22:28:02,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:28:02,724 INFO L93 Difference]: Finished difference Result 69494 states and 109040 transitions. [2019-11-15 22:28:02,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:28:02,724 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 533 [2019-11-15 22:28:02,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:28:02,775 INFO L225 Difference]: With dead ends: 69494 [2019-11-15 22:28:02,775 INFO L226 Difference]: Without dead ends: 48264 [2019-11-15 22:28:02,790 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:28:02,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48264 states. [2019-11-15 22:28:03,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48264 to 23485. [2019-11-15 22:28:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23485 states. [2019-11-15 22:28:03,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23485 states to 23485 states and 37818 transitions. [2019-11-15 22:28:03,522 INFO L78 Accepts]: Start accepts. Automaton has 23485 states and 37818 transitions. Word has length 533 [2019-11-15 22:28:03,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:28:03,523 INFO L462 AbstractCegarLoop]: Abstraction has 23485 states and 37818 transitions. [2019-11-15 22:28:03,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:28:03,523 INFO L276 IsEmpty]: Start isEmpty. Operand 23485 states and 37818 transitions. [2019-11-15 22:28:03,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2019-11-15 22:28:03,542 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:28:03,542 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:28:03,543 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:28:03,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:28:03,543 INFO L82 PathProgramCache]: Analyzing trace with hash -351801663, now seen corresponding path program 1 times [2019-11-15 22:28:03,544 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:28:03,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982147055] [2019-11-15 22:28:03,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:03,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:03,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:28:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:04,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2634 backedges. 1201 proven. 0 refuted. 0 times theorem prover too weak. 1433 trivial. 0 not checked. [2019-11-15 22:28:04,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982147055] [2019-11-15 22:28:04,369 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:28:04,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:28:04,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709547308] [2019-11-15 22:28:04,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:28:04,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:28:04,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:28:04,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:28:04,371 INFO L87 Difference]: Start difference. First operand 23485 states and 37818 transitions. Second operand 6 states. [2019-11-15 22:28:06,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:28:06,876 INFO L93 Difference]: Finished difference Result 55882 states and 88762 transitions. [2019-11-15 22:28:06,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:28:06,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 533 [2019-11-15 22:28:06,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:28:06,909 INFO L225 Difference]: With dead ends: 55882 [2019-11-15 22:28:06,909 INFO L226 Difference]: Without dead ends: 32416 [2019-11-15 22:28:06,922 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:28:06,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32416 states. [2019-11-15 22:28:07,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32416 to 24057. [2019-11-15 22:28:07,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24057 states. [2019-11-15 22:28:07,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24057 states to 24057 states and 38702 transitions. [2019-11-15 22:28:07,585 INFO L78 Accepts]: Start accepts. Automaton has 24057 states and 38702 transitions. Word has length 533 [2019-11-15 22:28:07,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:28:07,585 INFO L462 AbstractCegarLoop]: Abstraction has 24057 states and 38702 transitions. [2019-11-15 22:28:07,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:28:07,585 INFO L276 IsEmpty]: Start isEmpty. Operand 24057 states and 38702 transitions. [2019-11-15 22:28:07,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2019-11-15 22:28:07,605 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:28:07,605 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:28:07,605 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:28:07,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:28:07,606 INFO L82 PathProgramCache]: Analyzing trace with hash -291248801, now seen corresponding path program 2 times [2019-11-15 22:28:07,606 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:28:07,606 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179410257] [2019-11-15 22:28:07,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:07,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:07,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:28:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:07,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2634 backedges. 820 proven. 0 refuted. 0 times theorem prover too weak. 1814 trivial. 0 not checked. [2019-11-15 22:28:07,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179410257] [2019-11-15 22:28:07,872 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:28:07,872 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:28:07,872 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203418314] [2019-11-15 22:28:07,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:28:07,873 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:28:07,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:28:07,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:28:07,873 INFO L87 Difference]: Start difference. First operand 24057 states and 38702 transitions. Second operand 6 states. [2019-11-15 22:28:09,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:28:09,921 INFO L93 Difference]: Finished difference Result 57221 states and 90942 transitions. [2019-11-15 22:28:09,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:28:09,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 533 [2019-11-15 22:28:09,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:28:09,955 INFO L225 Difference]: With dead ends: 57221 [2019-11-15 22:28:09,955 INFO L226 Difference]: Without dead ends: 33183 [2019-11-15 22:28:09,969 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:28:09,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33183 states. [2019-11-15 22:28:10,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33183 to 25409. [2019-11-15 22:28:10,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25409 states. [2019-11-15 22:28:10,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25409 states to 25409 states and 40613 transitions. [2019-11-15 22:28:10,727 INFO L78 Accepts]: Start accepts. Automaton has 25409 states and 40613 transitions. Word has length 533 [2019-11-15 22:28:10,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:28:10,727 INFO L462 AbstractCegarLoop]: Abstraction has 25409 states and 40613 transitions. [2019-11-15 22:28:10,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:28:10,728 INFO L276 IsEmpty]: Start isEmpty. Operand 25409 states and 40613 transitions. [2019-11-15 22:28:10,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2019-11-15 22:28:10,748 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:28:10,749 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 12, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:28:10,749 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:28:10,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:28:10,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1314940563, now seen corresponding path program 1 times [2019-11-15 22:28:10,749 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:28:10,750 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650746963] [2019-11-15 22:28:10,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:10,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:10,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:28:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:11,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2660 backedges. 681 proven. 0 refuted. 0 times theorem prover too weak. 1979 trivial. 0 not checked. [2019-11-15 22:28:11,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650746963] [2019-11-15 22:28:11,144 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:28:11,145 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:28:11,145 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871592872] [2019-11-15 22:28:11,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:28:11,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:28:11,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:28:11,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:28:11,145 INFO L87 Difference]: Start difference. First operand 25409 states and 40613 transitions. Second operand 4 states. [2019-11-15 22:28:12,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:28:12,428 INFO L93 Difference]: Finished difference Result 42213 states and 66971 transitions. [2019-11-15 22:28:12,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:28:12,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 535 [2019-11-15 22:28:12,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:28:12,460 INFO L225 Difference]: With dead ends: 42213 [2019-11-15 22:28:12,460 INFO L226 Difference]: Without dead ends: 29192 [2019-11-15 22:28:12,469 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:28:12,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29192 states. [2019-11-15 22:28:13,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29192 to 25409. [2019-11-15 22:28:13,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25409 states. [2019-11-15 22:28:13,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25409 states to 25409 states and 40561 transitions. [2019-11-15 22:28:13,246 INFO L78 Accepts]: Start accepts. Automaton has 25409 states and 40561 transitions. Word has length 535 [2019-11-15 22:28:13,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:28:13,246 INFO L462 AbstractCegarLoop]: Abstraction has 25409 states and 40561 transitions. [2019-11-15 22:28:13,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:28:13,247 INFO L276 IsEmpty]: Start isEmpty. Operand 25409 states and 40561 transitions. [2019-11-15 22:28:13,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2019-11-15 22:28:13,268 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:28:13,268 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:28:13,269 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:28:13,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:28:13,269 INFO L82 PathProgramCache]: Analyzing trace with hash 925616752, now seen corresponding path program 1 times [2019-11-15 22:28:13,269 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:28:13,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228021834] [2019-11-15 22:28:13,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:13,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:13,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:28:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:13,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2658 backedges. 1027 proven. 0 refuted. 0 times theorem prover too weak. 1631 trivial. 0 not checked. [2019-11-15 22:28:13,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228021834] [2019-11-15 22:28:13,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:28:13,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:28:13,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813557350] [2019-11-15 22:28:13,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:28:13,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:28:13,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:28:13,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:28:13,607 INFO L87 Difference]: Start difference. First operand 25409 states and 40561 transitions. Second operand 4 states. [2019-11-15 22:28:14,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:28:14,818 INFO L93 Difference]: Finished difference Result 40276 states and 63931 transitions. [2019-11-15 22:28:14,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:28:14,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 535 [2019-11-15 22:28:14,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:28:14,846 INFO L225 Difference]: With dead ends: 40276 [2019-11-15 22:28:14,846 INFO L226 Difference]: Without dead ends: 27255 [2019-11-15 22:28:14,856 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:28:14,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27255 states. [2019-11-15 22:28:15,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27255 to 25409. [2019-11-15 22:28:15,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25409 states. [2019-11-15 22:28:15,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25409 states to 25409 states and 40483 transitions. [2019-11-15 22:28:15,550 INFO L78 Accepts]: Start accepts. Automaton has 25409 states and 40483 transitions. Word has length 535 [2019-11-15 22:28:15,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:28:15,550 INFO L462 AbstractCegarLoop]: Abstraction has 25409 states and 40483 transitions. [2019-11-15 22:28:15,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:28:15,550 INFO L276 IsEmpty]: Start isEmpty. Operand 25409 states and 40483 transitions. [2019-11-15 22:28:15,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2019-11-15 22:28:15,572 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:28:15,572 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:28:15,572 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:28:15,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:28:15,572 INFO L82 PathProgramCache]: Analyzing trace with hash 637368406, now seen corresponding path program 1 times [2019-11-15 22:28:15,573 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:28:15,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268487950] [2019-11-15 22:28:15,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:15,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:15,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:28:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:15,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 1164 proven. 0 refuted. 0 times theorem prover too weak. 1631 trivial. 0 not checked. [2019-11-15 22:28:15,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268487950] [2019-11-15 22:28:15,833 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:28:15,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:28:15,834 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629302802] [2019-11-15 22:28:15,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:28:15,835 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:28:15,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:28:15,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:28:15,835 INFO L87 Difference]: Start difference. First operand 25409 states and 40483 transitions. Second operand 4 states. [2019-11-15 22:28:17,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:28:17,355 INFO L93 Difference]: Finished difference Result 51735 states and 82291 transitions. [2019-11-15 22:28:17,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:28:17,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 535 [2019-11-15 22:28:17,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:28:17,382 INFO L225 Difference]: With dead ends: 51735 [2019-11-15 22:28:17,382 INFO L226 Difference]: Without dead ends: 26345 [2019-11-15 22:28:17,391 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:28:17,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26345 states. [2019-11-15 22:28:18,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26345 to 25409. [2019-11-15 22:28:18,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25409 states. [2019-11-15 22:28:18,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25409 states to 25409 states and 40444 transitions. [2019-11-15 22:28:18,139 INFO L78 Accepts]: Start accepts. Automaton has 25409 states and 40444 transitions. Word has length 535 [2019-11-15 22:28:18,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:28:18,139 INFO L462 AbstractCegarLoop]: Abstraction has 25409 states and 40444 transitions. [2019-11-15 22:28:18,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:28:18,140 INFO L276 IsEmpty]: Start isEmpty. Operand 25409 states and 40444 transitions. [2019-11-15 22:28:18,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2019-11-15 22:28:18,159 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:28:18,160 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:28:18,160 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:28:18,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:28:18,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1615129942, now seen corresponding path program 1 times [2019-11-15 22:28:18,160 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:28:18,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243623112] [2019-11-15 22:28:18,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:18,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:18,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:28:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2819 backedges. 1188 proven. 0 refuted. 0 times theorem prover too weak. 1631 trivial. 0 not checked. [2019-11-15 22:28:18,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243623112] [2019-11-15 22:28:18,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:28:18,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:28:18,381 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878810365] [2019-11-15 22:28:18,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:28:18,381 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:28:18,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:28:18,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:28:18,382 INFO L87 Difference]: Start difference. First operand 25409 states and 40444 transitions. Second operand 4 states. [2019-11-15 22:28:19,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:28:19,438 INFO L93 Difference]: Finished difference Result 51735 states and 82213 transitions. [2019-11-15 22:28:19,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:28:19,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 535 [2019-11-15 22:28:19,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:28:19,464 INFO L225 Difference]: With dead ends: 51735 [2019-11-15 22:28:19,464 INFO L226 Difference]: Without dead ends: 26345 [2019-11-15 22:28:19,477 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:28:19,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26345 states. [2019-11-15 22:28:20,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26345 to 25409. [2019-11-15 22:28:20,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25409 states. [2019-11-15 22:28:20,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25409 states to 25409 states and 40405 transitions. [2019-11-15 22:28:20,190 INFO L78 Accepts]: Start accepts. Automaton has 25409 states and 40405 transitions. Word has length 535 [2019-11-15 22:28:20,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:28:20,190 INFO L462 AbstractCegarLoop]: Abstraction has 25409 states and 40405 transitions. [2019-11-15 22:28:20,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:28:20,190 INFO L276 IsEmpty]: Start isEmpty. Operand 25409 states and 40405 transitions. [2019-11-15 22:28:20,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2019-11-15 22:28:20,211 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:28:20,212 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 12, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:28:20,212 INFO L410 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:28:20,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:28:20,212 INFO L82 PathProgramCache]: Analyzing trace with hash -345217133, now seen corresponding path program 1 times [2019-11-15 22:28:20,213 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:28:20,213 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544685266] [2019-11-15 22:28:20,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:20,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:20,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:28:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:20,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2675 backedges. 696 proven. 0 refuted. 0 times theorem prover too weak. 1979 trivial. 0 not checked. [2019-11-15 22:28:20,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544685266] [2019-11-15 22:28:20,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:28:20,446 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:28:20,446 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655092130] [2019-11-15 22:28:20,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:28:20,447 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:28:20,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:28:20,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:28:20,448 INFO L87 Difference]: Start difference. First operand 25409 states and 40405 transitions. Second operand 4 states. [2019-11-15 22:28:21,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:28:21,975 INFO L93 Difference]: Finished difference Result 42213 states and 66659 transitions. [2019-11-15 22:28:21,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:28:21,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 536 [2019-11-15 22:28:21,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:28:22,007 INFO L225 Difference]: With dead ends: 42213 [2019-11-15 22:28:22,007 INFO L226 Difference]: Without dead ends: 29192 [2019-11-15 22:28:22,017 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:28:22,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29192 states. [2019-11-15 22:28:22,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29192 to 25409. [2019-11-15 22:28:22,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25409 states. [2019-11-15 22:28:22,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25409 states to 25409 states and 40353 transitions. [2019-11-15 22:28:22,805 INFO L78 Accepts]: Start accepts. Automaton has 25409 states and 40353 transitions. Word has length 536 [2019-11-15 22:28:22,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:28:22,805 INFO L462 AbstractCegarLoop]: Abstraction has 25409 states and 40353 transitions. [2019-11-15 22:28:22,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:28:22,805 INFO L276 IsEmpty]: Start isEmpty. Operand 25409 states and 40353 transitions. [2019-11-15 22:28:22,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2019-11-15 22:28:22,826 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:28:22,827 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:28:22,827 INFO L410 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:28:22,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:28:22,827 INFO L82 PathProgramCache]: Analyzing trace with hash -200147186, now seen corresponding path program 1 times [2019-11-15 22:28:22,827 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:28:22,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153083558] [2019-11-15 22:28:22,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:22,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:22,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:28:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:23,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2673 backedges. 1042 proven. 0 refuted. 0 times theorem prover too weak. 1631 trivial. 0 not checked. [2019-11-15 22:28:23,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153083558] [2019-11-15 22:28:23,289 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:28:23,289 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:28:23,289 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897096826] [2019-11-15 22:28:23,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:28:23,290 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:28:23,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:28:23,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:28:23,290 INFO L87 Difference]: Start difference. First operand 25409 states and 40353 transitions. Second operand 4 states. [2019-11-15 22:28:24,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:28:24,525 INFO L93 Difference]: Finished difference Result 40276 states and 63619 transitions. [2019-11-15 22:28:24,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:28:24,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 536 [2019-11-15 22:28:24,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:28:24,554 INFO L225 Difference]: With dead ends: 40276 [2019-11-15 22:28:24,554 INFO L226 Difference]: Without dead ends: 27255 [2019-11-15 22:28:24,563 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:28:24,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27255 states. [2019-11-15 22:28:25,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27255 to 25409. [2019-11-15 22:28:25,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25409 states. [2019-11-15 22:28:25,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25409 states to 25409 states and 40275 transitions. [2019-11-15 22:28:25,397 INFO L78 Accepts]: Start accepts. Automaton has 25409 states and 40275 transitions. Word has length 536 [2019-11-15 22:28:25,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:28:25,397 INFO L462 AbstractCegarLoop]: Abstraction has 25409 states and 40275 transitions. [2019-11-15 22:28:25,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:28:25,397 INFO L276 IsEmpty]: Start isEmpty. Operand 25409 states and 40275 transitions. [2019-11-15 22:28:25,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2019-11-15 22:28:25,418 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:28:25,418 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:28:25,418 INFO L410 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:28:25,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:28:25,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1442701575, now seen corresponding path program 1 times [2019-11-15 22:28:25,419 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:28:25,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915184598] [2019-11-15 22:28:25,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:25,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:25,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:28:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:25,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2808 backedges. 1177 proven. 0 refuted. 0 times theorem prover too weak. 1631 trivial. 0 not checked. [2019-11-15 22:28:25,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915184598] [2019-11-15 22:28:25,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:28:25,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:28:25,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209139345] [2019-11-15 22:28:25,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:28:25,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:28:25,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:28:25,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:28:25,708 INFO L87 Difference]: Start difference. First operand 25409 states and 40275 transitions. Second operand 4 states. [2019-11-15 22:28:26,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:28:26,927 INFO L93 Difference]: Finished difference Result 51579 states and 81647 transitions. [2019-11-15 22:28:26,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:28:26,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 536 [2019-11-15 22:28:26,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:28:26,955 INFO L225 Difference]: With dead ends: 51579 [2019-11-15 22:28:26,956 INFO L226 Difference]: Without dead ends: 26189 [2019-11-15 22:28:26,970 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:28:26,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26189 states. [2019-11-15 22:28:27,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26189 to 25409. [2019-11-15 22:28:27,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25409 states. [2019-11-15 22:28:27,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25409 states to 25409 states and 40236 transitions. [2019-11-15 22:28:27,755 INFO L78 Accepts]: Start accepts. Automaton has 25409 states and 40236 transitions. Word has length 536 [2019-11-15 22:28:27,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:28:27,755 INFO L462 AbstractCegarLoop]: Abstraction has 25409 states and 40236 transitions. [2019-11-15 22:28:27,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:28:27,756 INFO L276 IsEmpty]: Start isEmpty. Operand 25409 states and 40236 transitions. [2019-11-15 22:28:27,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2019-11-15 22:28:27,777 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:28:27,778 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 13, 12, 11, 11, 10, 10, 10, 10, 10, 10, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:28:27,778 INFO L410 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:28:27,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:28:27,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1752886099, now seen corresponding path program 1 times [2019-11-15 22:28:27,778 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:28:27,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500980663] [2019-11-15 22:28:27,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:27,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:27,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:28:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:28,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2831 backedges. 1200 proven. 0 refuted. 0 times theorem prover too weak. 1631 trivial. 0 not checked. [2019-11-15 22:28:28,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500980663] [2019-11-15 22:28:28,024 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:28:28,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:28:28,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047534162] [2019-11-15 22:28:28,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:28:28,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:28:28,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:28:28,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:28:28,026 INFO L87 Difference]: Start difference. First operand 25409 states and 40236 transitions. Second operand 4 states. [2019-11-15 22:28:29,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:28:29,135 INFO L93 Difference]: Finished difference Result 51384 states and 81302 transitions. [2019-11-15 22:28:29,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:28:29,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 536 [2019-11-15 22:28:29,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:28:29,161 INFO L225 Difference]: With dead ends: 51384 [2019-11-15 22:28:29,161 INFO L226 Difference]: Without dead ends: 25994 [2019-11-15 22:28:29,173 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:28:29,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25994 states. [2019-11-15 22:28:30,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25994 to 25409. [2019-11-15 22:28:30,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25409 states. [2019-11-15 22:28:30,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25409 states to 25409 states and 40197 transitions. [2019-11-15 22:28:30,034 INFO L78 Accepts]: Start accepts. Automaton has 25409 states and 40197 transitions. Word has length 536 [2019-11-15 22:28:30,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:28:30,035 INFO L462 AbstractCegarLoop]: Abstraction has 25409 states and 40197 transitions. [2019-11-15 22:28:30,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:28:30,035 INFO L276 IsEmpty]: Start isEmpty. Operand 25409 states and 40197 transitions. [2019-11-15 22:28:30,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2019-11-15 22:28:30,055 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:28:30,056 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 12, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:28:30,056 INFO L410 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:28:30,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:28:30,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1526796056, now seen corresponding path program 1 times [2019-11-15 22:28:30,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:28:30,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230538899] [2019-11-15 22:28:30,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:30,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:30,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:28:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:30,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2690 backedges. 711 proven. 0 refuted. 0 times theorem prover too weak. 1979 trivial. 0 not checked. [2019-11-15 22:28:30,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230538899] [2019-11-15 22:28:30,255 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:28:30,255 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:28:30,255 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582119580] [2019-11-15 22:28:30,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:28:30,256 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:28:30,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:28:30,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:28:30,256 INFO L87 Difference]: Start difference. First operand 25409 states and 40197 transitions. Second operand 4 states. [2019-11-15 22:28:31,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:28:31,761 INFO L93 Difference]: Finished difference Result 42083 states and 66191 transitions. [2019-11-15 22:28:31,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:28:31,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 537 [2019-11-15 22:28:31,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:28:31,792 INFO L225 Difference]: With dead ends: 42083 [2019-11-15 22:28:31,792 INFO L226 Difference]: Without dead ends: 29062 [2019-11-15 22:28:31,802 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:28:31,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29062 states. [2019-11-15 22:28:32,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29062 to 25409. [2019-11-15 22:28:32,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25409 states. [2019-11-15 22:28:32,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25409 states to 25409 states and 40145 transitions. [2019-11-15 22:28:32,648 INFO L78 Accepts]: Start accepts. Automaton has 25409 states and 40145 transitions. Word has length 537 [2019-11-15 22:28:32,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:28:32,648 INFO L462 AbstractCegarLoop]: Abstraction has 25409 states and 40145 transitions. [2019-11-15 22:28:32,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:28:32,649 INFO L276 IsEmpty]: Start isEmpty. Operand 25409 states and 40145 transitions. [2019-11-15 22:28:32,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2019-11-15 22:28:32,669 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:28:32,670 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:28:32,670 INFO L410 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:28:32,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:28:32,670 INFO L82 PathProgramCache]: Analyzing trace with hash -330054603, now seen corresponding path program 1 times [2019-11-15 22:28:32,671 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:28:32,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566348789] [2019-11-15 22:28:32,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:32,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:32,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:28:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:33,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 1271 proven. 0 refuted. 0 times theorem prover too weak. 1417 trivial. 0 not checked. [2019-11-15 22:28:33,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566348789] [2019-11-15 22:28:33,080 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:28:33,080 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:28:33,081 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424692514] [2019-11-15 22:28:33,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:28:33,082 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:28:33,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:28:33,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:28:33,082 INFO L87 Difference]: Start difference. First operand 25409 states and 40145 transitions. Second operand 5 states. [2019-11-15 22:28:34,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:28:34,705 INFO L93 Difference]: Finished difference Result 54634 states and 85726 transitions. [2019-11-15 22:28:34,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:28:34,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 537 [2019-11-15 22:28:34,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:28:34,733 INFO L225 Difference]: With dead ends: 54634 [2019-11-15 22:28:34,733 INFO L226 Difference]: Without dead ends: 29244 [2019-11-15 22:28:34,747 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:28:34,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29244 states. [2019-11-15 22:28:35,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29244 to 25435. [2019-11-15 22:28:35,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25435 states. [2019-11-15 22:28:35,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25435 states to 25435 states and 40015 transitions. [2019-11-15 22:28:35,744 INFO L78 Accepts]: Start accepts. Automaton has 25435 states and 40015 transitions. Word has length 537 [2019-11-15 22:28:35,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:28:35,744 INFO L462 AbstractCegarLoop]: Abstraction has 25435 states and 40015 transitions. [2019-11-15 22:28:35,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:28:35,745 INFO L276 IsEmpty]: Start isEmpty. Operand 25435 states and 40015 transitions. [2019-11-15 22:28:35,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2019-11-15 22:28:35,764 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:28:35,764 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 10, 9, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:28:35,765 INFO L410 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:28:35,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:28:35,765 INFO L82 PathProgramCache]: Analyzing trace with hash 742852320, now seen corresponding path program 1 times [2019-11-15 22:28:35,765 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:28:35,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44200142] [2019-11-15 22:28:35,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:35,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:35,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:28:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:37,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2893 backedges. 1251 proven. 258 refuted. 0 times theorem prover too weak. 1384 trivial. 0 not checked. [2019-11-15 22:28:37,956 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44200142] [2019-11-15 22:28:37,956 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570245447] [2019-11-15 22:28:37,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:28:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:38,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 1790 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:28:38,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:28:38,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:28:38,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:28:38,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:28:38,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:28:38,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 22:28:38,483 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_175|, |v_#memory_$Pointer$.offset_161|], 2=[|v_#memory_int_180|]} [2019-11-15 22:28:38,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-11-15 22:28:38,487 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:28:38,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:28:38,495 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2019-11-15 22:28:38,496 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:28:38,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:28:38,521 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:28:38,521 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 56 [2019-11-15 22:28:38,522 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:28:38,547 INFO L567 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2019-11-15 22:28:38,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:28:38,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:28:38,549 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:31 [2019-11-15 22:28:38,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:28:38,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:28:38,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:28:38,604 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 22:28:38,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:28:38,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:28:38,635 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:28:38,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 84 [2019-11-15 22:28:38,636 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:28:38,681 INFO L567 ElimStorePlain]: treesize reduction 34, result has 63.8 percent of original size [2019-11-15 22:28:38,682 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 22:28:38,682 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2019-11-15 22:28:38,834 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 22:28:38,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 22:28:38,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:28:38,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:28:38,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:28:38,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 22:28:39,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2893 backedges. 1373 proven. 0 refuted. 0 times theorem prover too weak. 1520 trivial. 0 not checked. [2019-11-15 22:28:39,086 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:28:39,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 24 [2019-11-15 22:28:39,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379044814] [2019-11-15 22:28:39,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:28:39,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:28:39,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:28:39,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-11-15 22:28:39,088 INFO L87 Difference]: Start difference. First operand 25435 states and 40015 transitions. Second operand 8 states. [2019-11-15 22:28:43,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:28:43,488 INFO L93 Difference]: Finished difference Result 65373 states and 102216 transitions. [2019-11-15 22:28:43,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:28:43,489 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 547 [2019-11-15 22:28:43,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:28:43,529 INFO L225 Difference]: With dead ends: 65373 [2019-11-15 22:28:43,530 INFO L226 Difference]: Without dead ends: 39957 [2019-11-15 22:28:43,545 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 545 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=128, Invalid=628, Unknown=0, NotChecked=0, Total=756 [2019-11-15 22:28:43,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39957 states. [2019-11-15 22:28:44,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39957 to 31635. [2019-11-15 22:28:44,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31635 states. [2019-11-15 22:28:44,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31635 states to 31635 states and 50635 transitions. [2019-11-15 22:28:44,746 INFO L78 Accepts]: Start accepts. Automaton has 31635 states and 50635 transitions. Word has length 547 [2019-11-15 22:28:44,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:28:44,747 INFO L462 AbstractCegarLoop]: Abstraction has 31635 states and 50635 transitions. [2019-11-15 22:28:44,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:28:44,747 INFO L276 IsEmpty]: Start isEmpty. Operand 31635 states and 50635 transitions. [2019-11-15 22:28:44,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2019-11-15 22:28:44,775 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:28:44,775 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 10, 9, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:28:44,975 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:28:44,976 INFO L410 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:28:44,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:28:44,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1237781896, now seen corresponding path program 1 times [2019-11-15 22:28:44,976 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:28:44,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037280629] [2019-11-15 22:28:44,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:44,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:44,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:28:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3098 backedges. 1425 proven. 0 refuted. 0 times theorem prover too weak. 1673 trivial. 0 not checked. [2019-11-15 22:28:45,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037280629] [2019-11-15 22:28:45,337 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:28:45,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:28:45,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416420259] [2019-11-15 22:28:45,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:28:45,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:28:45,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:28:45,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:28:45,339 INFO L87 Difference]: Start difference. First operand 31635 states and 50635 transitions. Second operand 4 states. [2019-11-15 22:28:47,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:28:47,198 INFO L93 Difference]: Finished difference Result 65903 states and 104689 transitions. [2019-11-15 22:28:47,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:28:47,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 561 [2019-11-15 22:28:47,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:28:47,234 INFO L225 Difference]: With dead ends: 65903 [2019-11-15 22:28:47,235 INFO L226 Difference]: Without dead ends: 34287 [2019-11-15 22:28:47,251 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:28:47,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34287 states. [2019-11-15 22:28:48,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34287 to 31583. [2019-11-15 22:28:48,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31583 states. [2019-11-15 22:28:48,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31583 states to 31583 states and 50531 transitions. [2019-11-15 22:28:48,201 INFO L78 Accepts]: Start accepts. Automaton has 31583 states and 50531 transitions. Word has length 561 [2019-11-15 22:28:48,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:28:48,202 INFO L462 AbstractCegarLoop]: Abstraction has 31583 states and 50531 transitions. [2019-11-15 22:28:48,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:28:48,202 INFO L276 IsEmpty]: Start isEmpty. Operand 31583 states and 50531 transitions. [2019-11-15 22:28:48,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2019-11-15 22:28:48,231 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:28:48,232 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:28:48,232 INFO L410 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:28:48,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:28:48,232 INFO L82 PathProgramCache]: Analyzing trace with hash -664815513, now seen corresponding path program 1 times [2019-11-15 22:28:48,233 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:28:48,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058824062] [2019-11-15 22:28:48,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:48,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:48,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:28:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:48,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2998 backedges. 1167 proven. 0 refuted. 0 times theorem prover too weak. 1831 trivial. 0 not checked. [2019-11-15 22:28:48,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058824062] [2019-11-15 22:28:48,578 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:28:48,578 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:28:48,579 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41868858] [2019-11-15 22:28:48,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:28:48,579 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:28:48,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:28:48,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:28:48,580 INFO L87 Difference]: Start difference. First operand 31583 states and 50531 transitions. Second operand 4 states. [2019-11-15 22:28:50,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:28:50,393 INFO L93 Difference]: Finished difference Result 50109 states and 79444 transitions. [2019-11-15 22:28:50,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:28:50,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 561 [2019-11-15 22:28:50,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:28:50,429 INFO L225 Difference]: With dead ends: 50109 [2019-11-15 22:28:50,429 INFO L226 Difference]: Without dead ends: 34235 [2019-11-15 22:28:50,440 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:28:50,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34235 states. [2019-11-15 22:28:51,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34235 to 31583. [2019-11-15 22:28:51,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31583 states. [2019-11-15 22:28:51,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31583 states to 31583 states and 50383 transitions. [2019-11-15 22:28:51,551 INFO L78 Accepts]: Start accepts. Automaton has 31583 states and 50383 transitions. Word has length 561 [2019-11-15 22:28:51,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:28:51,551 INFO L462 AbstractCegarLoop]: Abstraction has 31583 states and 50383 transitions. [2019-11-15 22:28:51,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:28:51,551 INFO L276 IsEmpty]: Start isEmpty. Operand 31583 states and 50383 transitions. [2019-11-15 22:28:51,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2019-11-15 22:28:51,579 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:28:51,580 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:28:51,580 INFO L410 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:28:51,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:28:51,580 INFO L82 PathProgramCache]: Analyzing trace with hash 2079775504, now seen corresponding path program 1 times [2019-11-15 22:28:51,580 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:28:51,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269882632] [2019-11-15 22:28:51,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:51,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:51,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:28:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:51,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3014 backedges. 1183 proven. 0 refuted. 0 times theorem prover too weak. 1831 trivial. 0 not checked. [2019-11-15 22:28:51,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269882632] [2019-11-15 22:28:51,900 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:28:51,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:28:51,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222910643] [2019-11-15 22:28:51,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:28:51,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:28:51,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:28:51,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:28:51,902 INFO L87 Difference]: Start difference. First operand 31583 states and 50383 transitions. Second operand 4 states. [2019-11-15 22:28:53,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:28:53,576 INFO L93 Difference]: Finished difference Result 50109 states and 79222 transitions. [2019-11-15 22:28:53,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:28:53,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 562 [2019-11-15 22:28:53,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:28:53,610 INFO L225 Difference]: With dead ends: 50109 [2019-11-15 22:28:53,610 INFO L226 Difference]: Without dead ends: 34235 [2019-11-15 22:28:53,623 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:28:53,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34235 states. [2019-11-15 22:28:54,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34235 to 31583. [2019-11-15 22:28:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31583 states. [2019-11-15 22:28:54,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31583 states to 31583 states and 50235 transitions. [2019-11-15 22:28:54,587 INFO L78 Accepts]: Start accepts. Automaton has 31583 states and 50235 transitions. Word has length 562 [2019-11-15 22:28:54,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:28:54,587 INFO L462 AbstractCegarLoop]: Abstraction has 31583 states and 50235 transitions. [2019-11-15 22:28:54,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:28:54,587 INFO L276 IsEmpty]: Start isEmpty. Operand 31583 states and 50235 transitions. [2019-11-15 22:28:54,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2019-11-15 22:28:54,616 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:28:54,616 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 10, 9, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:28:54,616 INFO L410 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:28:54,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:28:54,617 INFO L82 PathProgramCache]: Analyzing trace with hash 413638657, now seen corresponding path program 1 times [2019-11-15 22:28:54,617 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:28:54,617 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243705524] [2019-11-15 22:28:54,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:54,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:54,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:28:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:55,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3002 backedges. 1401 proven. 0 refuted. 0 times theorem prover too weak. 1601 trivial. 0 not checked. [2019-11-15 22:28:55,044 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243705524] [2019-11-15 22:28:55,044 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:28:55,045 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:28:55,045 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494877901] [2019-11-15 22:28:55,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:28:55,045 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:28:55,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:28:55,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:28:55,046 INFO L87 Difference]: Start difference. First operand 31583 states and 50235 transitions. Second operand 5 states. [2019-11-15 22:28:56,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:28:56,951 INFO L93 Difference]: Finished difference Result 66956 states and 105854 transitions. [2019-11-15 22:28:56,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:28:56,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 562 [2019-11-15 22:28:56,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:28:56,987 INFO L225 Difference]: With dead ends: 66956 [2019-11-15 22:28:56,987 INFO L226 Difference]: Without dead ends: 35392 [2019-11-15 22:28:56,995 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:28:57,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35392 states. [2019-11-15 22:28:57,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35392 to 31713. [2019-11-15 22:28:57,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31713 states. [2019-11-15 22:28:58,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31713 states to 31713 states and 50495 transitions. [2019-11-15 22:28:58,025 INFO L78 Accepts]: Start accepts. Automaton has 31713 states and 50495 transitions. Word has length 562 [2019-11-15 22:28:58,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:28:58,026 INFO L462 AbstractCegarLoop]: Abstraction has 31713 states and 50495 transitions. [2019-11-15 22:28:58,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:28:58,026 INFO L276 IsEmpty]: Start isEmpty. Operand 31713 states and 50495 transitions. [2019-11-15 22:28:58,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2019-11-15 22:28:58,054 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:28:58,055 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:28:58,055 INFO L410 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:28:58,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:28:58,055 INFO L82 PathProgramCache]: Analyzing trace with hash -633366366, now seen corresponding path program 1 times [2019-11-15 22:28:58,055 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:28:58,055 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131029545] [2019-11-15 22:28:58,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:58,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:58,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:28:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:58,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3030 backedges. 1199 proven. 0 refuted. 0 times theorem prover too weak. 1831 trivial. 0 not checked. [2019-11-15 22:28:58,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131029545] [2019-11-15 22:28:58,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:28:58,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:28:58,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760162130] [2019-11-15 22:28:58,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:28:58,322 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:28:58,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:28:58,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:28:58,322 INFO L87 Difference]: Start difference. First operand 31713 states and 50495 transitions. Second operand 4 states. [2019-11-15 22:29:00,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:00,068 INFO L93 Difference]: Finished difference Result 50304 states and 79390 transitions. [2019-11-15 22:29:00,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:29:00,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 563 [2019-11-15 22:29:00,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:00,102 INFO L225 Difference]: With dead ends: 50304 [2019-11-15 22:29:00,102 INFO L226 Difference]: Without dead ends: 34365 [2019-11-15 22:29:00,113 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:29:00,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34365 states. [2019-11-15 22:29:01,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34365 to 31713. [2019-11-15 22:29:01,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31713 states. [2019-11-15 22:29:01,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31713 states to 31713 states and 50347 transitions. [2019-11-15 22:29:01,188 INFO L78 Accepts]: Start accepts. Automaton has 31713 states and 50347 transitions. Word has length 563 [2019-11-15 22:29:01,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:01,188 INFO L462 AbstractCegarLoop]: Abstraction has 31713 states and 50347 transitions. [2019-11-15 22:29:01,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:29:01,188 INFO L276 IsEmpty]: Start isEmpty. Operand 31713 states and 50347 transitions. [2019-11-15 22:29:01,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2019-11-15 22:29:01,217 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:01,217 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:29:01,217 INFO L410 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:01,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:01,218 INFO L82 PathProgramCache]: Analyzing trace with hash -737535893, now seen corresponding path program 1 times [2019-11-15 22:29:01,218 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:01,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533886912] [2019-11-15 22:29:01,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:01,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:01,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:01,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 1215 proven. 0 refuted. 0 times theorem prover too weak. 1831 trivial. 0 not checked. [2019-11-15 22:29:01,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533886912] [2019-11-15 22:29:01,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:29:01,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:29:01,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95000525] [2019-11-15 22:29:01,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:29:01,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:29:01,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:29:01,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:29:01,496 INFO L87 Difference]: Start difference. First operand 31713 states and 50347 transitions. Second operand 4 states. [2019-11-15 22:29:03,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:03,347 INFO L93 Difference]: Finished difference Result 50174 states and 79012 transitions. [2019-11-15 22:29:03,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:29:03,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 564 [2019-11-15 22:29:03,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:03,380 INFO L225 Difference]: With dead ends: 50174 [2019-11-15 22:29:03,380 INFO L226 Difference]: Without dead ends: 34235 [2019-11-15 22:29:03,388 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:29:03,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34235 states. [2019-11-15 22:29:04,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34235 to 31713. [2019-11-15 22:29:04,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31713 states. [2019-11-15 22:29:04,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31713 states to 31713 states and 50199 transitions. [2019-11-15 22:29:04,482 INFO L78 Accepts]: Start accepts. Automaton has 31713 states and 50199 transitions. Word has length 564 [2019-11-15 22:29:04,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:04,482 INFO L462 AbstractCegarLoop]: Abstraction has 31713 states and 50199 transitions. [2019-11-15 22:29:04,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:29:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 31713 states and 50199 transitions. [2019-11-15 22:29:04,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2019-11-15 22:29:04,511 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:04,511 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:29:04,512 INFO L410 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:04,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:04,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1736652603, now seen corresponding path program 1 times [2019-11-15 22:29:04,512 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:04,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692863304] [2019-11-15 22:29:04,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:04,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:04,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:04,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:04,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 1329 proven. 0 refuted. 0 times theorem prover too weak. 1831 trivial. 0 not checked. [2019-11-15 22:29:04,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692863304] [2019-11-15 22:29:04,886 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:29:04,886 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:29:04,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49311846] [2019-11-15 22:29:04,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:29:04,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:29:04,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:29:04,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:29:04,887 INFO L87 Difference]: Start difference. First operand 31713 states and 50199 transitions. Second operand 4 states. [2019-11-15 22:29:06,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:06,964 INFO L93 Difference]: Finished difference Result 65929 states and 103661 transitions. [2019-11-15 22:29:06,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:29:06,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 568 [2019-11-15 22:29:06,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:06,999 INFO L225 Difference]: With dead ends: 65929 [2019-11-15 22:29:07,000 INFO L226 Difference]: Without dead ends: 34235 [2019-11-15 22:29:07,015 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:29:07,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34235 states. [2019-11-15 22:29:08,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34235 to 31713. [2019-11-15 22:29:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31713 states. [2019-11-15 22:29:08,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31713 states to 31713 states and 50051 transitions. [2019-11-15 22:29:08,103 INFO L78 Accepts]: Start accepts. Automaton has 31713 states and 50051 transitions. Word has length 568 [2019-11-15 22:29:08,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:08,103 INFO L462 AbstractCegarLoop]: Abstraction has 31713 states and 50051 transitions. [2019-11-15 22:29:08,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:29:08,104 INFO L276 IsEmpty]: Start isEmpty. Operand 31713 states and 50051 transitions. [2019-11-15 22:29:08,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2019-11-15 22:29:08,132 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:08,132 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 15, 15, 13, 13, 12, 12, 11, 11, 11, 11, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:29:08,133 INFO L410 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:08,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:08,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1867897585, now seen corresponding path program 1 times [2019-11-15 22:29:08,133 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:08,133 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463500803] [2019-11-15 22:29:08,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:08,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:08,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:08,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 1223 proven. 46 refuted. 0 times theorem prover too weak. 1917 trivial. 0 not checked. [2019-11-15 22:29:08,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463500803] [2019-11-15 22:29:08,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908154909] [2019-11-15 22:29:08,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:29:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:09,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 1858 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 22:29:09,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:29:09,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-15 22:29:09,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:29:09,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:29:09,077 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:29:09,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 22:29:09,090 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 22:29:09,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 22:29:09,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:29:09,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:29:09,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:29:09,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 22:29:09,113 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 22:29:09,113 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 22:29:09,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:29:09,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:29:09,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:29:09,115 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 22:29:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 1223 proven. 46 refuted. 0 times theorem prover too weak. 1917 trivial. 0 not checked. [2019-11-15 22:29:09,338 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:29:09,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-11-15 22:29:09,339 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000625356] [2019-11-15 22:29:09,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:29:09,340 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:29:09,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:29:09,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:29:09,340 INFO L87 Difference]: Start difference. First operand 31713 states and 50051 transitions. Second operand 9 states. [2019-11-15 22:29:12,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:12,429 INFO L93 Difference]: Finished difference Result 69322 states and 108390 transitions. [2019-11-15 22:29:12,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:29:12,430 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 568 [2019-11-15 22:29:12,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:12,468 INFO L225 Difference]: With dead ends: 69322 [2019-11-15 22:29:12,468 INFO L226 Difference]: Without dead ends: 37628 [2019-11-15 22:29:12,484 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 569 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:29:12,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37628 states. [2019-11-15 22:29:13,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37628 to 31817. [2019-11-15 22:29:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31817 states. [2019-11-15 22:29:13,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31817 states to 31817 states and 50103 transitions. [2019-11-15 22:29:13,616 INFO L78 Accepts]: Start accepts. Automaton has 31817 states and 50103 transitions. Word has length 568 [2019-11-15 22:29:13,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:13,616 INFO L462 AbstractCegarLoop]: Abstraction has 31817 states and 50103 transitions. [2019-11-15 22:29:13,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:29:13,617 INFO L276 IsEmpty]: Start isEmpty. Operand 31817 states and 50103 transitions. [2019-11-15 22:29:13,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2019-11-15 22:29:13,645 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:13,646 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 15, 14, 13, 13, 12, 12, 11, 11, 11, 11, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:29:13,846 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:29:13,846 INFO L410 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:13,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:13,847 INFO L82 PathProgramCache]: Analyzing trace with hash 893071644, now seen corresponding path program 1 times [2019-11-15 22:29:13,847 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:13,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162713875] [2019-11-15 22:29:13,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:13,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:13,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:14,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3174 backedges. 1343 proven. 0 refuted. 0 times theorem prover too weak. 1831 trivial. 0 not checked. [2019-11-15 22:29:14,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162713875] [2019-11-15 22:29:14,128 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:29:14,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:29:14,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172956498] [2019-11-15 22:29:14,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:29:14,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:29:14,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:29:14,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:29:14,129 INFO L87 Difference]: Start difference. First operand 31817 states and 50103 transitions. Second operand 4 states. [2019-11-15 22:29:16,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:16,119 INFO L93 Difference]: Finished difference Result 65929 states and 103165 transitions. [2019-11-15 22:29:16,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:29:16,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 569 [2019-11-15 22:29:16,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:16,151 INFO L225 Difference]: With dead ends: 65929 [2019-11-15 22:29:16,151 INFO L226 Difference]: Without dead ends: 34131 [2019-11-15 22:29:16,161 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:29:16,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34131 states. [2019-11-15 22:29:17,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34131 to 31817. [2019-11-15 22:29:17,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31817 states. [2019-11-15 22:29:17,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31817 states to 31817 states and 49955 transitions. [2019-11-15 22:29:17,263 INFO L78 Accepts]: Start accepts. Automaton has 31817 states and 49955 transitions. Word has length 569 [2019-11-15 22:29:17,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:17,264 INFO L462 AbstractCegarLoop]: Abstraction has 31817 states and 49955 transitions. [2019-11-15 22:29:17,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:29:17,264 INFO L276 IsEmpty]: Start isEmpty. Operand 31817 states and 49955 transitions. [2019-11-15 22:29:17,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2019-11-15 22:29:17,293 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:17,293 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:29:17,293 INFO L410 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:17,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:17,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1355986956, now seen corresponding path program 1 times [2019-11-15 22:29:17,294 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:17,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536815961] [2019-11-15 22:29:17,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:17,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:17,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:19,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3279 backedges. 1596 proven. 542 refuted. 0 times theorem prover too weak. 1141 trivial. 0 not checked. [2019-11-15 22:29:19,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536815961] [2019-11-15 22:29:19,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23885354] [2019-11-15 22:29:19,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:29:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:19,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 1869 conjuncts, 59 conjunts are in the unsatisfiable core [2019-11-15 22:29:19,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:29:19,652 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-15 22:29:19,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:29:19,661 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:29:19,661 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:29:19,662 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:8 [2019-11-15 22:29:19,689 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:29:19,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:29:19,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:29:19,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:29:19,694 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-15 22:29:19,799 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_177|, |v_#memory_$Pointer$.offset_163|], 12=[|v_#memory_int_184|]} [2019-11-15 22:29:19,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:29:19,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2019-11-15 22:29:19,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:29:19,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:29:19,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:29:19,823 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2019-11-15 22:29:19,823 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:29:19,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:29:19,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:29:19,891 INFO L341 Elim1Store]: treesize reduction 70, result has 52.7 percent of original size [2019-11-15 22:29:19,891 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 102 [2019-11-15 22:29:19,892 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:29:19,923 INFO L567 ElimStorePlain]: treesize reduction 52, result has 62.3 percent of original size [2019-11-15 22:29:19,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:29:19,923 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:91, output treesize:86 [2019-11-15 22:29:21,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,218 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_178|, |v_#memory_$Pointer$.offset_164|], 20=[|v_#memory_int_185|]} [2019-11-15 22:29:21,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:29:21,230 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 105 [2019-11-15 22:29:21,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:29:21,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:29:21,243 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 97 [2019-11-15 22:29:21,243 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:29:21,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:29:21,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:29:21,316 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 80 [2019-11-15 22:29:21,317 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:29:21,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:29:21,324 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 84 [2019-11-15 22:29:21,325 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:29:21,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:29:21,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:29:21,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:29:21,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:29:21,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:29:21,424 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:29:21,424 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 132 [2019-11-15 22:29:21,425 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 22:29:21,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:29:21,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:29:21,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:29:21,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 74 [2019-11-15 22:29:21,437 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 22:29:21,473 INFO L567 ElimStorePlain]: treesize reduction 123, result has 29.7 percent of original size [2019-11-15 22:29:21,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:29:21,473 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:241, output treesize:52 [2019-11-15 22:29:21,518 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_179|, |v_#memory_$Pointer$.offset_165|], 20=[|v_#memory_int_186|]} [2019-11-15 22:29:21,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:29:21,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2019-11-15 22:29:21,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:29:21,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:29:21,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:29:21,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2019-11-15 22:29:21,547 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:29:21,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:29:21,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:29:21,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:29:21,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:29:21,603 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:29:21,604 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 62 treesize of output 215 [2019-11-15 22:29:21,605 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:29:21,643 INFO L567 ElimStorePlain]: treesize reduction 152, result has 25.5 percent of original size [2019-11-15 22:29:21,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:29:21,644 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:103, output treesize:52 [2019-11-15 22:29:21,651 INFO L392 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.offset_166|, |v_#memory_$Pointer$.base_180|], 20=[|v_#memory_int_187|]} [2019-11-15 22:29:21,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:29:21,769 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-11-15 22:29:21,770 INFO L341 Elim1Store]: treesize reduction 54, result has 74.3 percent of original size [2019-11-15 22:29:21,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 169 treesize of output 268 [2019-11-15 22:29:21,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:21,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:21,962 INFO L496 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-11-15 22:29:22,913 WARN L191 SmtUtils]: Spent 949.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 125 [2019-11-15 22:29:22,913 INFO L567 ElimStorePlain]: treesize reduction 504, result has 57.6 percent of original size [2019-11-15 22:29:22,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:29:23,073 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-11-15 22:29:23,074 INFO L341 Elim1Store]: treesize reduction 40, result has 78.5 percent of original size [2019-11-15 22:29:23,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 172 treesize of output 255 [2019-11-15 22:29:23,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:23,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:23,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:23,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:23,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:23,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:23,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:23,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:23,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:23,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:23,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:23,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:23,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:23,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:23,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:23,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:23,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:23,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:23,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:29:23,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:29:23,206 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-15 22:29:23,413 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:29:23,414 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-11-15 22:29:23,420 INFO L168 Benchmark]: Toolchain (without parser) took 166057.46 ms. Allocated memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: 3.9 GB). Free memory was 946.0 MB in the beginning and 1.3 GB in the end (delta: -393.5 MB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2019-11-15 22:29:23,420 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:29:23,420 INFO L168 Benchmark]: CACSL2BoogieTranslator took 993.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -164.7 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:29:23,422 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:29:23,422 INFO L168 Benchmark]: Boogie Preprocessor took 88.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:29:23,422 INFO L168 Benchmark]: RCFGBuilder took 1487.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.3 MB). Peak memory consumption was 96.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:29:23,423 INFO L168 Benchmark]: TraceAbstraction took 163381.51 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -338.7 MB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2019-11-15 22:29:23,426 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.28 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 993.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -164.7 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 100.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 88.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1487.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.3 MB). Peak memory consumption was 96.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 163381.51 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -338.7 MB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 22:29:25,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:29:25,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:29:25,846 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:29:25,847 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:29:25,848 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:29:25,849 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:29:25,854 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:29:25,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:29:25,857 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:29:25,858 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:29:25,859 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:29:25,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:29:25,860 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:29:25,861 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:29:25,862 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:29:25,863 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:29:25,864 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:29:25,866 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:29:25,868 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:29:25,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:29:25,876 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:29:25,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:29:25,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:29:25,884 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:29:25,884 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:29:25,884 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:29:25,885 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:29:25,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:29:25,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:29:25,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:29:25,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:29:25,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:29:25,889 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:29:25,890 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:29:25,890 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:29:25,891 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:29:25,891 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:29:25,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:29:25,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:29:25,893 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:29:25,894 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 22:29:25,909 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:29:25,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:29:25,911 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:29:25,912 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:29:25,912 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:29:25,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:29:25,913 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:29:25,913 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:29:25,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:29:25,913 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:29:25,914 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:29:25,914 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:29:25,914 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 22:29:25,914 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 22:29:25,915 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:29:25,915 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:29:25,915 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:29:25,915 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:29:25,916 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:29:25,916 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:29:25,916 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:29:25,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:29:25,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:29:25,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:29:25,917 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:29:25,917 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:29:25,918 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 22:29:25,918 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 22:29:25,918 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:29:25,918 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 22:29:25,919 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_f11436cf-0b1c-4ca7-919b-b4996ebbd018/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 -> bf350eece4e5f8a5f96c7b11a45bc95e4e002e5b [2019-11-15 22:29:25,955 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:29:25,967 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:29:25,971 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:29:25,972 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:29:25,973 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:29:25,973 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-1.c [2019-11-15 22:29:26,040 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/data/4c67688d6/e173fbe969bf4a63b25d72b5a6a16d08/FLAG258f6a1c8 [2019-11-15 22:29:26,597 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:29:26,598 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-1.c [2019-11-15 22:29:26,624 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/data/4c67688d6/e173fbe969bf4a63b25d72b5a6a16d08/FLAG258f6a1c8 [2019-11-15 22:29:26,792 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/data/4c67688d6/e173fbe969bf4a63b25d72b5a6a16d08 [2019-11-15 22:29:26,795 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:29:26,796 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:29:26,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:29:26,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:29:26,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:29:26,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:29:26" (1/1) ... [2019-11-15 22:29:26,805 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40707d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:29:26, skipping insertion in model container [2019-11-15 22:29:26,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:29:26" (1/1) ... [2019-11-15 22:29:26,814 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:29:26,870 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:29:27,542 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:29:27,560 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:29:27,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:29:27,743 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:29:27,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:29:27 WrapperNode [2019-11-15 22:29:27,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:29:27,745 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:29:27,745 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:29:27,745 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:29:27,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:29:27" (1/1) ... [2019-11-15 22:29:27,812 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:29:27" (1/1) ... [2019-11-15 22:29:27,869 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:29:27,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:29:27,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:29:27,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:29:27,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:29:27" (1/1) ... [2019-11-15 22:29:27,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:29:27" (1/1) ... [2019-11-15 22:29:27,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:29:27" (1/1) ... [2019-11-15 22:29:27,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:29:27" (1/1) ... [2019-11-15 22:29:27,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:29:27" (1/1) ... [2019-11-15 22:29:27,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:29:27" (1/1) ... [2019-11-15 22:29:27,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:29:27" (1/1) ... [2019-11-15 22:29:27,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:29:27,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:29:27,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:29:27,968 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:29:27,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:29:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:29:28,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:29:28,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:29:28,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 22:29:28,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:29:28,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:29:28,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:29:28,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:29:28,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 22:29:28,409 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 22:29:32,320 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 22:29:32,321 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 22:29:32,322 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:29:32,322 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:29:32,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:29:32 BoogieIcfgContainer [2019-11-15 22:29:32,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:29:32,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:29:32,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:29:32,328 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:29:32,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:29:26" (1/3) ... [2019-11-15 22:29:32,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5eebde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:29:32, skipping insertion in model container [2019-11-15 22:29:32,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:29:27" (2/3) ... [2019-11-15 22:29:32,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5eebde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:29:32, skipping insertion in model container [2019-11-15 22:29:32,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:29:32" (3/3) ... [2019-11-15 22:29:32,331 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.14.i.cil-1.c [2019-11-15 22:29:32,339 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:29:32,348 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:29:32,358 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:29:32,382 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:29:32,383 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:29:32,383 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:29:32,383 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:29:32,383 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:29:32,384 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:29:32,384 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:29:32,384 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:29:32,402 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-11-15 22:29:32,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 22:29:32,411 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:32,412 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:29:32,414 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:32,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:32,419 INFO L82 PathProgramCache]: Analyzing trace with hash 102131601, now seen corresponding path program 1 times [2019-11-15 22:29:32,429 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:29:32,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1520199030] [2019-11-15 22:29:32,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:29:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:32,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:29:32,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:29:32,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:29:32,709 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:29:32,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:29:32,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1520199030] [2019-11-15 22:29:32,747 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:29:32,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:29:32,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582170943] [2019-11-15 22:29:32,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:29:32,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:29:32,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:29:32,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:29:32,771 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 4 states. [2019-11-15 22:29:33,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:33,123 INFO L93 Difference]: Finished difference Result 584 states and 1005 transitions. [2019-11-15 22:29:33,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:29:33,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-11-15 22:29:33,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:33,155 INFO L225 Difference]: With dead ends: 584 [2019-11-15 22:29:33,155 INFO L226 Difference]: Without dead ends: 399 [2019-11-15 22:29:33,160 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:29:33,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-11-15 22:29:33,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2019-11-15 22:29:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-11-15 22:29:33,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 611 transitions. [2019-11-15 22:29:33,283 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 611 transitions. Word has length 43 [2019-11-15 22:29:33,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:33,283 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 611 transitions. [2019-11-15 22:29:33,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:29:33,284 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 611 transitions. [2019-11-15 22:29:33,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-15 22:29:33,291 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:33,292 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:29:33,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:29:33,495 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:33,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:33,495 INFO L82 PathProgramCache]: Analyzing trace with hash -416969103, now seen corresponding path program 1 times [2019-11-15 22:29:33,496 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:29:33,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [498275447] [2019-11-15 22:29:33,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:29:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:33,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:29:33,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:29:33,836 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:29:33,837 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:29:33,882 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:29:33,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [498275447] [2019-11-15 22:29:33,883 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:29:33,884 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:29:33,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471034872] [2019-11-15 22:29:33,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:29:33,889 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:29:33,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:29:33,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:29:33,890 INFO L87 Difference]: Start difference. First operand 399 states and 611 transitions. Second operand 4 states. [2019-11-15 22:29:34,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:34,698 INFO L93 Difference]: Finished difference Result 916 states and 1425 transitions. [2019-11-15 22:29:34,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:29:34,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-15 22:29:34,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:34,705 INFO L225 Difference]: With dead ends: 916 [2019-11-15 22:29:34,705 INFO L226 Difference]: Without dead ends: 655 [2019-11-15 22:29:34,712 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:29:34,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-11-15 22:29:34,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2019-11-15 22:29:34,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-11-15 22:29:34,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 998 transitions. [2019-11-15 22:29:34,777 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 998 transitions. Word has length 104 [2019-11-15 22:29:34,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:34,778 INFO L462 AbstractCegarLoop]: Abstraction has 655 states and 998 transitions. [2019-11-15 22:29:34,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:29:34,778 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 998 transitions. [2019-11-15 22:29:34,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-15 22:29:34,785 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:34,786 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:29:34,989 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:29:34,990 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:34,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:34,990 INFO L82 PathProgramCache]: Analyzing trace with hash 902985072, now seen corresponding path program 1 times [2019-11-15 22:29:34,992 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:29:34,992 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [993264072] [2019-11-15 22:29:34,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:29:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:35,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:29:35,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:29:35,415 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-15 22:29:35,416 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:29:35,479 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-15 22:29:35,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [993264072] [2019-11-15 22:29:35,489 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:29:35,490 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:29:35,490 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137993319] [2019-11-15 22:29:35,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:29:35,491 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:29:35,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:29:35,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:29:35,493 INFO L87 Difference]: Start difference. First operand 655 states and 998 transitions. Second operand 4 states. [2019-11-15 22:29:37,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:37,048 INFO L93 Difference]: Finished difference Result 1431 states and 2202 transitions. [2019-11-15 22:29:37,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:29:37,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-11-15 22:29:37,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:37,056 INFO L225 Difference]: With dead ends: 1431 [2019-11-15 22:29:37,056 INFO L226 Difference]: Without dead ends: 914 [2019-11-15 22:29:37,059 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:29:37,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-11-15 22:29:37,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 914. [2019-11-15 22:29:37,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-11-15 22:29:37,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1388 transitions. [2019-11-15 22:29:37,114 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1388 transitions. Word has length 168 [2019-11-15 22:29:37,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:37,115 INFO L462 AbstractCegarLoop]: Abstraction has 914 states and 1388 transitions. [2019-11-15 22:29:37,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:29:37,116 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1388 transitions. [2019-11-15 22:29:37,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-15 22:29:37,121 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:37,121 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:29:37,324 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:29:37,325 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:37,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:37,325 INFO L82 PathProgramCache]: Analyzing trace with hash -831983101, now seen corresponding path program 1 times [2019-11-15 22:29:37,327 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:29:37,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [751789513] [2019-11-15 22:29:37,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:29:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:37,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:29:37,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:29:37,799 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-11-15 22:29:37,800 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:29:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-11-15 22:29:37,874 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [751789513] [2019-11-15 22:29:37,874 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:29:37,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:29:37,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328691279] [2019-11-15 22:29:37,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:29:37,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:29:37,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:29:37,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:29:37,877 INFO L87 Difference]: Start difference. First operand 914 states and 1388 transitions. Second operand 4 states. [2019-11-15 22:29:39,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:39,181 INFO L93 Difference]: Finished difference Result 1947 states and 2977 transitions. [2019-11-15 22:29:39,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:29:39,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-11-15 22:29:39,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:39,193 INFO L225 Difference]: With dead ends: 1947 [2019-11-15 22:29:39,194 INFO L226 Difference]: Without dead ends: 1171 [2019-11-15 22:29:39,196 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:29:39,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2019-11-15 22:29:39,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1171. [2019-11-15 22:29:39,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171 states. [2019-11-15 22:29:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1773 transitions. [2019-11-15 22:29:39,283 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1773 transitions. Word has length 232 [2019-11-15 22:29:39,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:39,286 INFO L462 AbstractCegarLoop]: Abstraction has 1171 states and 1773 transitions. [2019-11-15 22:29:39,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:29:39,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1773 transitions. [2019-11-15 22:29:39,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-11-15 22:29:39,293 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:39,294 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:29:39,496 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:29:39,496 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:39,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:39,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1880300915, now seen corresponding path program 1 times [2019-11-15 22:29:39,498 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:29:39,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [586931078] [2019-11-15 22:29:39,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:29:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:39,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:29:39,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:29:40,015 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2019-11-15 22:29:40,015 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:29:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2019-11-15 22:29:40,100 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [586931078] [2019-11-15 22:29:40,100 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:29:40,101 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:29:40,101 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344014476] [2019-11-15 22:29:40,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:29:40,102 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:29:40,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:29:40,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:29:40,103 INFO L87 Difference]: Start difference. First operand 1171 states and 1773 transitions. Second operand 4 states. [2019-11-15 22:29:42,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:42,365 INFO L93 Difference]: Finished difference Result 2461 states and 3745 transitions. [2019-11-15 22:29:42,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:29:42,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 304 [2019-11-15 22:29:42,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:42,378 INFO L225 Difference]: With dead ends: 2461 [2019-11-15 22:29:42,378 INFO L226 Difference]: Without dead ends: 1428 [2019-11-15 22:29:42,380 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 604 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:29:42,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-11-15 22:29:42,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2019-11-15 22:29:42,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-11-15 22:29:42,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 2156 transitions. [2019-11-15 22:29:42,452 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 2156 transitions. Word has length 304 [2019-11-15 22:29:42,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:42,453 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 2156 transitions. [2019-11-15 22:29:42,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:29:42,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 2156 transitions. [2019-11-15 22:29:42,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-11-15 22:29:42,462 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:42,463 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:29:42,675 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:29:42,675 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:42,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:42,675 INFO L82 PathProgramCache]: Analyzing trace with hash 634373986, now seen corresponding path program 1 times [2019-11-15 22:29:42,677 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:29:42,677 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1156431262] [2019-11-15 22:29:42,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:29:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:43,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:29:43,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:29:43,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1237 backedges. 725 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-11-15 22:29:43,332 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:29:43,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1237 backedges. 725 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-11-15 22:29:43,458 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1156431262] [2019-11-15 22:29:43,459 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:29:43,460 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:29:43,466 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816432709] [2019-11-15 22:29:43,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:29:43,472 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:29:43,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:29:43,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:29:43,474 INFO L87 Difference]: Start difference. First operand 1428 states and 2156 transitions. Second operand 4 states. [2019-11-15 22:29:45,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:45,203 INFO L93 Difference]: Finished difference Result 2973 states and 4506 transitions. [2019-11-15 22:29:45,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:29:45,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 376 [2019-11-15 22:29:45,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:45,215 INFO L225 Difference]: With dead ends: 2973 [2019-11-15 22:29:45,215 INFO L226 Difference]: Without dead ends: 1683 [2019-11-15 22:29:45,218 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 750 GetRequests, 748 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:29:45,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2019-11-15 22:29:45,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1683. [2019-11-15 22:29:45,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1683 states. [2019-11-15 22:29:45,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2535 transitions. [2019-11-15 22:29:45,302 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2535 transitions. Word has length 376 [2019-11-15 22:29:45,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:45,303 INFO L462 AbstractCegarLoop]: Abstraction has 1683 states and 2535 transitions. [2019-11-15 22:29:45,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:29:45,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2535 transitions. [2019-11-15 22:29:45,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-11-15 22:29:45,315 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:45,315 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:29:45,525 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:29:45,526 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:45,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:45,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1806126364, now seen corresponding path program 1 times [2019-11-15 22:29:45,527 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:29:45,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [572104756] [2019-11-15 22:29:45,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:29:46,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:46,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:29:46,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:29:46,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1826 backedges. 1041 proven. 0 refuted. 0 times theorem prover too weak. 785 trivial. 0 not checked. [2019-11-15 22:29:46,222 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:29:46,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1826 backedges. 1041 proven. 0 refuted. 0 times theorem prover too weak. 785 trivial. 0 not checked. [2019-11-15 22:29:46,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [572104756] [2019-11-15 22:29:46,380 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:29:46,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:29:46,381 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055106802] [2019-11-15 22:29:46,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:29:46,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:29:46,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:29:46,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:29:46,383 INFO L87 Difference]: Start difference. First operand 1683 states and 2535 transitions. Second operand 4 states. [2019-11-15 22:29:47,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:47,265 INFO L93 Difference]: Finished difference Result 3484 states and 5264 transitions. [2019-11-15 22:29:47,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:29:47,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 447 [2019-11-15 22:29:47,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:47,278 INFO L225 Difference]: With dead ends: 3484 [2019-11-15 22:29:47,278 INFO L226 Difference]: Without dead ends: 1939 [2019-11-15 22:29:47,281 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 892 GetRequests, 890 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:29:47,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-11-15 22:29:47,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1939. [2019-11-15 22:29:47,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2019-11-15 22:29:47,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2913 transitions. [2019-11-15 22:29:47,364 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 2913 transitions. Word has length 447 [2019-11-15 22:29:47,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:47,365 INFO L462 AbstractCegarLoop]: Abstraction has 1939 states and 2913 transitions. [2019-11-15 22:29:47,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:29:47,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2913 transitions. [2019-11-15 22:29:47,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2019-11-15 22:29:47,378 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:47,378 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:29:47,592 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:29:47,592 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:47,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:47,593 INFO L82 PathProgramCache]: Analyzing trace with hash 107992195, now seen corresponding path program 1 times [2019-11-15 22:29:47,594 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:29:47,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2082634407] [2019-11-15 22:29:47,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:29:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:48,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:29:48,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:29:48,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2169 backedges. 1176 proven. 0 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2019-11-15 22:29:48,343 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:29:48,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2169 backedges. 1176 proven. 0 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2019-11-15 22:29:48,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2082634407] [2019-11-15 22:29:48,561 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:29:48,561 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:29:48,561 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40562411] [2019-11-15 22:29:48,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:29:48,563 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:29:48,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:29:48,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:29:48,563 INFO L87 Difference]: Start difference. First operand 1939 states and 2913 transitions. Second operand 4 states. [2019-11-15 22:29:49,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:49,675 INFO L93 Difference]: Finished difference Result 4000 states and 6023 transitions. [2019-11-15 22:29:49,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:29:49,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 484 [2019-11-15 22:29:49,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:29:49,693 INFO L225 Difference]: With dead ends: 4000 [2019-11-15 22:29:49,693 INFO L226 Difference]: Without dead ends: 2199 [2019-11-15 22:29:49,696 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 966 GetRequests, 964 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:29:49,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2199 states. [2019-11-15 22:29:49,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2199 to 2199. [2019-11-15 22:29:49,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2199 states. [2019-11-15 22:29:49,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2199 states to 2199 states and 3294 transitions. [2019-11-15 22:29:49,796 INFO L78 Accepts]: Start accepts. Automaton has 2199 states and 3294 transitions. Word has length 484 [2019-11-15 22:29:49,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:29:49,797 INFO L462 AbstractCegarLoop]: Abstraction has 2199 states and 3294 transitions. [2019-11-15 22:29:49,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:29:49,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2199 states and 3294 transitions. [2019-11-15 22:29:49,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-11-15 22:29:49,804 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:29:49,805 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:29:50,017 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:29:50,018 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:29:50,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:50,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1303580694, now seen corresponding path program 1 times [2019-11-15 22:29:50,019 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:29:50,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [52703043] [2019-11-15 22:29:50,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:29:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:56,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:29:56,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:29:56,701 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:29:56,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:29:56,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:29:56,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:29:56,713 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-15 22:29:56,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:29:56,749 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 22:29:56,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:29:56,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:29:56,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:29:56,763 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-15 22:29:56,802 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:29:56,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:29:56,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:29:56,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:29:56,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:29:56,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:5 [2019-11-15 22:29:57,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 1473 proven. 0 refuted. 0 times theorem prover too weak. 1055 trivial. 0 not checked. [2019-11-15 22:29:57,345 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:29:57,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 1473 proven. 0 refuted. 0 times theorem prover too weak. 1055 trivial. 0 not checked. [2019-11-15 22:29:57,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [52703043] [2019-11-15 22:29:57,637 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:29:57,637 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 8 [2019-11-15 22:29:57,639 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595515248] [2019-11-15 22:29:57,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:29:57,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:29:57,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:29:57,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:29:57,642 INFO L87 Difference]: Start difference. First operand 2199 states and 3294 transitions. Second operand 8 states. [2019-11-15 22:30:24,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:30:24,700 INFO L93 Difference]: Finished difference Result 9773 states and 14724 transitions. [2019-11-15 22:30:24,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:30:24,703 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 517 [2019-11-15 22:30:24,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:30:24,752 INFO L225 Difference]: With dead ends: 9773 [2019-11-15 22:30:24,752 INFO L226 Difference]: Without dead ends: 7582 [2019-11-15 22:30:24,757 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1037 GetRequests, 1026 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:30:24,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7582 states. [2019-11-15 22:30:24,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7582 to 2926. [2019-11-15 22:30:24,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2926 states. [2019-11-15 22:30:24,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 4616 transitions. [2019-11-15 22:30:24,971 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 4616 transitions. Word has length 517 [2019-11-15 22:30:24,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:30:24,972 INFO L462 AbstractCegarLoop]: Abstraction has 2926 states and 4616 transitions. [2019-11-15 22:30:24,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:30:24,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 4616 transitions. [2019-11-15 22:30:24,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-11-15 22:30:24,982 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:30:24,982 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:25,202 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:30:25,202 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:30:25,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:25,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1553035802, now seen corresponding path program 1 times [2019-11-15 22:30:25,204 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:30:25,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1692820323] [2019-11-15 22:30:25,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f11436cf-0b1c-4ca7-919b-b4996ebbd018/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:30:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:41,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-15 22:30:41,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:30:41,302 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-15 22:30:41,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:30:41,630 WARN L191 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-15 22:30:41,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:41,633 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_254|], 2=[|v_#memory_$Pointer$.base_249|, |v_#memory_$Pointer$.base_248|]} [2019-11-15 22:30:41,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:41,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:41,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:41,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:41,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:41,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:41,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 22:30:41,706 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:30:41,828 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-15 22:30:41,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:41,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:41,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:41,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:41,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:41,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:41,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:41,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 22:30:41,862 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:30:41,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:41,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:41,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:41,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:41,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:41,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:41,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:41,915 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 22:30:41,916 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:30:41,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:41,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:30:41,949 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:84, output treesize:14 [2019-11-15 22:30:41,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:41,975 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 22:30:41,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:30:41,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:41,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:30:41,985 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-11-15 22:30:41,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:41,995 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 22:30:41,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:30:42,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:42,009 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:30:42,009 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-11-15 22:30:42,022 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:30:42,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:42,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:42,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:42,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:42,063 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-11-15 22:30:42,063 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:30:42,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:42,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:30:42,074 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-11-15 22:30:42,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:42,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 22:30:42,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:30:42,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:42,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:30:42,094 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-11-15 22:30:42,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:42,103 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 22:30:42,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:30:42,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:42,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:30:42,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-11-15 22:30:42,127 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:30:42,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:42,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:42,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:42,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:42,154 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-11-15 22:30:42,154 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:30:42,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:42,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:30:42,164 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-11-15 22:30:42,170 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_249|], 2=[|v_#memory_$Pointer$.base_261|]} [2019-11-15 22:30:42,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-15 22:30:42,179 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:30:42,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:42,255 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:42,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2019-11-15 22:30:42,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:30:42,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:30:42,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:30:42,260 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 22:30:42,286 INFO L567 ElimStorePlain]: treesize reduction 52, result has 21.2 percent of original size [2019-11-15 22:30:42,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:30:42,287 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-11-15 22:30:42,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:42,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 22:30:42,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:30:42,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:42,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:42,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 22:30:42,332 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:30:42,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:42,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:30:42,340 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-11-15 22:30:42,346 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_250|], 2=[|v_#memory_$Pointer$.base_263|]} [2019-11-15 22:30:42,354 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-15 22:30:42,355 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:30:42,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:42,427 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:42,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2019-11-15 22:30:42,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:30:42,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:30:42,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:30:42,430 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 22:30:42,453 INFO L567 ElimStorePlain]: treesize reduction 52, result has 21.2 percent of original size [2019-11-15 22:30:42,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:30:42,453 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-11-15 22:30:42,456 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_248|, |v_#memory_int_270|], 2=[|v_#memory_$Pointer$.base_253|, |v_#memory_$Pointer$.base_264|]} [2019-11-15 22:30:42,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 97 [2019-11-15 22:30:42,462 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:30:42,590 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-15 22:30:42,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:42,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:42,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:42,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 34 [2019-11-15 22:30:42,610 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:30:42,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:42,645 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:30:42,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:42,667 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2019-11-15 22:30:42,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:42,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:30:42,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-11-15 22:30:42,679 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:30:42,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:42,687 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:30:42,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:42,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:30:42,705 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:142, output treesize:35 [2019-11-15 22:30:42,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2019-11-15 22:30:42,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:30:42,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:42,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:30:42,794 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2019-11-15 22:30:43,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 1071 proven. 91 refuted. 0 times theorem prover too weak. 1366 trivial. 0 not checked. [2019-11-15 22:30:43,293 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:30:43,350 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_248|, |#memory_int|], 2=[|v_#memory_$Pointer$.base_253|]} [2019-11-15 22:30:43,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2019-11-15 22:30:43,359 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:30:43,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:51,616 WARN L191 SmtUtils]: Spent 8.20 s on a formula simplification that was a NOOP. DAG size: 33 [2019-11-15 22:30:51,617 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:51,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 89 [2019-11-15 22:30:51,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:30:51,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:30:51,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:30:51,654 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:51,655 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 89 [2019-11-15 22:30:51,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:30:51,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:30:51,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:30:51,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:30:51,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:30:51,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:30:51,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:30:51,665 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:30:51,665 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimCell_30], 1=[v_arrayElimCell_31]} [2019-11-15 22:30:51,869 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:30:51,870 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 22:30:51,874 INFO L168 Benchmark]: Toolchain (without parser) took 85078.64 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 644.3 MB). Free memory was 940.3 MB in the beginning and 1.5 GB in the end (delta: -537.2 MB). Peak memory consumption was 107.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:30:51,874 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:30:51,875 INFO L168 Benchmark]: CACSL2BoogieTranslator took 947.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:30:51,875 INFO L168 Benchmark]: Boogie Procedure Inliner took 125.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:30:51,876 INFO L168 Benchmark]: Boogie Preprocessor took 84.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:30:51,876 INFO L168 Benchmark]: RCFGBuilder took 4367.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.3 MB). Peak memory consumption was 99.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:30:51,876 INFO L168 Benchmark]: TraceAbstraction took 79548.08 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 485.5 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -466.5 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:30:51,879 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 947.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 125.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 84.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4367.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.3 MB). Peak memory consumption was 99.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 79548.08 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 485.5 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -466.5 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...