./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.06.i.cil-2.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_c4b1e14d-5454-4612-8714-05bff9a2163e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.06.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/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 cc19bcc101ef1dd198c78f620192eb69b4a92f44 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_c4b1e14d-5454-4612-8714-05bff9a2163e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.06.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/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 cc19bcc101ef1dd198c78f620192eb69b4a92f44 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:21:00,094 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:21:00,095 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:21:00,110 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:21:00,111 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:21:00,112 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:21:00,113 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:21:00,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:21:00,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:21:00,132 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:21:00,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:21:00,135 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:21:00,135 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:21:00,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:21:00,138 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:21:00,139 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:21:00,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:21:00,141 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:21:00,143 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:21:00,146 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:21:00,150 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:21:00,151 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:21:00,154 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:21:00,155 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:21:00,158 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:21:00,159 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:21:00,159 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:21:00,160 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:21:00,161 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:21:00,162 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:21:00,162 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:21:00,162 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:21:00,163 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:21:00,164 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:21:00,165 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:21:00,165 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:21:00,166 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:21:00,166 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:21:00,166 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:21:00,167 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:21:00,168 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:21:00,169 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:21:00,192 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:21:00,202 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:21:00,203 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:21:00,203 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:21:00,204 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:21:00,204 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:21:00,204 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:21:00,205 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:21:00,205 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:21:00,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:21:00,205 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:21:00,206 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:21:00,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:21:00,207 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:21:00,207 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:21:00,207 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:21:00,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:21:00,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:21:00,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:21:00,208 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:21:00,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:21:00,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:21:00,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:21:00,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:21:00,210 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:21:00,210 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:21:00,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:21:00,210 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:21:00,211 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_c4b1e14d-5454-4612-8714-05bff9a2163e/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 -> cc19bcc101ef1dd198c78f620192eb69b4a92f44 [2019-11-15 22:21:00,242 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:21:00,250 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:21:00,256 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:21:00,258 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:21:00,258 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:21:00,259 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.06.i.cil-2.c [2019-11-15 22:21:00,326 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/bin/uautomizer/data/d1308f42e/dd3fde4ea1fa46f1b722b75a5619a250/FLAG172f50fe1 [2019-11-15 22:21:00,831 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:21:00,832 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/sv-benchmarks/c/ssh/s3_srvr.blast.06.i.cil-2.c [2019-11-15 22:21:00,859 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/bin/uautomizer/data/d1308f42e/dd3fde4ea1fa46f1b722b75a5619a250/FLAG172f50fe1 [2019-11-15 22:21:01,057 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/bin/uautomizer/data/d1308f42e/dd3fde4ea1fa46f1b722b75a5619a250 [2019-11-15 22:21:01,060 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:21:01,061 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:21:01,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:21:01,062 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:21:01,065 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:21:01,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:21:01" (1/1) ... [2019-11-15 22:21:01,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78dd31d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:21:01, skipping insertion in model container [2019-11-15 22:21:01,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:21:01" (1/1) ... [2019-11-15 22:21:01,076 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:21:01,157 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:21:01,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:21:01,769 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:21:01,940 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:21:01,963 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:21:01,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:21:01 WrapperNode [2019-11-15 22:21:01,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:21:01,965 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:21:01,966 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:21:01,966 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:21:01,974 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:21:01" (1/1) ... [2019-11-15 22:21:02,011 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:21:01" (1/1) ... [2019-11-15 22:21:02,075 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:21:02,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:21:02,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:21:02,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:21:02,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:21:01" (1/1) ... [2019-11-15 22:21:02,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:21:01" (1/1) ... [2019-11-15 22:21:02,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:21:01" (1/1) ... [2019-11-15 22:21:02,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:21:01" (1/1) ... [2019-11-15 22:21:02,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:21:01" (1/1) ... [2019-11-15 22:21:02,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:21:01" (1/1) ... [2019-11-15 22:21:02,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:21:01" (1/1) ... [2019-11-15 22:21:02,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:21:02,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:21:02,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:21:02,170 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:21:02,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:21:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/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:21:02,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:21:02,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:21:02,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:21:02,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:21:02,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:21:02,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:21:02,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:21:02,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:21:02,457 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 22:21:03,343 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 22:21:03,343 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 22:21:03,344 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:21:03,345 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:21:03,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:21:03 BoogieIcfgContainer [2019-11-15 22:21:03,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:21:03,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:21:03,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:21:03,353 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:21:03,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:21:01" (1/3) ... [2019-11-15 22:21:03,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49148784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:21:03, skipping insertion in model container [2019-11-15 22:21:03,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:21:01" (2/3) ... [2019-11-15 22:21:03,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49148784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:21:03, skipping insertion in model container [2019-11-15 22:21:03,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:21:03" (3/3) ... [2019-11-15 22:21:03,358 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.06.i.cil-2.c [2019-11-15 22:21:03,368 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:21:03,385 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:21:03,395 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:21:03,427 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:21:03,427 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:21:03,427 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:21:03,427 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:21:03,427 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:21:03,427 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:21:03,428 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:21:03,428 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:21:03,453 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2019-11-15 22:21:03,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 22:21:03,469 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:03,470 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:21:03,472 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:03,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:03,477 INFO L82 PathProgramCache]: Analyzing trace with hash -635828374, now seen corresponding path program 1 times [2019-11-15 22:21:03,485 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:03,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832593613] [2019-11-15 22:21:03,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:03,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:03,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:03,833 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:21:03,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832593613] [2019-11-15 22:21:03,834 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:03,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:03,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787852133] [2019-11-15 22:21:03,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:03,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:03,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:03,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:03,854 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 4 states. [2019-11-15 22:21:04,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:04,372 INFO L93 Difference]: Finished difference Result 347 states and 595 transitions. [2019-11-15 22:21:04,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:04,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-15 22:21:04,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:04,385 INFO L225 Difference]: With dead ends: 347 [2019-11-15 22:21:04,386 INFO L226 Difference]: Without dead ends: 175 [2019-11-15 22:21:04,389 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:21:04,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-15 22:21:04,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 158. [2019-11-15 22:21:04,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-15 22:21:04,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 250 transitions. [2019-11-15 22:21:04,433 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 250 transitions. Word has length 45 [2019-11-15 22:21:04,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:04,434 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 250 transitions. [2019-11-15 22:21:04,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:04,434 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 250 transitions. [2019-11-15 22:21:04,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 22:21:04,437 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:04,437 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, 1, 1] [2019-11-15 22:21:04,437 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:04,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:04,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1657614453, now seen corresponding path program 1 times [2019-11-15 22:21:04,438 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:04,438 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82561326] [2019-11-15 22:21:04,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:04,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:04,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:04,558 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:21:04,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82561326] [2019-11-15 22:21:04,559 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:04,559 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:04,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824192959] [2019-11-15 22:21:04,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:04,563 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:04,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:04,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:04,563 INFO L87 Difference]: Start difference. First operand 158 states and 250 transitions. Second operand 4 states. [2019-11-15 22:21:04,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:04,950 INFO L93 Difference]: Finished difference Result 314 states and 491 transitions. [2019-11-15 22:21:04,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:04,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-15 22:21:04,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:04,953 INFO L225 Difference]: With dead ends: 314 [2019-11-15 22:21:04,953 INFO L226 Difference]: Without dead ends: 175 [2019-11-15 22:21:04,954 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:21:04,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-15 22:21:04,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 158. [2019-11-15 22:21:04,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-15 22:21:04,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 249 transitions. [2019-11-15 22:21:04,977 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 249 transitions. Word has length 58 [2019-11-15 22:21:04,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:04,978 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 249 transitions. [2019-11-15 22:21:04,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:04,978 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 249 transitions. [2019-11-15 22:21:04,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 22:21:04,980 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:04,981 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, 1, 1] [2019-11-15 22:21:04,981 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:04,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:04,981 INFO L82 PathProgramCache]: Analyzing trace with hash 228250247, now seen corresponding path program 1 times [2019-11-15 22:21:04,982 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:04,982 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662433608] [2019-11-15 22:21:04,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:04,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:04,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:05,153 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:21:05,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662433608] [2019-11-15 22:21:05,154 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:05,154 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:05,154 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783262878] [2019-11-15 22:21:05,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:05,155 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:05,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:05,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:05,155 INFO L87 Difference]: Start difference. First operand 158 states and 249 transitions. Second operand 4 states. [2019-11-15 22:21:05,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:05,493 INFO L93 Difference]: Finished difference Result 313 states and 489 transitions. [2019-11-15 22:21:05,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:05,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 22:21:05,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:05,496 INFO L225 Difference]: With dead ends: 313 [2019-11-15 22:21:05,496 INFO L226 Difference]: Without dead ends: 174 [2019-11-15 22:21:05,497 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:21:05,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-15 22:21:05,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 158. [2019-11-15 22:21:05,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-15 22:21:05,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 248 transitions. [2019-11-15 22:21:05,507 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 248 transitions. Word has length 59 [2019-11-15 22:21:05,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:05,507 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 248 transitions. [2019-11-15 22:21:05,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:05,507 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 248 transitions. [2019-11-15 22:21:05,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 22:21:05,509 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:05,510 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, 1, 1] [2019-11-15 22:21:05,510 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:05,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:05,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1571443698, now seen corresponding path program 1 times [2019-11-15 22:21:05,510 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:05,510 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382952681] [2019-11-15 22:21:05,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:05,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:05,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:05,617 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:21:05,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382952681] [2019-11-15 22:21:05,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:05,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:05,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931650922] [2019-11-15 22:21:05,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:05,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:05,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:05,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:05,619 INFO L87 Difference]: Start difference. First operand 158 states and 248 transitions. Second operand 4 states. [2019-11-15 22:21:05,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:05,949 INFO L93 Difference]: Finished difference Result 311 states and 486 transitions. [2019-11-15 22:21:05,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:05,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 22:21:05,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:05,951 INFO L225 Difference]: With dead ends: 311 [2019-11-15 22:21:05,951 INFO L226 Difference]: Without dead ends: 172 [2019-11-15 22:21:05,952 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:21:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-15 22:21:05,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 158. [2019-11-15 22:21:05,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-15 22:21:05,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 247 transitions. [2019-11-15 22:21:05,960 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 247 transitions. Word has length 59 [2019-11-15 22:21:05,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:05,961 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 247 transitions. [2019-11-15 22:21:05,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:05,961 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 247 transitions. [2019-11-15 22:21:05,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 22:21:05,962 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:05,963 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, 1, 1] [2019-11-15 22:21:05,963 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:05,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:05,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1774175438, now seen corresponding path program 1 times [2019-11-15 22:21:05,963 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:05,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847761705] [2019-11-15 22:21:05,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:05,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:05,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:06,041 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:21:06,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847761705] [2019-11-15 22:21:06,043 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:06,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:06,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780853117] [2019-11-15 22:21:06,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:06,045 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:06,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:06,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:06,045 INFO L87 Difference]: Start difference. First operand 158 states and 247 transitions. Second operand 4 states. [2019-11-15 22:21:06,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:06,346 INFO L93 Difference]: Finished difference Result 310 states and 484 transitions. [2019-11-15 22:21:06,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:06,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 22:21:06,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:06,348 INFO L225 Difference]: With dead ends: 310 [2019-11-15 22:21:06,348 INFO L226 Difference]: Without dead ends: 171 [2019-11-15 22:21:06,349 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:21:06,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-11-15 22:21:06,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2019-11-15 22:21:06,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-15 22:21:06,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 246 transitions. [2019-11-15 22:21:06,356 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 246 transitions. Word has length 59 [2019-11-15 22:21:06,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:06,357 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 246 transitions. [2019-11-15 22:21:06,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:06,357 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 246 transitions. [2019-11-15 22:21:06,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 22:21:06,358 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:06,358 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, 1, 1] [2019-11-15 22:21:06,358 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:06,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:06,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1066261019, now seen corresponding path program 1 times [2019-11-15 22:21:06,359 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:06,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926464473] [2019-11-15 22:21:06,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:06,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:06,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:06,414 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:21:06,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926464473] [2019-11-15 22:21:06,414 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:06,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:06,415 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789262590] [2019-11-15 22:21:06,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:06,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:06,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:06,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:06,416 INFO L87 Difference]: Start difference. First operand 158 states and 246 transitions. Second operand 4 states. [2019-11-15 22:21:06,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:06,692 INFO L93 Difference]: Finished difference Result 310 states and 483 transitions. [2019-11-15 22:21:06,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:06,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 22:21:06,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:06,695 INFO L225 Difference]: With dead ends: 310 [2019-11-15 22:21:06,695 INFO L226 Difference]: Without dead ends: 171 [2019-11-15 22:21:06,696 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:21:06,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-11-15 22:21:06,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2019-11-15 22:21:06,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-15 22:21:06,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 245 transitions. [2019-11-15 22:21:06,701 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 245 transitions. Word has length 59 [2019-11-15 22:21:06,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:06,701 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 245 transitions. [2019-11-15 22:21:06,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:06,701 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 245 transitions. [2019-11-15 22:21:06,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 22:21:06,702 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:06,702 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, 1, 1] [2019-11-15 22:21:06,702 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:06,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:06,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1887195906, now seen corresponding path program 1 times [2019-11-15 22:21:06,703 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:06,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665767701] [2019-11-15 22:21:06,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:06,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:06,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:06,756 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:21:06,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665767701] [2019-11-15 22:21:06,756 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:06,756 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:06,756 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284719306] [2019-11-15 22:21:06,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:06,757 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:06,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:06,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:06,757 INFO L87 Difference]: Start difference. First operand 158 states and 245 transitions. Second operand 4 states. [2019-11-15 22:21:07,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:07,021 INFO L93 Difference]: Finished difference Result 310 states and 482 transitions. [2019-11-15 22:21:07,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:07,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-15 22:21:07,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:07,023 INFO L225 Difference]: With dead ends: 310 [2019-11-15 22:21:07,023 INFO L226 Difference]: Without dead ends: 171 [2019-11-15 22:21:07,024 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:21:07,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-11-15 22:21:07,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2019-11-15 22:21:07,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-15 22:21:07,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 244 transitions. [2019-11-15 22:21:07,029 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 244 transitions. Word has length 60 [2019-11-15 22:21:07,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:07,031 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 244 transitions. [2019-11-15 22:21:07,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:07,031 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 244 transitions. [2019-11-15 22:21:07,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 22:21:07,033 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:07,033 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, 1, 1] [2019-11-15 22:21:07,033 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:07,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:07,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1006123136, now seen corresponding path program 1 times [2019-11-15 22:21:07,034 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:07,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648264577] [2019-11-15 22:21:07,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:07,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:07,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:07,113 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:21:07,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648264577] [2019-11-15 22:21:07,113 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:07,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:07,114 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578640696] [2019-11-15 22:21:07,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:07,115 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:07,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:07,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:07,115 INFO L87 Difference]: Start difference. First operand 158 states and 244 transitions. Second operand 4 states. [2019-11-15 22:21:07,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:07,432 INFO L93 Difference]: Finished difference Result 310 states and 481 transitions. [2019-11-15 22:21:07,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:07,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-15 22:21:07,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:07,434 INFO L225 Difference]: With dead ends: 310 [2019-11-15 22:21:07,434 INFO L226 Difference]: Without dead ends: 171 [2019-11-15 22:21:07,435 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:21:07,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-11-15 22:21:07,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2019-11-15 22:21:07,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-15 22:21:07,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 243 transitions. [2019-11-15 22:21:07,439 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 243 transitions. Word has length 61 [2019-11-15 22:21:07,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:07,440 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 243 transitions. [2019-11-15 22:21:07,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:07,440 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 243 transitions. [2019-11-15 22:21:07,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-15 22:21:07,441 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:07,441 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, 1, 1] [2019-11-15 22:21:07,441 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:07,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:07,442 INFO L82 PathProgramCache]: Analyzing trace with hash 465903427, now seen corresponding path program 1 times [2019-11-15 22:21:07,442 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:07,442 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861905764] [2019-11-15 22:21:07,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:07,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:07,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:07,515 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:21:07,516 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861905764] [2019-11-15 22:21:07,516 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:07,516 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:07,516 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518297725] [2019-11-15 22:21:07,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:07,517 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:07,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:07,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:07,518 INFO L87 Difference]: Start difference. First operand 158 states and 243 transitions. Second operand 4 states. [2019-11-15 22:21:07,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:07,758 INFO L93 Difference]: Finished difference Result 300 states and 467 transitions. [2019-11-15 22:21:07,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:07,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-15 22:21:07,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:07,760 INFO L225 Difference]: With dead ends: 300 [2019-11-15 22:21:07,760 INFO L226 Difference]: Without dead ends: 161 [2019-11-15 22:21:07,760 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:21:07,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-15 22:21:07,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2019-11-15 22:21:07,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-15 22:21:07,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 242 transitions. [2019-11-15 22:21:07,765 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 242 transitions. Word has length 62 [2019-11-15 22:21:07,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:07,770 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 242 transitions. [2019-11-15 22:21:07,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:07,771 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 242 transitions. [2019-11-15 22:21:07,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-15 22:21:07,771 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:07,772 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, 1, 1] [2019-11-15 22:21:07,772 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:07,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:07,772 INFO L82 PathProgramCache]: Analyzing trace with hash 866054827, now seen corresponding path program 1 times [2019-11-15 22:21:07,773 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:07,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316616495] [2019-11-15 22:21:07,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:07,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:07,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:07,844 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:21:07,845 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316616495] [2019-11-15 22:21:07,845 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:07,845 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:07,845 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934905063] [2019-11-15 22:21:07,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:07,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:07,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:07,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:07,847 INFO L87 Difference]: Start difference. First operand 158 states and 242 transitions. Second operand 4 states. [2019-11-15 22:21:08,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:08,144 INFO L93 Difference]: Finished difference Result 340 states and 528 transitions. [2019-11-15 22:21:08,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:08,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-15 22:21:08,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:08,146 INFO L225 Difference]: With dead ends: 340 [2019-11-15 22:21:08,146 INFO L226 Difference]: Without dead ends: 201 [2019-11-15 22:21:08,147 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:21:08,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-11-15 22:21:08,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 180. [2019-11-15 22:21:08,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-15 22:21:08,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 280 transitions. [2019-11-15 22:21:08,153 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 280 transitions. Word has length 62 [2019-11-15 22:21:08,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:08,153 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 280 transitions. [2019-11-15 22:21:08,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:08,153 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 280 transitions. [2019-11-15 22:21:08,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 22:21:08,154 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:08,154 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, 1, 1] [2019-11-15 22:21:08,154 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:08,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:08,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1859234092, now seen corresponding path program 1 times [2019-11-15 22:21:08,155 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:08,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420281530] [2019-11-15 22:21:08,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:08,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:08,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:08,201 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:21:08,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420281530] [2019-11-15 22:21:08,202 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:08,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:08,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102411978] [2019-11-15 22:21:08,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:08,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:08,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:08,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:08,203 INFO L87 Difference]: Start difference. First operand 180 states and 280 transitions. Second operand 4 states. [2019-11-15 22:21:08,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:08,570 INFO L93 Difference]: Finished difference Result 362 states and 565 transitions. [2019-11-15 22:21:08,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:08,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-15 22:21:08,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:08,572 INFO L225 Difference]: With dead ends: 362 [2019-11-15 22:21:08,572 INFO L226 Difference]: Without dead ends: 201 [2019-11-15 22:21:08,573 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:21:08,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-11-15 22:21:08,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 180. [2019-11-15 22:21:08,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-15 22:21:08,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 279 transitions. [2019-11-15 22:21:08,579 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 279 transitions. Word has length 75 [2019-11-15 22:21:08,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:08,580 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 279 transitions. [2019-11-15 22:21:08,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:08,580 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 279 transitions. [2019-11-15 22:21:08,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 22:21:08,581 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:08,581 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, 1, 1] [2019-11-15 22:21:08,581 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:08,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:08,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1419872248, now seen corresponding path program 1 times [2019-11-15 22:21:08,585 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:08,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221826445] [2019-11-15 22:21:08,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:08,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:08,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:08,646 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:21:08,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221826445] [2019-11-15 22:21:08,647 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:08,647 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:08,647 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480551286] [2019-11-15 22:21:08,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:08,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:08,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:08,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:08,648 INFO L87 Difference]: Start difference. First operand 180 states and 279 transitions. Second operand 4 states. [2019-11-15 22:21:09,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:09,047 INFO L93 Difference]: Finished difference Result 361 states and 562 transitions. [2019-11-15 22:21:09,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:09,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 22:21:09,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:09,049 INFO L225 Difference]: With dead ends: 361 [2019-11-15 22:21:09,049 INFO L226 Difference]: Without dead ends: 200 [2019-11-15 22:21:09,050 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:21:09,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-11-15 22:21:09,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 180. [2019-11-15 22:21:09,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-15 22:21:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 278 transitions. [2019-11-15 22:21:09,056 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 278 transitions. Word has length 76 [2019-11-15 22:21:09,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:09,056 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 278 transitions. [2019-11-15 22:21:09,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:09,056 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 278 transitions. [2019-11-15 22:21:09,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 22:21:09,057 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:09,057 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, 1, 1] [2019-11-15 22:21:09,057 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:09,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:09,058 INFO L82 PathProgramCache]: Analyzing trace with hash -76678797, now seen corresponding path program 1 times [2019-11-15 22:21:09,058 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:09,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146834778] [2019-11-15 22:21:09,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:09,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:09,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:09,119 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:21:09,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146834778] [2019-11-15 22:21:09,120 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:09,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:09,120 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918643501] [2019-11-15 22:21:09,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:09,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:09,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:09,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:09,123 INFO L87 Difference]: Start difference. First operand 180 states and 278 transitions. Second operand 4 states. [2019-11-15 22:21:09,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:09,471 INFO L93 Difference]: Finished difference Result 359 states and 558 transitions. [2019-11-15 22:21:09,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:09,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 22:21:09,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:09,474 INFO L225 Difference]: With dead ends: 359 [2019-11-15 22:21:09,474 INFO L226 Difference]: Without dead ends: 198 [2019-11-15 22:21:09,474 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:21:09,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-15 22:21:09,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 180. [2019-11-15 22:21:09,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-15 22:21:09,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 277 transitions. [2019-11-15 22:21:09,481 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 277 transitions. Word has length 76 [2019-11-15 22:21:09,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:09,481 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 277 transitions. [2019-11-15 22:21:09,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:09,481 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 277 transitions. [2019-11-15 22:21:09,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 22:21:09,483 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:09,483 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, 1, 1] [2019-11-15 22:21:09,483 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:09,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:09,484 INFO L82 PathProgramCache]: Analyzing trace with hash 872669363, now seen corresponding path program 1 times [2019-11-15 22:21:09,484 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:09,484 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380035440] [2019-11-15 22:21:09,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:09,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:09,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:09,565 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:21:09,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380035440] [2019-11-15 22:21:09,566 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:09,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:09,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977164126] [2019-11-15 22:21:09,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:09,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:09,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:09,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:09,567 INFO L87 Difference]: Start difference. First operand 180 states and 277 transitions. Second operand 4 states. [2019-11-15 22:21:09,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:09,909 INFO L93 Difference]: Finished difference Result 358 states and 555 transitions. [2019-11-15 22:21:09,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:09,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 22:21:09,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:09,911 INFO L225 Difference]: With dead ends: 358 [2019-11-15 22:21:09,911 INFO L226 Difference]: Without dead ends: 197 [2019-11-15 22:21:09,911 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:21:09,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-15 22:21:09,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 180. [2019-11-15 22:21:09,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-15 22:21:09,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 276 transitions. [2019-11-15 22:21:09,917 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 276 transitions. Word has length 76 [2019-11-15 22:21:09,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:09,917 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 276 transitions. [2019-11-15 22:21:09,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:09,917 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 276 transitions. [2019-11-15 22:21:09,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 22:21:09,918 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:09,919 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, 1, 1] [2019-11-15 22:21:09,919 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:09,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:09,919 INFO L82 PathProgramCache]: Analyzing trace with hash -581861476, now seen corresponding path program 1 times [2019-11-15 22:21:09,920 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:09,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677840642] [2019-11-15 22:21:09,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:09,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:09,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:09,967 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:21:09,967 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677840642] [2019-11-15 22:21:09,967 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:09,968 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:09,968 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667987406] [2019-11-15 22:21:09,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:09,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:09,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:09,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:09,969 INFO L87 Difference]: Start difference. First operand 180 states and 276 transitions. Second operand 4 states. [2019-11-15 22:21:10,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:10,312 INFO L93 Difference]: Finished difference Result 358 states and 553 transitions. [2019-11-15 22:21:10,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:10,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 22:21:10,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:10,314 INFO L225 Difference]: With dead ends: 358 [2019-11-15 22:21:10,314 INFO L226 Difference]: Without dead ends: 197 [2019-11-15 22:21:10,315 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:21:10,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-15 22:21:10,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 180. [2019-11-15 22:21:10,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-15 22:21:10,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 275 transitions. [2019-11-15 22:21:10,321 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 275 transitions. Word has length 76 [2019-11-15 22:21:10,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:10,321 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 275 transitions. [2019-11-15 22:21:10,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:10,321 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 275 transitions. [2019-11-15 22:21:10,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-15 22:21:10,322 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:10,322 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, 1, 1] [2019-11-15 22:21:10,323 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:10,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:10,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1439385699, now seen corresponding path program 1 times [2019-11-15 22:21:10,323 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:10,323 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696984818] [2019-11-15 22:21:10,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:10,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:10,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:10,374 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:21:10,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696984818] [2019-11-15 22:21:10,376 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:10,376 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:10,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296898425] [2019-11-15 22:21:10,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:10,377 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:10,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:10,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:10,377 INFO L87 Difference]: Start difference. First operand 180 states and 275 transitions. Second operand 4 states. [2019-11-15 22:21:10,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:10,707 INFO L93 Difference]: Finished difference Result 358 states and 551 transitions. [2019-11-15 22:21:10,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:10,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-15 22:21:10,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:10,709 INFO L225 Difference]: With dead ends: 358 [2019-11-15 22:21:10,709 INFO L226 Difference]: Without dead ends: 197 [2019-11-15 22:21:10,710 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:21:10,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-15 22:21:10,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 180. [2019-11-15 22:21:10,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-15 22:21:10,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 274 transitions. [2019-11-15 22:21:10,716 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 274 transitions. Word has length 77 [2019-11-15 22:21:10,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:10,716 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 274 transitions. [2019-11-15 22:21:10,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:10,716 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 274 transitions. [2019-11-15 22:21:10,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-15 22:21:10,717 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:10,717 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, 1, 1] [2019-11-15 22:21:10,718 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:10,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:10,718 INFO L82 PathProgramCache]: Analyzing trace with hash 2003337665, now seen corresponding path program 1 times [2019-11-15 22:21:10,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:10,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857027789] [2019-11-15 22:21:10,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:10,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:10,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:10,765 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:21:10,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857027789] [2019-11-15 22:21:10,766 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:10,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:10,766 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457287098] [2019-11-15 22:21:10,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:10,767 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:10,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:10,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:10,767 INFO L87 Difference]: Start difference. First operand 180 states and 274 transitions. Second operand 4 states. [2019-11-15 22:21:11,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:11,079 INFO L93 Difference]: Finished difference Result 358 states and 549 transitions. [2019-11-15 22:21:11,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:11,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-15 22:21:11,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:11,081 INFO L225 Difference]: With dead ends: 358 [2019-11-15 22:21:11,081 INFO L226 Difference]: Without dead ends: 197 [2019-11-15 22:21:11,082 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:21:11,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-15 22:21:11,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 180. [2019-11-15 22:21:11,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-15 22:21:11,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 273 transitions. [2019-11-15 22:21:11,088 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 273 transitions. Word has length 78 [2019-11-15 22:21:11,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:11,088 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 273 transitions. [2019-11-15 22:21:11,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:11,089 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 273 transitions. [2019-11-15 22:21:11,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-15 22:21:11,090 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:11,090 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, 1, 1] [2019-11-15 22:21:11,090 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:11,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:11,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1314782754, now seen corresponding path program 1 times [2019-11-15 22:21:11,091 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:11,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669952711] [2019-11-15 22:21:11,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:11,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:11,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:11,137 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:21:11,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669952711] [2019-11-15 22:21:11,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:11,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:11,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736415352] [2019-11-15 22:21:11,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:11,138 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:11,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:11,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:11,139 INFO L87 Difference]: Start difference. First operand 180 states and 273 transitions. Second operand 4 states. [2019-11-15 22:21:11,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:11,461 INFO L93 Difference]: Finished difference Result 348 states and 534 transitions. [2019-11-15 22:21:11,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:11,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-15 22:21:11,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:11,463 INFO L225 Difference]: With dead ends: 348 [2019-11-15 22:21:11,464 INFO L226 Difference]: Without dead ends: 187 [2019-11-15 22:21:11,464 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:21:11,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-15 22:21:11,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 180. [2019-11-15 22:21:11,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-15 22:21:11,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 272 transitions. [2019-11-15 22:21:11,469 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 272 transitions. Word has length 79 [2019-11-15 22:21:11,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:11,469 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 272 transitions. [2019-11-15 22:21:11,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:11,469 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 272 transitions. [2019-11-15 22:21:11,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 22:21:11,471 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:11,471 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, 1] [2019-11-15 22:21:11,472 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:11,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:11,472 INFO L82 PathProgramCache]: Analyzing trace with hash 988243362, now seen corresponding path program 1 times [2019-11-15 22:21:11,472 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:11,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681864735] [2019-11-15 22:21:11,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:11,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:11,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:11,564 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:21:11,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681864735] [2019-11-15 22:21:11,564 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:11,564 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:11,565 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49569511] [2019-11-15 22:21:11,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:11,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:11,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:11,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:11,569 INFO L87 Difference]: Start difference. First operand 180 states and 272 transitions. Second operand 4 states. [2019-11-15 22:21:12,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:12,062 INFO L93 Difference]: Finished difference Result 457 states and 705 transitions. [2019-11-15 22:21:12,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:12,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-15 22:21:12,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:12,065 INFO L225 Difference]: With dead ends: 457 [2019-11-15 22:21:12,065 INFO L226 Difference]: Without dead ends: 296 [2019-11-15 22:21:12,066 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:21:12,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-15 22:21:12,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 221. [2019-11-15 22:21:12,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-15 22:21:12,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 346 transitions. [2019-11-15 22:21:12,075 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 346 transitions. Word has length 84 [2019-11-15 22:21:12,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:12,076 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 346 transitions. [2019-11-15 22:21:12,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:12,076 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 346 transitions. [2019-11-15 22:21:12,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 22:21:12,077 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:12,077 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, 1] [2019-11-15 22:21:12,077 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:12,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:12,078 INFO L82 PathProgramCache]: Analyzing trace with hash 90850084, now seen corresponding path program 1 times [2019-11-15 22:21:12,078 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:12,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300350223] [2019-11-15 22:21:12,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:12,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:12,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:12,139 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:21:12,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300350223] [2019-11-15 22:21:12,139 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:12,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:12,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938478006] [2019-11-15 22:21:12,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:12,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:12,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:12,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:12,141 INFO L87 Difference]: Start difference. First operand 221 states and 346 transitions. Second operand 4 states. [2019-11-15 22:21:12,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:12,480 INFO L93 Difference]: Finished difference Result 473 states and 747 transitions. [2019-11-15 22:21:12,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:12,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-15 22:21:12,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:12,483 INFO L225 Difference]: With dead ends: 473 [2019-11-15 22:21:12,483 INFO L226 Difference]: Without dead ends: 271 [2019-11-15 22:21:12,483 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:21:12,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-15 22:21:12,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 245. [2019-11-15 22:21:12,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-11-15 22:21:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 388 transitions. [2019-11-15 22:21:12,490 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 388 transitions. Word has length 84 [2019-11-15 22:21:12,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:12,491 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 388 transitions. [2019-11-15 22:21:12,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:12,491 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 388 transitions. [2019-11-15 22:21:12,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 22:21:12,492 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:12,492 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, 1, 1] [2019-11-15 22:21:12,492 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:12,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:12,492 INFO L82 PathProgramCache]: Analyzing trace with hash 673338576, now seen corresponding path program 1 times [2019-11-15 22:21:12,493 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:12,493 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40329716] [2019-11-15 22:21:12,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:12,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:12,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:12,560 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:21:12,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40329716] [2019-11-15 22:21:12,560 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:12,560 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:12,560 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129092605] [2019-11-15 22:21:12,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:12,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:12,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:12,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:12,561 INFO L87 Difference]: Start difference. First operand 245 states and 388 transitions. Second operand 4 states. [2019-11-15 22:21:13,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:13,017 INFO L93 Difference]: Finished difference Result 536 states and 847 transitions. [2019-11-15 22:21:13,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:13,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-15 22:21:13,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:13,020 INFO L225 Difference]: With dead ends: 536 [2019-11-15 22:21:13,020 INFO L226 Difference]: Without dead ends: 310 [2019-11-15 22:21:13,021 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:21:13,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-11-15 22:21:13,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 246. [2019-11-15 22:21:13,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-11-15 22:21:13,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 389 transitions. [2019-11-15 22:21:13,028 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 389 transitions. Word has length 85 [2019-11-15 22:21:13,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:13,028 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 389 transitions. [2019-11-15 22:21:13,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:13,028 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 389 transitions. [2019-11-15 22:21:13,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 22:21:13,029 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:13,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, 1, 1] [2019-11-15 22:21:13,030 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:13,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:13,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1336716605, now seen corresponding path program 1 times [2019-11-15 22:21:13,030 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:13,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054619460] [2019-11-15 22:21:13,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:13,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:13,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:13,093 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:21:13,093 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054619460] [2019-11-15 22:21:13,094 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:13,094 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:13,094 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732246184] [2019-11-15 22:21:13,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:13,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:13,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:13,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:13,095 INFO L87 Difference]: Start difference. First operand 246 states and 389 transitions. Second operand 4 states. [2019-11-15 22:21:13,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:13,563 INFO L93 Difference]: Finished difference Result 537 states and 847 transitions. [2019-11-15 22:21:13,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:13,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 22:21:13,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:13,566 INFO L225 Difference]: With dead ends: 537 [2019-11-15 22:21:13,567 INFO L226 Difference]: Without dead ends: 310 [2019-11-15 22:21:13,567 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:21:13,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-11-15 22:21:13,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 246. [2019-11-15 22:21:13,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-11-15 22:21:13,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 388 transitions. [2019-11-15 22:21:13,573 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 388 transitions. Word has length 97 [2019-11-15 22:21:13,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:13,574 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 388 transitions. [2019-11-15 22:21:13,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:13,574 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 388 transitions. [2019-11-15 22:21:13,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 22:21:13,575 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:13,575 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, 1, 1] [2019-11-15 22:21:13,575 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:13,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:13,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1377391355, now seen corresponding path program 1 times [2019-11-15 22:21:13,576 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:13,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366716791] [2019-11-15 22:21:13,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:13,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:13,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:13,642 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:21:13,642 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366716791] [2019-11-15 22:21:13,642 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:13,642 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:13,643 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46923012] [2019-11-15 22:21:13,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:13,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:13,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:13,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:13,644 INFO L87 Difference]: Start difference. First operand 246 states and 388 transitions. Second operand 4 states. [2019-11-15 22:21:14,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:14,010 INFO L93 Difference]: Finished difference Result 499 states and 788 transitions. [2019-11-15 22:21:14,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:14,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 22:21:14,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:14,012 INFO L225 Difference]: With dead ends: 499 [2019-11-15 22:21:14,012 INFO L226 Difference]: Without dead ends: 272 [2019-11-15 22:21:14,013 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:21:14,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-15 22:21:14,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 246. [2019-11-15 22:21:14,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-11-15 22:21:14,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 387 transitions. [2019-11-15 22:21:14,020 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 387 transitions. Word has length 97 [2019-11-15 22:21:14,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:14,020 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 387 transitions. [2019-11-15 22:21:14,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:14,021 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 387 transitions. [2019-11-15 22:21:14,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:21:14,021 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:14,022 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, 1, 1] [2019-11-15 22:21:14,022 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:14,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:14,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1129648449, now seen corresponding path program 1 times [2019-11-15 22:21:14,023 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:14,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183044940] [2019-11-15 22:21:14,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:14,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:14,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:14,087 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:21:14,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183044940] [2019-11-15 22:21:14,088 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:14,088 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:14,088 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45787107] [2019-11-15 22:21:14,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:14,088 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:14,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:14,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:14,089 INFO L87 Difference]: Start difference. First operand 246 states and 387 transitions. Second operand 4 states. [2019-11-15 22:21:14,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:14,563 INFO L93 Difference]: Finished difference Result 536 states and 842 transitions. [2019-11-15 22:21:14,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:14,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 22:21:14,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:14,565 INFO L225 Difference]: With dead ends: 536 [2019-11-15 22:21:14,565 INFO L226 Difference]: Without dead ends: 309 [2019-11-15 22:21:14,566 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:21:14,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-15 22:21:14,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 246. [2019-11-15 22:21:14,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-11-15 22:21:14,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 386 transitions. [2019-11-15 22:21:14,576 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 386 transitions. Word has length 98 [2019-11-15 22:21:14,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:14,576 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 386 transitions. [2019-11-15 22:21:14,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:14,577 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 386 transitions. [2019-11-15 22:21:14,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:21:14,578 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:14,578 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, 1, 1] [2019-11-15 22:21:14,578 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:14,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:14,579 INFO L82 PathProgramCache]: Analyzing trace with hash 213545002, now seen corresponding path program 1 times [2019-11-15 22:21:14,579 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:14,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385019451] [2019-11-15 22:21:14,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:14,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:14,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:14,679 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:21:14,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385019451] [2019-11-15 22:21:14,681 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:14,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:14,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79843530] [2019-11-15 22:21:14,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:14,682 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:14,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:14,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:14,682 INFO L87 Difference]: Start difference. First operand 246 states and 386 transitions. Second operand 4 states. [2019-11-15 22:21:15,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:15,126 INFO L93 Difference]: Finished difference Result 534 states and 838 transitions. [2019-11-15 22:21:15,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:15,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 22:21:15,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:15,129 INFO L225 Difference]: With dead ends: 534 [2019-11-15 22:21:15,129 INFO L226 Difference]: Without dead ends: 307 [2019-11-15 22:21:15,129 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:21:15,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-15 22:21:15,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 246. [2019-11-15 22:21:15,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-11-15 22:21:15,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 385 transitions. [2019-11-15 22:21:15,136 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 385 transitions. Word has length 98 [2019-11-15 22:21:15,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:15,136 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 385 transitions. [2019-11-15 22:21:15,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:15,137 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 385 transitions. [2019-11-15 22:21:15,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:21:15,138 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:15,138 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, 1, 1] [2019-11-15 22:21:15,138 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:15,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:15,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1162893162, now seen corresponding path program 1 times [2019-11-15 22:21:15,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:15,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513674813] [2019-11-15 22:21:15,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:15,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:15,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:15,217 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:21:15,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513674813] [2019-11-15 22:21:15,218 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:15,218 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:15,218 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580418579] [2019-11-15 22:21:15,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:15,219 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:15,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:15,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:15,220 INFO L87 Difference]: Start difference. First operand 246 states and 385 transitions. Second operand 4 states. [2019-11-15 22:21:15,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:15,706 INFO L93 Difference]: Finished difference Result 533 states and 835 transitions. [2019-11-15 22:21:15,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:15,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 22:21:15,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:15,709 INFO L225 Difference]: With dead ends: 533 [2019-11-15 22:21:15,709 INFO L226 Difference]: Without dead ends: 306 [2019-11-15 22:21:15,709 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:21:15,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-11-15 22:21:15,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 246. [2019-11-15 22:21:15,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-11-15 22:21:15,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 384 transitions. [2019-11-15 22:21:15,717 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 384 transitions. Word has length 98 [2019-11-15 22:21:15,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:15,717 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 384 transitions. [2019-11-15 22:21:15,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:15,717 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 384 transitions. [2019-11-15 22:21:15,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:21:15,718 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:15,719 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, 1] [2019-11-15 22:21:15,719 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:15,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:15,719 INFO L82 PathProgramCache]: Analyzing trace with hash -291637677, now seen corresponding path program 1 times [2019-11-15 22:21:15,719 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:15,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987833112] [2019-11-15 22:21:15,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:15,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:15,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:15,794 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:21:15,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987833112] [2019-11-15 22:21:15,797 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:15,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:21:15,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431748543] [2019-11-15 22:21:15,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:21:15,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:15,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:21:15,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:21:15,798 INFO L87 Difference]: Start difference. First operand 246 states and 384 transitions. Second operand 5 states. [2019-11-15 22:21:16,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:16,310 INFO L93 Difference]: Finished difference Result 494 states and 776 transitions. [2019-11-15 22:21:16,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:21:16,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-11-15 22:21:16,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:16,312 INFO L225 Difference]: With dead ends: 494 [2019-11-15 22:21:16,312 INFO L226 Difference]: Without dead ends: 267 [2019-11-15 22:21:16,313 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:21:16,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-11-15 22:21:16,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 266. [2019-11-15 22:21:16,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-15 22:21:16,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 410 transitions. [2019-11-15 22:21:16,321 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 410 transitions. Word has length 98 [2019-11-15 22:21:16,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:16,322 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 410 transitions. [2019-11-15 22:21:16,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:21:16,322 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 410 transitions. [2019-11-15 22:21:16,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:21:16,323 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:16,323 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, 1, 1] [2019-11-15 22:21:16,324 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:16,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:16,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1474462252, now seen corresponding path program 1 times [2019-11-15 22:21:16,324 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:16,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835130164] [2019-11-15 22:21:16,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:16,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:16,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:16,380 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:21:16,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835130164] [2019-11-15 22:21:16,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:16,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:16,381 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892669964] [2019-11-15 22:21:16,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:16,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:16,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:16,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:16,382 INFO L87 Difference]: Start difference. First operand 266 states and 410 transitions. Second operand 4 states. [2019-11-15 22:21:16,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:16,733 INFO L93 Difference]: Finished difference Result 536 states and 828 transitions. [2019-11-15 22:21:16,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:16,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 22:21:16,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:16,735 INFO L225 Difference]: With dead ends: 536 [2019-11-15 22:21:16,736 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 22:21:16,736 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:21:16,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 22:21:16,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 266. [2019-11-15 22:21:16,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-15 22:21:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 409 transitions. [2019-11-15 22:21:16,744 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 409 transitions. Word has length 98 [2019-11-15 22:21:16,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:16,744 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 409 transitions. [2019-11-15 22:21:16,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:16,744 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 409 transitions. [2019-11-15 22:21:16,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:21:16,745 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:16,746 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, 1, 1] [2019-11-15 22:21:16,746 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:16,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:16,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1871156884, now seen corresponding path program 1 times [2019-11-15 22:21:16,747 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:16,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381732479] [2019-11-15 22:21:16,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:16,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:16,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:16,806 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:21:16,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381732479] [2019-11-15 22:21:16,806 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:16,806 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:16,807 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283007357] [2019-11-15 22:21:16,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:16,807 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:16,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:16,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:16,808 INFO L87 Difference]: Start difference. First operand 266 states and 409 transitions. Second operand 4 states. [2019-11-15 22:21:17,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:17,146 INFO L93 Difference]: Finished difference Result 535 states and 825 transitions. [2019-11-15 22:21:17,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:17,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 22:21:17,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:17,150 INFO L225 Difference]: With dead ends: 535 [2019-11-15 22:21:17,150 INFO L226 Difference]: Without dead ends: 288 [2019-11-15 22:21:17,151 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:21:17,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-15 22:21:17,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 266. [2019-11-15 22:21:17,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-15 22:21:17,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 408 transitions. [2019-11-15 22:21:17,160 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 408 transitions. Word has length 98 [2019-11-15 22:21:17,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:17,160 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 408 transitions. [2019-11-15 22:21:17,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:17,161 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 408 transitions. [2019-11-15 22:21:17,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 22:21:17,162 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:17,162 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, 1, 1] [2019-11-15 22:21:17,162 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:17,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:17,163 INFO L82 PathProgramCache]: Analyzing trace with hash -160086855, now seen corresponding path program 1 times [2019-11-15 22:21:17,163 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:17,165 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374497167] [2019-11-15 22:21:17,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:17,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:17,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:17,218 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:21:17,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374497167] [2019-11-15 22:21:17,222 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:17,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:17,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801161126] [2019-11-15 22:21:17,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:17,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:17,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:17,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:17,223 INFO L87 Difference]: Start difference. First operand 266 states and 408 transitions. Second operand 4 states. [2019-11-15 22:21:17,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:17,785 INFO L93 Difference]: Finished difference Result 573 states and 880 transitions. [2019-11-15 22:21:17,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:17,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-15 22:21:17,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:17,788 INFO L225 Difference]: With dead ends: 573 [2019-11-15 22:21:17,789 INFO L226 Difference]: Without dead ends: 326 [2019-11-15 22:21:17,789 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:21:17,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-11-15 22:21:17,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 266. [2019-11-15 22:21:17,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-15 22:21:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 407 transitions. [2019-11-15 22:21:17,798 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 407 transitions. Word has length 99 [2019-11-15 22:21:17,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:17,799 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 407 transitions. [2019-11-15 22:21:17,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:17,799 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 407 transitions. [2019-11-15 22:21:17,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 22:21:17,800 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:17,801 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, 1, 1] [2019-11-15 22:21:17,801 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:17,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:17,801 INFO L82 PathProgramCache]: Analyzing trace with hash 273642231, now seen corresponding path program 1 times [2019-11-15 22:21:17,801 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:17,802 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397237810] [2019-11-15 22:21:17,802 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:17,802 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:17,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:17,861 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:21:17,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397237810] [2019-11-15 22:21:17,862 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:17,862 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:17,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919154081] [2019-11-15 22:21:17,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:17,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:17,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:17,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:17,863 INFO L87 Difference]: Start difference. First operand 266 states and 407 transitions. Second operand 4 states. [2019-11-15 22:21:18,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:18,211 INFO L93 Difference]: Finished difference Result 535 states and 821 transitions. [2019-11-15 22:21:18,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:18,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-15 22:21:18,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:18,215 INFO L225 Difference]: With dead ends: 535 [2019-11-15 22:21:18,215 INFO L226 Difference]: Without dead ends: 288 [2019-11-15 22:21:18,215 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:21:18,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-15 22:21:18,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 266. [2019-11-15 22:21:18,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-15 22:21:18,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 406 transitions. [2019-11-15 22:21:18,223 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 406 transitions. Word has length 99 [2019-11-15 22:21:18,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:18,224 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 406 transitions. [2019-11-15 22:21:18,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:18,224 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 406 transitions. [2019-11-15 22:21:18,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 22:21:18,225 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:18,226 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, 1, 1] [2019-11-15 22:21:18,226 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:18,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:18,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1648340570, now seen corresponding path program 1 times [2019-11-15 22:21:18,227 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:18,227 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58712994] [2019-11-15 22:21:18,227 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:18,227 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:18,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:18,295 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:21:18,295 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58712994] [2019-11-15 22:21:18,295 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:18,295 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:18,296 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183499084] [2019-11-15 22:21:18,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:18,296 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:18,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:18,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:18,297 INFO L87 Difference]: Start difference. First operand 266 states and 406 transitions. Second operand 4 states. [2019-11-15 22:21:18,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:18,629 INFO L93 Difference]: Finished difference Result 573 states and 876 transitions. [2019-11-15 22:21:18,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:18,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-15 22:21:18,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:18,632 INFO L225 Difference]: With dead ends: 573 [2019-11-15 22:21:18,633 INFO L226 Difference]: Without dead ends: 326 [2019-11-15 22:21:18,633 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:21:18,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-11-15 22:21:18,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 266. [2019-11-15 22:21:18,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-15 22:21:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 405 transitions. [2019-11-15 22:21:18,641 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 405 transitions. Word has length 100 [2019-11-15 22:21:18,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:18,641 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 405 transitions. [2019-11-15 22:21:18,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:18,642 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 405 transitions. [2019-11-15 22:21:18,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 22:21:18,642 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:18,643 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, 1, 1] [2019-11-15 22:21:18,643 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:18,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:18,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1087640792, now seen corresponding path program 1 times [2019-11-15 22:21:18,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:18,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603573211] [2019-11-15 22:21:18,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:18,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:18,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:18,707 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:21:18,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603573211] [2019-11-15 22:21:18,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:18,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:18,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300491992] [2019-11-15 22:21:18,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:18,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:18,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:18,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:18,708 INFO L87 Difference]: Start difference. First operand 266 states and 405 transitions. Second operand 4 states. [2019-11-15 22:21:19,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:19,021 INFO L93 Difference]: Finished difference Result 535 states and 817 transitions. [2019-11-15 22:21:19,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:19,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-15 22:21:19,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:19,023 INFO L225 Difference]: With dead ends: 535 [2019-11-15 22:21:19,023 INFO L226 Difference]: Without dead ends: 288 [2019-11-15 22:21:19,024 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:21:19,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-15 22:21:19,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 266. [2019-11-15 22:21:19,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-15 22:21:19,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 404 transitions. [2019-11-15 22:21:19,032 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 404 transitions. Word has length 100 [2019-11-15 22:21:19,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:19,032 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 404 transitions. [2019-11-15 22:21:19,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:19,032 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 404 transitions. [2019-11-15 22:21:19,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-15 22:21:19,033 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:19,034 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, 1, 1] [2019-11-15 22:21:19,034 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:19,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:19,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1742266124, now seen corresponding path program 1 times [2019-11-15 22:21:19,034 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:19,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884231032] [2019-11-15 22:21:19,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:19,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:19,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:19,090 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:21:19,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884231032] [2019-11-15 22:21:19,090 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:19,091 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:19,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097488964] [2019-11-15 22:21:19,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:19,091 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:19,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:19,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:19,092 INFO L87 Difference]: Start difference. First operand 266 states and 404 transitions. Second operand 4 states. [2019-11-15 22:21:19,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:19,534 INFO L93 Difference]: Finished difference Result 573 states and 872 transitions. [2019-11-15 22:21:19,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:19,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-15 22:21:19,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:19,537 INFO L225 Difference]: With dead ends: 573 [2019-11-15 22:21:19,537 INFO L226 Difference]: Without dead ends: 326 [2019-11-15 22:21:19,538 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:21:19,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-11-15 22:21:19,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 266. [2019-11-15 22:21:19,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-15 22:21:19,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 403 transitions. [2019-11-15 22:21:19,546 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 403 transitions. Word has length 101 [2019-11-15 22:21:19,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:19,546 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 403 transitions. [2019-11-15 22:21:19,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:19,546 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 403 transitions. [2019-11-15 22:21:19,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-15 22:21:19,547 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:19,547 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, 1, 1] [2019-11-15 22:21:19,548 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:19,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:19,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1540442190, now seen corresponding path program 1 times [2019-11-15 22:21:19,548 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:19,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287548671] [2019-11-15 22:21:19,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:19,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:19,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:19,599 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:21:19,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287548671] [2019-11-15 22:21:19,600 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:19,600 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:19,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290419796] [2019-11-15 22:21:19,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:19,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:19,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:19,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:19,601 INFO L87 Difference]: Start difference. First operand 266 states and 403 transitions. Second operand 4 states. [2019-11-15 22:21:19,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:19,950 INFO L93 Difference]: Finished difference Result 535 states and 813 transitions. [2019-11-15 22:21:19,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:19,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-15 22:21:19,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:19,952 INFO L225 Difference]: With dead ends: 535 [2019-11-15 22:21:19,953 INFO L226 Difference]: Without dead ends: 288 [2019-11-15 22:21:19,953 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:21:19,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-15 22:21:19,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 266. [2019-11-15 22:21:19,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-15 22:21:19,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 402 transitions. [2019-11-15 22:21:19,962 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 402 transitions. Word has length 101 [2019-11-15 22:21:19,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:19,962 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 402 transitions. [2019-11-15 22:21:19,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:19,962 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 402 transitions. [2019-11-15 22:21:19,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-15 22:21:19,963 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:19,963 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, 1, 1] [2019-11-15 22:21:19,963 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:19,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:19,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1561691647, now seen corresponding path program 1 times [2019-11-15 22:21:19,964 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:19,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925859158] [2019-11-15 22:21:19,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:19,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:19,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:20,033 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:21:20,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925859158] [2019-11-15 22:21:20,034 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:20,034 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:20,034 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258012295] [2019-11-15 22:21:20,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:20,035 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:20,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:20,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:20,035 INFO L87 Difference]: Start difference. First operand 266 states and 402 transitions. Second operand 4 states. [2019-11-15 22:21:20,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:20,445 INFO L93 Difference]: Finished difference Result 563 states and 856 transitions. [2019-11-15 22:21:20,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:20,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-15 22:21:20,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:20,447 INFO L225 Difference]: With dead ends: 563 [2019-11-15 22:21:20,447 INFO L226 Difference]: Without dead ends: 316 [2019-11-15 22:21:20,448 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:21:20,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-11-15 22:21:20,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 266. [2019-11-15 22:21:20,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-15 22:21:20,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 401 transitions. [2019-11-15 22:21:20,458 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 401 transitions. Word has length 102 [2019-11-15 22:21:20,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:20,458 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 401 transitions. [2019-11-15 22:21:20,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:20,458 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 401 transitions. [2019-11-15 22:21:20,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-15 22:21:20,459 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:20,460 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, 1, 1] [2019-11-15 22:21:20,460 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:20,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:20,460 INFO L82 PathProgramCache]: Analyzing trace with hash 399883011, now seen corresponding path program 1 times [2019-11-15 22:21:20,460 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:20,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036007472] [2019-11-15 22:21:20,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:20,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:20,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:20,577 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:21:20,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036007472] [2019-11-15 22:21:20,578 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:20,578 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:20,578 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653341984] [2019-11-15 22:21:20,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:20,579 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:20,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:20,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:20,580 INFO L87 Difference]: Start difference. First operand 266 states and 401 transitions. Second operand 4 states. [2019-11-15 22:21:20,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:20,898 INFO L93 Difference]: Finished difference Result 525 states and 797 transitions. [2019-11-15 22:21:20,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:20,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-15 22:21:20,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:20,900 INFO L225 Difference]: With dead ends: 525 [2019-11-15 22:21:20,900 INFO L226 Difference]: Without dead ends: 278 [2019-11-15 22:21:20,901 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:21:20,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-15 22:21:20,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 266. [2019-11-15 22:21:20,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-15 22:21:20,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 400 transitions. [2019-11-15 22:21:20,911 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 400 transitions. Word has length 102 [2019-11-15 22:21:20,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:20,911 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 400 transitions. [2019-11-15 22:21:20,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:20,912 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 400 transitions. [2019-11-15 22:21:20,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-15 22:21:20,913 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:20,914 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:21:20,914 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:20,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:20,915 INFO L82 PathProgramCache]: Analyzing trace with hash 325122695, now seen corresponding path program 1 times [2019-11-15 22:21:20,915 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:20,915 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549174500] [2019-11-15 22:21:20,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:20,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:20,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:20,977 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:21:20,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549174500] [2019-11-15 22:21:20,978 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:20,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:20,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600539786] [2019-11-15 22:21:20,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:20,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:20,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:20,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:20,979 INFO L87 Difference]: Start difference. First operand 266 states and 400 transitions. Second operand 4 states. [2019-11-15 22:21:21,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:21,422 INFO L93 Difference]: Finished difference Result 563 states and 852 transitions. [2019-11-15 22:21:21,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:21,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-15 22:21:21,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:21,425 INFO L225 Difference]: With dead ends: 563 [2019-11-15 22:21:21,425 INFO L226 Difference]: Without dead ends: 316 [2019-11-15 22:21:21,426 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:21:21,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-11-15 22:21:21,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 266. [2019-11-15 22:21:21,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-15 22:21:21,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 399 transitions. [2019-11-15 22:21:21,436 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 399 transitions. Word has length 106 [2019-11-15 22:21:21,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:21,436 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 399 transitions. [2019-11-15 22:21:21,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:21,437 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 399 transitions. [2019-11-15 22:21:21,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-15 22:21:21,438 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:21,438 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:21:21,438 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:21,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:21,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1361057143, now seen corresponding path program 1 times [2019-11-15 22:21:21,439 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:21,439 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678768204] [2019-11-15 22:21:21,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:21,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:21,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:21,497 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:21:21,497 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678768204] [2019-11-15 22:21:21,498 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:21,498 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:21:21,498 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408568993] [2019-11-15 22:21:21,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:21:21,498 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:21,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:21:21,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:21:21,499 INFO L87 Difference]: Start difference. First operand 266 states and 399 transitions. Second operand 3 states. [2019-11-15 22:21:21,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:21,599 INFO L93 Difference]: Finished difference Result 758 states and 1152 transitions. [2019-11-15 22:21:21,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:21:21,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-15 22:21:21,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:21,602 INFO L225 Difference]: With dead ends: 758 [2019-11-15 22:21:21,603 INFO L226 Difference]: Without dead ends: 511 [2019-11-15 22:21:21,603 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:21:21,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-11-15 22:21:21,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2019-11-15 22:21:21,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-11-15 22:21:21,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 756 transitions. [2019-11-15 22:21:21,618 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 756 transitions. Word has length 106 [2019-11-15 22:21:21,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:21,618 INFO L462 AbstractCegarLoop]: Abstraction has 511 states and 756 transitions. [2019-11-15 22:21:21,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:21:21,618 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 756 transitions. [2019-11-15 22:21:21,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-15 22:21:21,620 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:21,620 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, 1, 1] [2019-11-15 22:21:21,620 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:21,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:21,621 INFO L82 PathProgramCache]: Analyzing trace with hash 506499155, now seen corresponding path program 1 times [2019-11-15 22:21:21,621 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:21,621 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091395] [2019-11-15 22:21:21,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:21,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:21,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:21,681 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:21:21,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091395] [2019-11-15 22:21:21,681 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:21,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:21:21,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924195315] [2019-11-15 22:21:21,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:21:21,683 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:21,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:21:21,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:21:21,683 INFO L87 Difference]: Start difference. First operand 511 states and 756 transitions. Second operand 3 states. [2019-11-15 22:21:21,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:21,793 INFO L93 Difference]: Finished difference Result 1248 states and 1866 transitions. [2019-11-15 22:21:21,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:21:21,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-11-15 22:21:21,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:21,798 INFO L225 Difference]: With dead ends: 1248 [2019-11-15 22:21:21,798 INFO L226 Difference]: Without dead ends: 756 [2019-11-15 22:21:21,799 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:21:21,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2019-11-15 22:21:21,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2019-11-15 22:21:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2019-11-15 22:21:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1114 transitions. [2019-11-15 22:21:21,820 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1114 transitions. Word has length 108 [2019-11-15 22:21:21,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:21,820 INFO L462 AbstractCegarLoop]: Abstraction has 756 states and 1114 transitions. [2019-11-15 22:21:21,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:21:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1114 transitions. [2019-11-15 22:21:21,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-15 22:21:21,822 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:21,823 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, 1, 1] [2019-11-15 22:21:21,823 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:21,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:21,823 INFO L82 PathProgramCache]: Analyzing trace with hash 151412293, now seen corresponding path program 1 times [2019-11-15 22:21:21,823 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:21,824 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625098998] [2019-11-15 22:21:21,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:21,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:21,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:21,894 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:21:21,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625098998] [2019-11-15 22:21:21,894 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:21,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:21,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754013252] [2019-11-15 22:21:21,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:21,896 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:21,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:21,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:21,896 INFO L87 Difference]: Start difference. First operand 756 states and 1114 transitions. Second operand 4 states. [2019-11-15 22:21:22,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:22,297 INFO L93 Difference]: Finished difference Result 1682 states and 2500 transitions. [2019-11-15 22:21:22,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:22,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-11-15 22:21:22,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:22,304 INFO L225 Difference]: With dead ends: 1682 [2019-11-15 22:21:22,304 INFO L226 Difference]: Without dead ends: 945 [2019-11-15 22:21:22,305 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:21:22,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-11-15 22:21:22,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 840. [2019-11-15 22:21:22,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-11-15 22:21:22,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1261 transitions. [2019-11-15 22:21:22,329 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1261 transitions. Word has length 137 [2019-11-15 22:21:22,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:22,330 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1261 transitions. [2019-11-15 22:21:22,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:22,330 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1261 transitions. [2019-11-15 22:21:22,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-15 22:21:22,332 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:22,333 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, 1, 1] [2019-11-15 22:21:22,333 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:22,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:22,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1915218566, now seen corresponding path program 1 times [2019-11-15 22:21:22,333 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:22,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114523116] [2019-11-15 22:21:22,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:22,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:22,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:22,404 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:21:22,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114523116] [2019-11-15 22:21:22,405 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:22,405 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:22,405 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889399982] [2019-11-15 22:21:22,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:22,406 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:22,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:22,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:22,406 INFO L87 Difference]: Start difference. First operand 840 states and 1261 transitions. Second operand 4 states. [2019-11-15 22:21:22,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:22,807 INFO L93 Difference]: Finished difference Result 1766 states and 2644 transitions. [2019-11-15 22:21:22,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:22,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-15 22:21:22,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:22,815 INFO L225 Difference]: With dead ends: 1766 [2019-11-15 22:21:22,815 INFO L226 Difference]: Without dead ends: 945 [2019-11-15 22:21:22,817 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:21:22,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-11-15 22:21:22,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 840. [2019-11-15 22:21:22,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-11-15 22:21:22,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1258 transitions. [2019-11-15 22:21:22,840 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1258 transitions. Word has length 150 [2019-11-15 22:21:22,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:22,840 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1258 transitions. [2019-11-15 22:21:22,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:22,841 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1258 transitions. [2019-11-15 22:21:22,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-15 22:21:22,843 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:22,843 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, 1, 1] [2019-11-15 22:21:22,843 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:22,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:22,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1812197491, now seen corresponding path program 1 times [2019-11-15 22:21:22,844 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:22,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81757446] [2019-11-15 22:21:22,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:22,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:22,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:22,947 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:21:22,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81757446] [2019-11-15 22:21:22,947 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:22,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:22,947 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328051074] [2019-11-15 22:21:22,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:22,948 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:22,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:22,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:22,948 INFO L87 Difference]: Start difference. First operand 840 states and 1258 transitions. Second operand 4 states. [2019-11-15 22:21:23,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:23,305 INFO L93 Difference]: Finished difference Result 1760 states and 2632 transitions. [2019-11-15 22:21:23,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:23,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-11-15 22:21:23,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:23,311 INFO L225 Difference]: With dead ends: 1760 [2019-11-15 22:21:23,311 INFO L226 Difference]: Without dead ends: 939 [2019-11-15 22:21:23,312 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:21:23,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2019-11-15 22:21:23,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 840. [2019-11-15 22:21:23,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-11-15 22:21:23,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1255 transitions. [2019-11-15 22:21:23,335 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1255 transitions. Word has length 151 [2019-11-15 22:21:23,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:23,336 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1255 transitions. [2019-11-15 22:21:23,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:23,336 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1255 transitions. [2019-11-15 22:21:23,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-15 22:21:23,338 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:23,338 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, 1, 1] [2019-11-15 22:21:23,339 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:23,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:23,339 INFO L82 PathProgramCache]: Analyzing trace with hash -862849331, now seen corresponding path program 1 times [2019-11-15 22:21:23,339 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:23,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233524791] [2019-11-15 22:21:23,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:23,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:23,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:23,410 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:21:23,410 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233524791] [2019-11-15 22:21:23,410 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:23,410 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:23,410 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109922060] [2019-11-15 22:21:23,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:23,411 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:23,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:23,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:23,411 INFO L87 Difference]: Start difference. First operand 840 states and 1255 transitions. Second operand 4 states. [2019-11-15 22:21:23,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:23,878 INFO L93 Difference]: Finished difference Result 1757 states and 2623 transitions. [2019-11-15 22:21:23,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:23,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-11-15 22:21:23,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:23,884 INFO L225 Difference]: With dead ends: 1757 [2019-11-15 22:21:23,884 INFO L226 Difference]: Without dead ends: 936 [2019-11-15 22:21:23,885 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:21:23,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2019-11-15 22:21:23,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 840. [2019-11-15 22:21:23,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-11-15 22:21:23,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1252 transitions. [2019-11-15 22:21:23,908 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1252 transitions. Word has length 151 [2019-11-15 22:21:23,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:23,909 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1252 transitions. [2019-11-15 22:21:23,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:23,909 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1252 transitions. [2019-11-15 22:21:23,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-15 22:21:23,911 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:23,912 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, 1, 1] [2019-11-15 22:21:23,912 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:23,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:23,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1466405302, now seen corresponding path program 1 times [2019-11-15 22:21:23,912 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:23,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108117126] [2019-11-15 22:21:23,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:23,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:23,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:23,980 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:21:23,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108117126] [2019-11-15 22:21:23,980 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:23,980 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:23,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214361373] [2019-11-15 22:21:23,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:23,981 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:23,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:23,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:23,981 INFO L87 Difference]: Start difference. First operand 840 states and 1252 transitions. Second operand 4 states. [2019-11-15 22:21:24,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:24,320 INFO L93 Difference]: Finished difference Result 1757 states and 2617 transitions. [2019-11-15 22:21:24,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:24,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-15 22:21:24,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:24,327 INFO L225 Difference]: With dead ends: 1757 [2019-11-15 22:21:24,327 INFO L226 Difference]: Without dead ends: 936 [2019-11-15 22:21:24,328 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:21:24,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2019-11-15 22:21:24,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 840. [2019-11-15 22:21:24,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-11-15 22:21:24,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1249 transitions. [2019-11-15 22:21:24,351 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1249 transitions. Word has length 152 [2019-11-15 22:21:24,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:24,351 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1249 transitions. [2019-11-15 22:21:24,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:24,351 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1249 transitions. [2019-11-15 22:21:24,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-15 22:21:24,353 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:24,354 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, 1, 1] [2019-11-15 22:21:24,354 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:24,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:24,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1528276041, now seen corresponding path program 1 times [2019-11-15 22:21:24,354 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:24,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924991507] [2019-11-15 22:21:24,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:24,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:24,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:24,425 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:21:24,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924991507] [2019-11-15 22:21:24,426 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:24,426 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:24,426 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127230918] [2019-11-15 22:21:24,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:24,427 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:24,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:24,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:24,427 INFO L87 Difference]: Start difference. First operand 840 states and 1249 transitions. Second operand 4 states. [2019-11-15 22:21:24,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:24,819 INFO L93 Difference]: Finished difference Result 1757 states and 2611 transitions. [2019-11-15 22:21:24,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:24,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-11-15 22:21:24,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:24,825 INFO L225 Difference]: With dead ends: 1757 [2019-11-15 22:21:24,825 INFO L226 Difference]: Without dead ends: 936 [2019-11-15 22:21:24,826 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:21:24,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2019-11-15 22:21:24,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 840. [2019-11-15 22:21:24,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-11-15 22:21:24,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1246 transitions. [2019-11-15 22:21:24,855 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1246 transitions. Word has length 153 [2019-11-15 22:21:24,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:24,855 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1246 transitions. [2019-11-15 22:21:24,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:24,855 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1246 transitions. [2019-11-15 22:21:24,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-15 22:21:24,858 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:24,858 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, 1, 1] [2019-11-15 22:21:24,859 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:24,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:24,859 INFO L82 PathProgramCache]: Analyzing trace with hash -2051398991, now seen corresponding path program 1 times [2019-11-15 22:21:24,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:24,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476001842] [2019-11-15 22:21:24,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:24,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:24,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:24,943 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:21:24,943 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476001842] [2019-11-15 22:21:24,943 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:24,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:24,944 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046766075] [2019-11-15 22:21:24,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:24,944 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:24,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:24,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:24,945 INFO L87 Difference]: Start difference. First operand 840 states and 1246 transitions. Second operand 4 states. [2019-11-15 22:21:25,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:25,275 INFO L93 Difference]: Finished difference Result 1757 states and 2605 transitions. [2019-11-15 22:21:25,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:25,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-15 22:21:25,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:25,280 INFO L225 Difference]: With dead ends: 1757 [2019-11-15 22:21:25,280 INFO L226 Difference]: Without dead ends: 936 [2019-11-15 22:21:25,282 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:21:25,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2019-11-15 22:21:25,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 840. [2019-11-15 22:21:25,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-11-15 22:21:25,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1243 transitions. [2019-11-15 22:21:25,305 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1243 transitions. Word has length 154 [2019-11-15 22:21:25,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:25,305 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1243 transitions. [2019-11-15 22:21:25,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:25,305 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1243 transitions. [2019-11-15 22:21:25,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-15 22:21:25,307 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:25,308 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, 1, 1] [2019-11-15 22:21:25,308 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:25,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:25,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1740091364, now seen corresponding path program 1 times [2019-11-15 22:21:25,308 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:25,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440009580] [2019-11-15 22:21:25,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:25,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:25,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:25,392 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:21:25,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440009580] [2019-11-15 22:21:25,392 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:25,393 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:25,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629773235] [2019-11-15 22:21:25,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:25,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:25,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:25,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:25,394 INFO L87 Difference]: Start difference. First operand 840 states and 1243 transitions. Second operand 4 states. [2019-11-15 22:21:25,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:25,814 INFO L93 Difference]: Finished difference Result 1727 states and 2563 transitions. [2019-11-15 22:21:25,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:25,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-11-15 22:21:25,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:25,819 INFO L225 Difference]: With dead ends: 1727 [2019-11-15 22:21:25,819 INFO L226 Difference]: Without dead ends: 906 [2019-11-15 22:21:25,820 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:21:25,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2019-11-15 22:21:25,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 840. [2019-11-15 22:21:25,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-11-15 22:21:25,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1240 transitions. [2019-11-15 22:21:25,850 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1240 transitions. Word has length 155 [2019-11-15 22:21:25,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:25,850 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1240 transitions. [2019-11-15 22:21:25,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:25,851 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1240 transitions. [2019-11-15 22:21:25,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-15 22:21:25,853 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:25,853 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, 1, 1] [2019-11-15 22:21:25,853 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:25,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:25,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1593145622, now seen corresponding path program 1 times [2019-11-15 22:21:25,854 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:25,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030104283] [2019-11-15 22:21:25,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:25,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:25,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:25,933 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:21:25,934 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030104283] [2019-11-15 22:21:25,934 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:25,934 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:25,934 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533358244] [2019-11-15 22:21:25,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:25,935 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:25,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:25,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:25,935 INFO L87 Difference]: Start difference. First operand 840 states and 1240 transitions. Second operand 4 states. [2019-11-15 22:21:26,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:26,333 INFO L93 Difference]: Finished difference Result 1727 states and 2557 transitions. [2019-11-15 22:21:26,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:26,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-11-15 22:21:26,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:26,339 INFO L225 Difference]: With dead ends: 1727 [2019-11-15 22:21:26,339 INFO L226 Difference]: Without dead ends: 906 [2019-11-15 22:21:26,341 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:21:26,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2019-11-15 22:21:26,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 840. [2019-11-15 22:21:26,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-11-15 22:21:26,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1237 transitions. [2019-11-15 22:21:26,364 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1237 transitions. Word has length 159 [2019-11-15 22:21:26,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:26,364 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1237 transitions. [2019-11-15 22:21:26,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:26,364 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1237 transitions. [2019-11-15 22:21:26,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-15 22:21:26,366 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:26,367 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, 1, 1] [2019-11-15 22:21:26,367 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:26,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:26,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1443396425, now seen corresponding path program 1 times [2019-11-15 22:21:26,368 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:26,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553818029] [2019-11-15 22:21:26,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:26,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:26,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:26,439 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:21:26,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553818029] [2019-11-15 22:21:26,439 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:26,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:26,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833106651] [2019-11-15 22:21:26,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:26,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:26,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:26,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:26,441 INFO L87 Difference]: Start difference. First operand 840 states and 1237 transitions. Second operand 4 states. [2019-11-15 22:21:26,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:26,736 INFO L93 Difference]: Finished difference Result 1712 states and 2530 transitions. [2019-11-15 22:21:26,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:26,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-11-15 22:21:26,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:26,741 INFO L225 Difference]: With dead ends: 1712 [2019-11-15 22:21:26,742 INFO L226 Difference]: Without dead ends: 891 [2019-11-15 22:21:26,743 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:21:26,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2019-11-15 22:21:26,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 840. [2019-11-15 22:21:26,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-11-15 22:21:26,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1234 transitions. [2019-11-15 22:21:26,765 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1234 transitions. Word has length 160 [2019-11-15 22:21:26,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:26,766 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1234 transitions. [2019-11-15 22:21:26,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:26,766 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1234 transitions. [2019-11-15 22:21:26,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-15 22:21:26,768 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:26,769 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] [2019-11-15 22:21:26,769 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:26,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:26,769 INFO L82 PathProgramCache]: Analyzing trace with hash -536021289, now seen corresponding path program 1 times [2019-11-15 22:21:26,769 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:26,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327664144] [2019-11-15 22:21:26,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:26,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:26,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:26,851 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:21:26,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327664144] [2019-11-15 22:21:26,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:26,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:26,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25196537] [2019-11-15 22:21:26,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:26,853 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:26,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:26,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:26,853 INFO L87 Difference]: Start difference. First operand 840 states and 1234 transitions. Second operand 4 states. [2019-11-15 22:21:27,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:27,212 INFO L93 Difference]: Finished difference Result 1862 states and 2758 transitions. [2019-11-15 22:21:27,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:27,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-11-15 22:21:27,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:27,216 INFO L225 Difference]: With dead ends: 1862 [2019-11-15 22:21:27,216 INFO L226 Difference]: Without dead ends: 1041 [2019-11-15 22:21:27,217 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:21:27,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-11-15 22:21:27,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 930. [2019-11-15 22:21:27,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-11-15 22:21:27,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1393 transitions. [2019-11-15 22:21:27,244 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1393 transitions. Word has length 162 [2019-11-15 22:21:27,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:27,244 INFO L462 AbstractCegarLoop]: Abstraction has 930 states and 1393 transitions. [2019-11-15 22:21:27,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:27,245 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1393 transitions. [2019-11-15 22:21:27,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-15 22:21:27,248 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:27,248 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, 1, 1] [2019-11-15 22:21:27,248 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:27,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:27,249 INFO L82 PathProgramCache]: Analyzing trace with hash 2052018546, now seen corresponding path program 1 times [2019-11-15 22:21:27,249 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:27,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037689367] [2019-11-15 22:21:27,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:27,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:27,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:27,336 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:21:27,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037689367] [2019-11-15 22:21:27,336 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:27,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:21:27,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468838480] [2019-11-15 22:21:27,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:21:27,337 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:27,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:21:27,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:21:27,338 INFO L87 Difference]: Start difference. First operand 930 states and 1393 transitions. Second operand 3 states. [2019-11-15 22:21:27,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:27,427 INFO L93 Difference]: Finished difference Result 2144 states and 3233 transitions. [2019-11-15 22:21:27,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:21:27,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-11-15 22:21:27,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:27,434 INFO L225 Difference]: With dead ends: 2144 [2019-11-15 22:21:27,434 INFO L226 Difference]: Without dead ends: 1233 [2019-11-15 22:21:27,435 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:21:27,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2019-11-15 22:21:27,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1233. [2019-11-15 22:21:27,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2019-11-15 22:21:27,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1846 transitions. [2019-11-15 22:21:27,467 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1846 transitions. Word has length 168 [2019-11-15 22:21:27,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:27,467 INFO L462 AbstractCegarLoop]: Abstraction has 1233 states and 1846 transitions. [2019-11-15 22:21:27,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:21:27,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1846 transitions. [2019-11-15 22:21:27,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-15 22:21:27,470 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:27,471 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, 1, 1] [2019-11-15 22:21:27,471 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:27,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:27,471 INFO L82 PathProgramCache]: Analyzing trace with hash 595109725, now seen corresponding path program 1 times [2019-11-15 22:21:27,472 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:27,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120560644] [2019-11-15 22:21:27,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:27,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:27,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:27,551 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:21:27,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120560644] [2019-11-15 22:21:27,551 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:27,551 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:27,552 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458587241] [2019-11-15 22:21:27,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:27,552 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:27,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:27,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:27,553 INFO L87 Difference]: Start difference. First operand 1233 states and 1846 transitions. Second operand 4 states. [2019-11-15 22:21:28,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:28,009 INFO L93 Difference]: Finished difference Result 2515 states and 3774 transitions. [2019-11-15 22:21:28,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:28,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-11-15 22:21:28,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:28,016 INFO L225 Difference]: With dead ends: 2515 [2019-11-15 22:21:28,016 INFO L226 Difference]: Without dead ends: 1301 [2019-11-15 22:21:28,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:21:28,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2019-11-15 22:21:28,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1233. [2019-11-15 22:21:28,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2019-11-15 22:21:28,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1842 transitions. [2019-11-15 22:21:28,048 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1842 transitions. Word has length 191 [2019-11-15 22:21:28,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:28,048 INFO L462 AbstractCegarLoop]: Abstraction has 1233 states and 1842 transitions. [2019-11-15 22:21:28,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:28,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1842 transitions. [2019-11-15 22:21:28,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-15 22:21:28,052 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:28,052 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, 1, 1] [2019-11-15 22:21:28,052 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:28,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:28,053 INFO L82 PathProgramCache]: Analyzing trace with hash -169598838, now seen corresponding path program 1 times [2019-11-15 22:21:28,053 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:28,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526310593] [2019-11-15 22:21:28,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:28,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:28,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:28,128 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:21:28,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526310593] [2019-11-15 22:21:28,129 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:28,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:28,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786649554] [2019-11-15 22:21:28,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:28,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:28,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:28,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:28,130 INFO L87 Difference]: Start difference. First operand 1233 states and 1842 transitions. Second operand 4 states. [2019-11-15 22:21:28,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:28,521 INFO L93 Difference]: Finished difference Result 2499 states and 3742 transitions. [2019-11-15 22:21:28,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:28,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-15 22:21:28,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:28,541 INFO L225 Difference]: With dead ends: 2499 [2019-11-15 22:21:28,547 INFO L226 Difference]: Without dead ends: 1285 [2019-11-15 22:21:28,548 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:21:28,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2019-11-15 22:21:28,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1233. [2019-11-15 22:21:28,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2019-11-15 22:21:28,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1838 transitions. [2019-11-15 22:21:28,579 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1838 transitions. Word has length 192 [2019-11-15 22:21:28,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:28,579 INFO L462 AbstractCegarLoop]: Abstraction has 1233 states and 1838 transitions. [2019-11-15 22:21:28,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:28,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1838 transitions. [2019-11-15 22:21:28,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-15 22:21:28,582 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:28,582 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:21:28,582 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:28,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:28,583 INFO L82 PathProgramCache]: Analyzing trace with hash -811867631, now seen corresponding path program 1 times [2019-11-15 22:21:28,583 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:28,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594219982] [2019-11-15 22:21:28,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:28,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:28,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:28,674 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:21:28,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594219982] [2019-11-15 22:21:28,675 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:28,675 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:21:28,675 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506031870] [2019-11-15 22:21:28,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:21:28,676 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:28,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:21:28,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:21:28,676 INFO L87 Difference]: Start difference. First operand 1233 states and 1838 transitions. Second operand 3 states. [2019-11-15 22:21:28,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:28,792 INFO L93 Difference]: Finished difference Result 2750 states and 4121 transitions. [2019-11-15 22:21:28,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:21:28,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-11-15 22:21:28,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:28,796 INFO L225 Difference]: With dead ends: 2750 [2019-11-15 22:21:28,796 INFO L226 Difference]: Without dead ends: 1536 [2019-11-15 22:21:28,798 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:21:28,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2019-11-15 22:21:28,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1536. [2019-11-15 22:21:28,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1536 states. [2019-11-15 22:21:28,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 2290 transitions. [2019-11-15 22:21:28,835 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 2290 transitions. Word has length 200 [2019-11-15 22:21:28,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:28,835 INFO L462 AbstractCegarLoop]: Abstraction has 1536 states and 2290 transitions. [2019-11-15 22:21:28,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:21:28,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 2290 transitions. [2019-11-15 22:21:28,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-11-15 22:21:28,838 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:28,839 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, 1, 1] [2019-11-15 22:21:28,839 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:28,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:28,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1012697785, now seen corresponding path program 1 times [2019-11-15 22:21:28,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:28,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313703543] [2019-11-15 22:21:28,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:28,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:28,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:28,921 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:21:28,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313703543] [2019-11-15 22:21:28,921 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:28,922 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:21:28,922 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695582298] [2019-11-15 22:21:28,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:21:28,922 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:28,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:21:28,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:21:28,923 INFO L87 Difference]: Start difference. First operand 1536 states and 2290 transitions. Second operand 3 states. [2019-11-15 22:21:29,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:29,044 INFO L93 Difference]: Finished difference Result 3356 states and 5025 transitions. [2019-11-15 22:21:29,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:21:29,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2019-11-15 22:21:29,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:29,048 INFO L225 Difference]: With dead ends: 3356 [2019-11-15 22:21:29,048 INFO L226 Difference]: Without dead ends: 1839 [2019-11-15 22:21:29,050 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:21:29,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2019-11-15 22:21:29,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1839. [2019-11-15 22:21:29,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1839 states. [2019-11-15 22:21:29,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2743 transitions. [2019-11-15 22:21:29,103 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2743 transitions. Word has length 202 [2019-11-15 22:21:29,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:29,104 INFO L462 AbstractCegarLoop]: Abstraction has 1839 states and 2743 transitions. [2019-11-15 22:21:29,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:21:29,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2743 transitions. [2019-11-15 22:21:29,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-15 22:21:29,107 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:29,108 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, 1, 1] [2019-11-15 22:21:29,108 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:29,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:29,108 INFO L82 PathProgramCache]: Analyzing trace with hash 648546372, now seen corresponding path program 1 times [2019-11-15 22:21:29,109 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:29,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225144690] [2019-11-15 22:21:29,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:29,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:29,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:29,208 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:21:29,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225144690] [2019-11-15 22:21:29,209 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:29,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:21:29,209 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155114723] [2019-11-15 22:21:29,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:21:29,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:29,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:21:29,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:21:29,210 INFO L87 Difference]: Start difference. First operand 1839 states and 2743 transitions. Second operand 3 states. [2019-11-15 22:21:29,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:29,342 INFO L93 Difference]: Finished difference Result 3962 states and 5931 transitions. [2019-11-15 22:21:29,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:21:29,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-11-15 22:21:29,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:29,346 INFO L225 Difference]: With dead ends: 3962 [2019-11-15 22:21:29,347 INFO L226 Difference]: Without dead ends: 2142 [2019-11-15 22:21:29,349 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:21:29,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2019-11-15 22:21:29,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 2142. [2019-11-15 22:21:29,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2142 states. [2019-11-15 22:21:29,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 3197 transitions. [2019-11-15 22:21:29,403 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 3197 transitions. Word has length 235 [2019-11-15 22:21:29,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:29,404 INFO L462 AbstractCegarLoop]: Abstraction has 2142 states and 3197 transitions. [2019-11-15 22:21:29,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:21:29,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 3197 transitions. [2019-11-15 22:21:29,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-11-15 22:21:29,409 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:29,410 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, 1, 1] [2019-11-15 22:21:29,410 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:29,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:29,411 INFO L82 PathProgramCache]: Analyzing trace with hash 2113453151, now seen corresponding path program 1 times [2019-11-15 22:21:29,411 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:29,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111513111] [2019-11-15 22:21:29,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:29,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:29,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:29,602 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:21:29,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111513111] [2019-11-15 22:21:29,603 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:29,603 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:21:29,603 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510711881] [2019-11-15 22:21:29,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:21:29,605 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:29,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:21:29,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:21:29,605 INFO L87 Difference]: Start difference. First operand 2142 states and 3197 transitions. Second operand 3 states. [2019-11-15 22:21:29,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:29,735 INFO L93 Difference]: Finished difference Result 4560 states and 6826 transitions. [2019-11-15 22:21:29,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:21:29,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2019-11-15 22:21:29,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:29,739 INFO L225 Difference]: With dead ends: 4560 [2019-11-15 22:21:29,739 INFO L226 Difference]: Without dead ends: 2437 [2019-11-15 22:21:29,741 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:21:29,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2019-11-15 22:21:29,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 2437. [2019-11-15 22:21:29,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2437 states. [2019-11-15 22:21:29,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2437 states and 3633 transitions. [2019-11-15 22:21:29,796 INFO L78 Accepts]: Start accepts. Automaton has 2437 states and 3633 transitions. Word has length 270 [2019-11-15 22:21:29,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:29,797 INFO L462 AbstractCegarLoop]: Abstraction has 2437 states and 3633 transitions. [2019-11-15 22:21:29,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:21:29,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 3633 transitions. [2019-11-15 22:21:29,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-11-15 22:21:29,802 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:29,802 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, 1, 1] [2019-11-15 22:21:29,802 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:29,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:29,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1676068964, now seen corresponding path program 1 times [2019-11-15 22:21:29,803 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:29,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337918412] [2019-11-15 22:21:29,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:29,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:29,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:29,940 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:21:29,941 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337918412] [2019-11-15 22:21:29,941 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:29,941 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:21:29,941 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111775122] [2019-11-15 22:21:29,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:21:29,942 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:29,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:21:29,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:21:29,943 INFO L87 Difference]: Start difference. First operand 2437 states and 3633 transitions. Second operand 3 states. [2019-11-15 22:21:30,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:30,079 INFO L93 Difference]: Finished difference Result 5158 states and 7711 transitions. [2019-11-15 22:21:30,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:21:30,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 309 [2019-11-15 22:21:30,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:30,085 INFO L225 Difference]: With dead ends: 5158 [2019-11-15 22:21:30,085 INFO L226 Difference]: Without dead ends: 2740 [2019-11-15 22:21:30,088 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:21:30,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2740 states. [2019-11-15 22:21:30,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2740 to 2740. [2019-11-15 22:21:30,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2740 states. [2019-11-15 22:21:30,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2740 states to 2740 states and 4089 transitions. [2019-11-15 22:21:30,149 INFO L78 Accepts]: Start accepts. Automaton has 2740 states and 4089 transitions. Word has length 309 [2019-11-15 22:21:30,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:30,150 INFO L462 AbstractCegarLoop]: Abstraction has 2740 states and 4089 transitions. [2019-11-15 22:21:30,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:21:30,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2740 states and 4089 transitions. [2019-11-15 22:21:30,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-11-15 22:21:30,155 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:30,155 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, 1, 1] [2019-11-15 22:21:30,156 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:30,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:30,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1032303954, now seen corresponding path program 1 times [2019-11-15 22:21:30,156 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:30,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796999579] [2019-11-15 22:21:30,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:30,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:30,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:30,318 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:21:30,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796999579] [2019-11-15 22:21:30,318 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:30,318 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:21:30,318 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152663006] [2019-11-15 22:21:30,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:21:30,319 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:30,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:21:30,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:21:30,320 INFO L87 Difference]: Start difference. First operand 2740 states and 4089 transitions. Second operand 3 states. [2019-11-15 22:21:30,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:30,466 INFO L93 Difference]: Finished difference Result 5764 states and 8623 transitions. [2019-11-15 22:21:30,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:21:30,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 350 [2019-11-15 22:21:30,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:30,471 INFO L225 Difference]: With dead ends: 5764 [2019-11-15 22:21:30,472 INFO L226 Difference]: Without dead ends: 3043 [2019-11-15 22:21:30,474 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:21:30,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3043 states. [2019-11-15 22:21:30,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3043 to 3043. [2019-11-15 22:21:30,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3043 states. [2019-11-15 22:21:30,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 4546 transitions. [2019-11-15 22:21:30,587 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 4546 transitions. Word has length 350 [2019-11-15 22:21:30,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:30,588 INFO L462 AbstractCegarLoop]: Abstraction has 3043 states and 4546 transitions. [2019-11-15 22:21:30,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:21:30,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 4546 transitions. [2019-11-15 22:21:30,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-11-15 22:21:30,593 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:30,593 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, 1, 1] [2019-11-15 22:21:30,595 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:30,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:30,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1120451630, now seen corresponding path program 1 times [2019-11-15 22:21:30,595 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:30,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576438314] [2019-11-15 22:21:30,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:30,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:30,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:30,783 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:21:30,784 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576438314] [2019-11-15 22:21:30,784 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:30,784 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:21:30,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816453700] [2019-11-15 22:21:30,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:21:30,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:30,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:21:30,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:21:30,785 INFO L87 Difference]: Start difference. First operand 3043 states and 4546 transitions. Second operand 3 states. [2019-11-15 22:21:30,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:30,925 INFO L93 Difference]: Finished difference Result 6363 states and 9526 transitions. [2019-11-15 22:21:30,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:21:30,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2019-11-15 22:21:30,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:30,932 INFO L225 Difference]: With dead ends: 6363 [2019-11-15 22:21:30,932 INFO L226 Difference]: Without dead ends: 3339 [2019-11-15 22:21:30,935 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:21:30,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2019-11-15 22:21:31,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 3339. [2019-11-15 22:21:31,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3339 states. [2019-11-15 22:21:31,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3339 states to 3339 states and 4983 transitions. [2019-11-15 22:21:31,011 INFO L78 Accepts]: Start accepts. Automaton has 3339 states and 4983 transitions. Word has length 393 [2019-11-15 22:21:31,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:31,012 INFO L462 AbstractCegarLoop]: Abstraction has 3339 states and 4983 transitions. [2019-11-15 22:21:31,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:21:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4983 transitions. [2019-11-15 22:21:31,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-11-15 22:21:31,019 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:31,019 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:31,019 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:31,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:31,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1115815448, now seen corresponding path program 1 times [2019-11-15 22:21:31,020 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:31,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913081238] [2019-11-15 22:21:31,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:31,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:31,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:31,242 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:21:31,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913081238] [2019-11-15 22:21:31,242 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:31,243 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:21:31,243 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115608674] [2019-11-15 22:21:31,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:21:31,244 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:31,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:21:31,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:21:31,244 INFO L87 Difference]: Start difference. First operand 3339 states and 4983 transitions. Second operand 3 states. [2019-11-15 22:21:31,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:31,366 INFO L93 Difference]: Finished difference Result 6962 states and 10411 transitions. [2019-11-15 22:21:31,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:21:31,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 433 [2019-11-15 22:21:31,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:31,374 INFO L225 Difference]: With dead ends: 6962 [2019-11-15 22:21:31,374 INFO L226 Difference]: Without dead ends: 3642 [2019-11-15 22:21:31,378 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:21:31,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3642 states. [2019-11-15 22:21:31,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3642 to 3642. [2019-11-15 22:21:31,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3642 states. [2019-11-15 22:21:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 3642 states and 5442 transitions. [2019-11-15 22:21:31,469 INFO L78 Accepts]: Start accepts. Automaton has 3642 states and 5442 transitions. Word has length 433 [2019-11-15 22:21:31,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:31,470 INFO L462 AbstractCegarLoop]: Abstraction has 3642 states and 5442 transitions. [2019-11-15 22:21:31,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:21:31,471 INFO L276 IsEmpty]: Start isEmpty. Operand 3642 states and 5442 transitions. [2019-11-15 22:21:31,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2019-11-15 22:21:31,480 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:31,480 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, 1, 1] [2019-11-15 22:21:31,481 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:31,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:31,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1862736238, now seen corresponding path program 1 times [2019-11-15 22:21:31,482 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:31,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177236483] [2019-11-15 22:21:31,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:31,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:31,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:31,831 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:21:31,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177236483] [2019-11-15 22:21:31,832 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:31,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:21:31,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58012887] [2019-11-15 22:21:31,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:21:31,834 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:31,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:21:31,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:21:31,836 INFO L87 Difference]: Start difference. First operand 3642 states and 5442 transitions. Second operand 3 states. [2019-11-15 22:21:31,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:31,992 INFO L93 Difference]: Finished difference Result 7568 states and 11329 transitions. [2019-11-15 22:21:31,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:21:31,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 475 [2019-11-15 22:21:31,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:31,998 INFO L225 Difference]: With dead ends: 7568 [2019-11-15 22:21:31,998 INFO L226 Difference]: Without dead ends: 3945 [2019-11-15 22:21:32,002 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:21:32,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3945 states. [2019-11-15 22:21:32,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3945 to 3945. [2019-11-15 22:21:32,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3945 states. [2019-11-15 22:21:32,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3945 states to 3945 states and 5902 transitions. [2019-11-15 22:21:32,092 INFO L78 Accepts]: Start accepts. Automaton has 3945 states and 5902 transitions. Word has length 475 [2019-11-15 22:21:32,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:32,093 INFO L462 AbstractCegarLoop]: Abstraction has 3945 states and 5902 transitions. [2019-11-15 22:21:32,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:21:32,094 INFO L276 IsEmpty]: Start isEmpty. Operand 3945 states and 5902 transitions. [2019-11-15 22:21:32,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2019-11-15 22:21:32,101 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:32,102 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, 1, 1] [2019-11-15 22:21:32,102 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:32,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:32,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1206695999, now seen corresponding path program 1 times [2019-11-15 22:21:32,103 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:32,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809502065] [2019-11-15 22:21:32,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:32,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:32,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:32,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 2135 trivial. 0 not checked. [2019-11-15 22:21:32,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809502065] [2019-11-15 22:21:32,388 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:32,388 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:21:32,388 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45992386] [2019-11-15 22:21:32,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:21:32,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:32,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:21:32,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:21:32,390 INFO L87 Difference]: Start difference. First operand 3945 states and 5902 transitions. Second operand 3 states. [2019-11-15 22:21:32,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:32,635 INFO L93 Difference]: Finished difference Result 8168 states and 12240 transitions. [2019-11-15 22:21:32,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:21:32,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 519 [2019-11-15 22:21:32,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:32,641 INFO L225 Difference]: With dead ends: 8168 [2019-11-15 22:21:32,643 INFO L226 Difference]: Without dead ends: 4242 [2019-11-15 22:21:32,648 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:21:32,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4242 states. [2019-11-15 22:21:32,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4242 to 4242. [2019-11-15 22:21:32,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4242 states. [2019-11-15 22:21:32,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4242 states to 4242 states and 6340 transitions. [2019-11-15 22:21:32,750 INFO L78 Accepts]: Start accepts. Automaton has 4242 states and 6340 transitions. Word has length 519 [2019-11-15 22:21:32,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:32,751 INFO L462 AbstractCegarLoop]: Abstraction has 4242 states and 6340 transitions. [2019-11-15 22:21:32,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:21:32,751 INFO L276 IsEmpty]: Start isEmpty. Operand 4242 states and 6340 transitions. [2019-11-15 22:21:32,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2019-11-15 22:21:32,759 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:32,760 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, 11, 10, 10, 9, 9, 8, 8, 4, 4, 4, 4, 3, 3, 3, 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:21:32,760 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:32,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:32,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1759013079, now seen corresponding path program 1 times [2019-11-15 22:21:32,761 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:32,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728665209] [2019-11-15 22:21:32,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:32,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:32,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:33,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2962 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 2528 trivial. 0 not checked. [2019-11-15 22:21:33,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728665209] [2019-11-15 22:21:33,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:33,066 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:21:33,066 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250076392] [2019-11-15 22:21:33,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:21:33,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:33,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:21:33,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:21:33,068 INFO L87 Difference]: Start difference. First operand 4242 states and 6340 transitions. Second operand 3 states. [2019-11-15 22:21:33,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:33,201 INFO L93 Difference]: Finished difference Result 8768 states and 13125 transitions. [2019-11-15 22:21:33,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:21:33,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 560 [2019-11-15 22:21:33,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:33,208 INFO L225 Difference]: With dead ends: 8768 [2019-11-15 22:21:33,208 INFO L226 Difference]: Without dead ends: 4545 [2019-11-15 22:21:33,212 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:21:33,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4545 states. [2019-11-15 22:21:33,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4545 to 4545. [2019-11-15 22:21:33,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4545 states. [2019-11-15 22:21:33,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4545 states to 4545 states and 6802 transitions. [2019-11-15 22:21:33,315 INFO L78 Accepts]: Start accepts. Automaton has 4545 states and 6802 transitions. Word has length 560 [2019-11-15 22:21:33,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:33,316 INFO L462 AbstractCegarLoop]: Abstraction has 4545 states and 6802 transitions. [2019-11-15 22:21:33,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:21:33,316 INFO L276 IsEmpty]: Start isEmpty. Operand 4545 states and 6802 transitions. [2019-11-15 22:21:33,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2019-11-15 22:21:33,325 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:33,326 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, 12, 11, 11, 10, 10, 9, 9, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:33,326 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:33,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:33,326 INFO L82 PathProgramCache]: Analyzing trace with hash 904347464, now seen corresponding path program 1 times [2019-11-15 22:21:33,327 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:33,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20618400] [2019-11-15 22:21:33,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:33,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:33,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:33,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3434 backedges. 466 proven. 0 refuted. 0 times theorem prover too weak. 2968 trivial. 0 not checked. [2019-11-15 22:21:33,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20618400] [2019-11-15 22:21:33,799 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:33,799 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:21:33,799 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887133273] [2019-11-15 22:21:33,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:21:33,800 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:33,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:21:33,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:21:33,800 INFO L87 Difference]: Start difference. First operand 4545 states and 6802 transitions. Second operand 3 states. [2019-11-15 22:21:33,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:33,927 INFO L93 Difference]: Finished difference Result 9374 states and 14049 transitions. [2019-11-15 22:21:33,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:21:33,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 603 [2019-11-15 22:21:33,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:33,933 INFO L225 Difference]: With dead ends: 9374 [2019-11-15 22:21:33,933 INFO L226 Difference]: Without dead ends: 4848 [2019-11-15 22:21:33,938 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:21:33,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4848 states. [2019-11-15 22:21:34,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4848 to 4848. [2019-11-15 22:21:34,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4848 states. [2019-11-15 22:21:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4848 states to 4848 states and 7265 transitions. [2019-11-15 22:21:34,049 INFO L78 Accepts]: Start accepts. Automaton has 4848 states and 7265 transitions. Word has length 603 [2019-11-15 22:21:34,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:34,050 INFO L462 AbstractCegarLoop]: Abstraction has 4848 states and 7265 transitions. [2019-11-15 22:21:34,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:21:34,050 INFO L276 IsEmpty]: Start isEmpty. Operand 4848 states and 7265 transitions. [2019-11-15 22:21:34,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2019-11-15 22:21:34,059 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:34,060 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:34,060 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:34,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:34,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1356957761, now seen corresponding path program 1 times [2019-11-15 22:21:34,061 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:34,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904931609] [2019-11-15 22:21:34,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:34,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:34,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:34,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3946 backedges. 502 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-11-15 22:21:34,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904931609] [2019-11-15 22:21:34,432 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:34,432 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:21:34,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399163006] [2019-11-15 22:21:34,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:21:34,432 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:34,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:21:34,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:21:34,433 INFO L87 Difference]: Start difference. First operand 4848 states and 7265 transitions. Second operand 3 states. [2019-11-15 22:21:34,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:34,627 INFO L93 Difference]: Finished difference Result 9975 states and 14968 transitions. [2019-11-15 22:21:34,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:21:34,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 648 [2019-11-15 22:21:34,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:34,631 INFO L225 Difference]: With dead ends: 9975 [2019-11-15 22:21:34,631 INFO L226 Difference]: Without dead ends: 5146 [2019-11-15 22:21:34,635 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:21:34,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5146 states. [2019-11-15 22:21:34,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5146 to 5146. [2019-11-15 22:21:34,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5146 states. [2019-11-15 22:21:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5146 states to 5146 states and 7704 transitions. [2019-11-15 22:21:34,787 INFO L78 Accepts]: Start accepts. Automaton has 5146 states and 7704 transitions. Word has length 648 [2019-11-15 22:21:34,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:34,788 INFO L462 AbstractCegarLoop]: Abstraction has 5146 states and 7704 transitions. [2019-11-15 22:21:34,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:21:34,788 INFO L276 IsEmpty]: Start isEmpty. Operand 5146 states and 7704 transitions. [2019-11-15 22:21:34,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2019-11-15 22:21:34,797 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:34,797 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:34,798 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:34,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:34,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1026783708, now seen corresponding path program 1 times [2019-11-15 22:21:34,798 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:34,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97791087] [2019-11-15 22:21:34,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:34,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:34,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4490 backedges. 544 proven. 0 refuted. 0 times theorem prover too weak. 3946 trivial. 0 not checked. [2019-11-15 22:21:35,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97791087] [2019-11-15 22:21:35,212 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:35,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:21:35,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073740148] [2019-11-15 22:21:35,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:21:35,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:35,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:21:35,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:21:35,213 INFO L87 Difference]: Start difference. First operand 5146 states and 7704 transitions. Second operand 3 states. [2019-11-15 22:21:35,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:35,350 INFO L93 Difference]: Finished difference Result 10576 states and 15853 transitions. [2019-11-15 22:21:35,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:21:35,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 690 [2019-11-15 22:21:35,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:35,354 INFO L225 Difference]: With dead ends: 10576 [2019-11-15 22:21:35,355 INFO L226 Difference]: Without dead ends: 5449 [2019-11-15 22:21:35,358 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:21:35,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2019-11-15 22:21:35,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5449. [2019-11-15 22:21:35,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5449 states. [2019-11-15 22:21:35,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8169 transitions. [2019-11-15 22:21:35,450 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8169 transitions. Word has length 690 [2019-11-15 22:21:35,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:35,450 INFO L462 AbstractCegarLoop]: Abstraction has 5449 states and 8169 transitions. [2019-11-15 22:21:35,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:21:35,450 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8169 transitions. [2019-11-15 22:21:35,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2019-11-15 22:21:35,458 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:35,458 INFO L380 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 18, 18, 17, 17, 16, 16, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 7, 7, 5, 5, 4, 4, 4, 4, 4, 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, 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:21:35,459 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:35,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:35,459 INFO L82 PathProgramCache]: Analyzing trace with hash -146753123, now seen corresponding path program 1 times [2019-11-15 22:21:35,460 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:35,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002213527] [2019-11-15 22:21:35,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:35,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:35,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:36,049 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 575 proven. 0 refuted. 0 times theorem prover too weak. 4500 trivial. 0 not checked. [2019-11-15 22:21:36,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002213527] [2019-11-15 22:21:36,049 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:36,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:21:36,050 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232477545] [2019-11-15 22:21:36,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:21:36,050 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:36,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:21:36,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:21:36,050 INFO L87 Difference]: Start difference. First operand 5449 states and 8169 transitions. Second operand 3 states. [2019-11-15 22:21:36,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:36,178 INFO L93 Difference]: Finished difference Result 5754 states and 8637 transitions. [2019-11-15 22:21:36,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:21:36,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 734 [2019-11-15 22:21:36,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:36,182 INFO L225 Difference]: With dead ends: 5754 [2019-11-15 22:21:36,182 INFO L226 Difference]: Without dead ends: 5752 [2019-11-15 22:21:36,183 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:21:36,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5752 states. [2019-11-15 22:21:36,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5752 to 5752. [2019-11-15 22:21:36,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5752 states. [2019-11-15 22:21:36,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5752 states to 5752 states and 8635 transitions. [2019-11-15 22:21:36,272 INFO L78 Accepts]: Start accepts. Automaton has 5752 states and 8635 transitions. Word has length 734 [2019-11-15 22:21:36,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:36,272 INFO L462 AbstractCegarLoop]: Abstraction has 5752 states and 8635 transitions. [2019-11-15 22:21:36,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:21:36,273 INFO L276 IsEmpty]: Start isEmpty. Operand 5752 states and 8635 transitions. [2019-11-15 22:21:36,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2019-11-15 22:21:36,279 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:36,279 INFO L380 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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:21:36,279 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:36,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:36,280 INFO L82 PathProgramCache]: Analyzing trace with hash -727278029, now seen corresponding path program 1 times [2019-11-15 22:21:36,280 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:36,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482904729] [2019-11-15 22:21:36,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:36,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:36,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:37,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5702 backedges. 3167 proven. 162 refuted. 0 times theorem prover too weak. 2373 trivial. 0 not checked. [2019-11-15 22:21:37,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482904729] [2019-11-15 22:21:37,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52615122] [2019-11-15 22:21:37,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/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:21:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:37,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 2474 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-15 22:21:37,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:21:37,990 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:37,991 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:21:37,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:21:38,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:38,028 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:21:38,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:21:38,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:21:38,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:21:38,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:21:38,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:21:38,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:21:38,077 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:21:38,077 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:21:38,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:38,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:21:38,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:21:38,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:21:38,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:21:38,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:21:38,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:21:38,135 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:21:38,136 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:21:38,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:38,207 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 22:21:38,207 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:21:38,208 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:21:38,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:38,227 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:21:38,227 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-15 22:21:38,302 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 22:21:38,303 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:21:38,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:21:38,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:38,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:21:38,321 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 22:21:38,394 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 22:21:38,395 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:21:38,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:21:38,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:38,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:21:38,409 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 22:21:38,419 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_167|]} [2019-11-15 22:21:38,423 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:21:38,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:38,489 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-15 22:21:38,490 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:21:38,490 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:21:38,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:38,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:21:38,500 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-15 22:21:38,546 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 22:21:38,546 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:21:38,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:21:38,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:38,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:21:38,554 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 22:21:38,586 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 22:21:38,587 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:21:38,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:21:38,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:38,594 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:21:38,594 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 22:21:38,605 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 12=[|v_#memory_$Pointer$.base_170|]} [2019-11-15 22:21:38,607 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:21:38,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:38,698 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-15 22:21:38,698 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:21:38,699 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:21:38,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:38,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:21:38,716 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-15 22:21:38,724 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_159|], 12=[|v_#memory_$Pointer$.base_171|]} [2019-11-15 22:21:38,728 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:21:38,729 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:21:38,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:38,860 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-11-15 22:21:38,860 INFO L341 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-11-15 22:21:38,861 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:21:38,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:38,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:38,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:38,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:38,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:38,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:38,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:38,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:38,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:38,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:38,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:38,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:38,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:38,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:38,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:38,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:38,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:38,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:38,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:38,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:38,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:38,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:38,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:38,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:38,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:38,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:38,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:38,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:38,894 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-11-15 22:21:39,005 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2019-11-15 22:21:39,006 INFO L567 ElimStorePlain]: treesize reduction 1115, result has 4.6 percent of original size [2019-11-15 22:21:39,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:21:39,006 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-11-15 22:21:39,012 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_162|], 12=[|v_#memory_$Pointer$.base_172|]} [2019-11-15 22:21:39,015 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:21:39,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:39,101 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-15 22:21:39,101 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:21:39,102 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:21:39,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:39,114 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:21:39,115 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-15 22:21:39,125 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_160|], 12=[|v_#memory_$Pointer$.base_173|]} [2019-11-15 22:21:39,129 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:21:39,129 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:21:39,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:39,276 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-11-15 22:21:39,277 INFO L341 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-11-15 22:21:39,277 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:21:39,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:39,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:39,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:39,281 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:21:39,321 INFO L567 ElimStorePlain]: treesize reduction 156, result has 25.7 percent of original size [2019-11-15 22:21:39,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:21:39,322 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-11-15 22:21:39,325 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:21:39,330 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:21:39,331 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:21:39,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:39,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:21:39,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:21:39,364 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:21:39,364 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:21:39,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:39,382 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:21:39,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:39,404 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:21:39,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:21:39,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:21:39,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:21:39,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:21:39,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:21:39,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:21:39,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:21:39,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:21:39,414 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:21:39,415 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:21:39,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:39,419 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:21:39,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:39,427 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:21:39,427 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:181, output treesize:32 [2019-11-15 22:21:39,504 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 22:21:39,504 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:21:39,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:21:39,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:39,509 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:21:39,509 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-11-15 22:21:40,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5702 backedges. 1785 proven. 91 refuted. 0 times theorem prover too weak. 3826 trivial. 0 not checked. [2019-11-15 22:21:40,546 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:21:40,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-11-15 22:21:40,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780129894] [2019-11-15 22:21:40,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 22:21:40,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:40,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 22:21:40,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:21:40,549 INFO L87 Difference]: Start difference. First operand 5752 states and 8635 transitions. Second operand 12 states. [2019-11-15 22:21:47,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:47,865 INFO L93 Difference]: Finished difference Result 51556 states and 77679 transitions. [2019-11-15 22:21:47,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-15 22:21:47,865 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 780 [2019-11-15 22:21:47,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:47,928 INFO L225 Difference]: With dead ends: 51556 [2019-11-15 22:21:47,928 INFO L226 Difference]: Without dead ends: 45823 [2019-11-15 22:21:47,940 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 825 GetRequests, 788 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=297, Invalid=1109, Unknown=0, NotChecked=0, Total=1406 [2019-11-15 22:21:47,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45823 states. [2019-11-15 22:21:48,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45823 to 25803. [2019-11-15 22:21:48,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25803 states. [2019-11-15 22:21:48,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25803 states to 25803 states and 40505 transitions. [2019-11-15 22:21:48,877 INFO L78 Accepts]: Start accepts. Automaton has 25803 states and 40505 transitions. Word has length 780 [2019-11-15 22:21:48,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:48,878 INFO L462 AbstractCegarLoop]: Abstraction has 25803 states and 40505 transitions. [2019-11-15 22:21:48,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 22:21:48,878 INFO L276 IsEmpty]: Start isEmpty. Operand 25803 states and 40505 transitions. [2019-11-15 22:21:48,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 782 [2019-11-15 22:21:48,916 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:48,918 INFO L380 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 16, 15, 14, 14, 13, 13, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:49,125 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:21:49,125 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:49,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:49,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1978544095, now seen corresponding path program 1 times [2019-11-15 22:21:49,126 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:49,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072201500] [2019-11-15 22:21:49,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:49,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:49,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:49,807 INFO L134 CoverageAnalysis]: Checked inductivity of 5717 backedges. 3232 proven. 0 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-11-15 22:21:49,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072201500] [2019-11-15 22:21:49,808 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:49,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:49,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231750182] [2019-11-15 22:21:49,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:49,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:49,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:49,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:49,810 INFO L87 Difference]: Start difference. First operand 25803 states and 40505 transitions. Second operand 4 states. [2019-11-15 22:21:50,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:50,975 INFO L93 Difference]: Finished difference Result 59364 states and 92948 transitions. [2019-11-15 22:21:50,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:50,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 781 [2019-11-15 22:21:50,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:51,007 INFO L225 Difference]: With dead ends: 59364 [2019-11-15 22:21:51,007 INFO L226 Difference]: Without dead ends: 33580 [2019-11-15 22:21:51,027 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:21:51,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33580 states. [2019-11-15 22:21:51,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33580 to 28919. [2019-11-15 22:21:51,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28919 states. [2019-11-15 22:21:51,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28919 states to 28919 states and 46205 transitions. [2019-11-15 22:21:51,685 INFO L78 Accepts]: Start accepts. Automaton has 28919 states and 46205 transitions. Word has length 781 [2019-11-15 22:21:51,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:51,685 INFO L462 AbstractCegarLoop]: Abstraction has 28919 states and 46205 transitions. [2019-11-15 22:21:51,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:51,685 INFO L276 IsEmpty]: Start isEmpty. Operand 28919 states and 46205 transitions. [2019-11-15 22:21:51,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2019-11-15 22:21:51,714 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:51,714 INFO L380 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 16, 15, 14, 14, 13, 13, 8, 8, 7, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:51,715 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:51,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:51,715 INFO L82 PathProgramCache]: Analyzing trace with hash -195751553, now seen corresponding path program 1 times [2019-11-15 22:21:51,715 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:51,715 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878356295] [2019-11-15 22:21:51,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:51,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:51,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:52,481 INFO L134 CoverageAnalysis]: Checked inductivity of 5732 backedges. 3240 proven. 0 refuted. 0 times theorem prover too weak. 2492 trivial. 0 not checked. [2019-11-15 22:21:52,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878356295] [2019-11-15 22:21:52,482 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:52,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:52,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214932854] [2019-11-15 22:21:52,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:52,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:52,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:52,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:52,484 INFO L87 Difference]: Start difference. First operand 28919 states and 46205 transitions. Second operand 4 states. [2019-11-15 22:21:53,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:53,501 INFO L93 Difference]: Finished difference Result 62423 states and 98515 transitions. [2019-11-15 22:21:53,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:53,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 784 [2019-11-15 22:21:53,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:53,527 INFO L225 Difference]: With dead ends: 62423 [2019-11-15 22:21:53,527 INFO L226 Difference]: Without dead ends: 33523 [2019-11-15 22:21:53,545 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:21:53,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33523 states. [2019-11-15 22:21:54,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33523 to 28995. [2019-11-15 22:21:54,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28995 states. [2019-11-15 22:21:54,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28995 states to 28995 states and 46281 transitions. [2019-11-15 22:21:54,148 INFO L78 Accepts]: Start accepts. Automaton has 28995 states and 46281 transitions. Word has length 784 [2019-11-15 22:21:54,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:54,149 INFO L462 AbstractCegarLoop]: Abstraction has 28995 states and 46281 transitions. [2019-11-15 22:21:54,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:54,149 INFO L276 IsEmpty]: Start isEmpty. Operand 28995 states and 46281 transitions. [2019-11-15 22:21:54,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2019-11-15 22:21:54,177 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:54,178 INFO L380 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 16, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:54,178 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:54,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:54,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1276910757, now seen corresponding path program 1 times [2019-11-15 22:21:54,179 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:54,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968362713] [2019-11-15 22:21:54,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:54,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:54,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:54,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5744 backedges. 1876 proven. 0 refuted. 0 times theorem prover too weak. 3868 trivial. 0 not checked. [2019-11-15 22:21:54,866 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968362713] [2019-11-15 22:21:54,867 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:54,867 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:21:54,867 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858633469] [2019-11-15 22:21:54,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:21:54,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:54,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:21:54,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:21:54,869 INFO L87 Difference]: Start difference. First operand 28995 states and 46281 transitions. Second operand 5 states. [2019-11-15 22:21:56,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:56,275 INFO L93 Difference]: Finished difference Result 63405 states and 101104 transitions. [2019-11-15 22:21:56,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:21:56,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 784 [2019-11-15 22:21:56,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:56,301 INFO L225 Difference]: With dead ends: 63405 [2019-11-15 22:21:56,301 INFO L226 Difference]: Without dead ends: 34391 [2019-11-15 22:21:56,319 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:21:56,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34391 states. [2019-11-15 22:21:56,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34391 to 31465. [2019-11-15 22:21:56,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31465 states. [2019-11-15 22:21:57,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31465 states to 31465 states and 50689 transitions. [2019-11-15 22:21:57,031 INFO L78 Accepts]: Start accepts. Automaton has 31465 states and 50689 transitions. Word has length 784 [2019-11-15 22:21:57,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:57,032 INFO L462 AbstractCegarLoop]: Abstraction has 31465 states and 50689 transitions. [2019-11-15 22:21:57,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:21:57,032 INFO L276 IsEmpty]: Start isEmpty. Operand 31465 states and 50689 transitions. [2019-11-15 22:21:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2019-11-15 22:21:57,059 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:57,060 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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:21:57,060 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:57,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:57,061 INFO L82 PathProgramCache]: Analyzing trace with hash -55897837, now seen corresponding path program 1 times [2019-11-15 22:21:57,061 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:57,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092478052] [2019-11-15 22:21:57,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:57,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:57,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:57,559 INFO L134 CoverageAnalysis]: Checked inductivity of 5957 backedges. 1684 proven. 0 refuted. 0 times theorem prover too weak. 4273 trivial. 0 not checked. [2019-11-15 22:21:57,559 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092478052] [2019-11-15 22:21:57,559 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:57,560 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:57,560 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002730460] [2019-11-15 22:21:57,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:57,560 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:57,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:57,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:57,561 INFO L87 Difference]: Start difference. First operand 31465 states and 50689 transitions. Second operand 4 states. [2019-11-15 22:21:58,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:21:58,843 INFO L93 Difference]: Finished difference Result 64640 states and 103714 transitions. [2019-11-15 22:21:58,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:21:58,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 790 [2019-11-15 22:21:58,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:21:58,868 INFO L225 Difference]: With dead ends: 64640 [2019-11-15 22:21:58,868 INFO L226 Difference]: Without dead ends: 33194 [2019-11-15 22:21:58,878 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:21:58,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33194 states. [2019-11-15 22:21:59,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33194 to 31465. [2019-11-15 22:21:59,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31465 states. [2019-11-15 22:21:59,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31465 states to 31465 states and 50632 transitions. [2019-11-15 22:21:59,490 INFO L78 Accepts]: Start accepts. Automaton has 31465 states and 50632 transitions. Word has length 790 [2019-11-15 22:21:59,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:21:59,490 INFO L462 AbstractCegarLoop]: Abstraction has 31465 states and 50632 transitions. [2019-11-15 22:21:59,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:21:59,491 INFO L276 IsEmpty]: Start isEmpty. Operand 31465 states and 50632 transitions. [2019-11-15 22:21:59,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2019-11-15 22:21:59,515 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:21:59,515 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 20, 20, 20, 18, 18, 17, 17, 16, 16, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:21:59,515 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:21:59,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:21:59,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1690568080, now seen corresponding path program 1 times [2019-11-15 22:21:59,516 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:21:59,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266811475] [2019-11-15 22:21:59,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:59,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:21:59,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:21:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:21:59,923 INFO L134 CoverageAnalysis]: Checked inductivity of 5926 backedges. 1449 proven. 0 refuted. 0 times theorem prover too weak. 4477 trivial. 0 not checked. [2019-11-15 22:21:59,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266811475] [2019-11-15 22:21:59,924 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:21:59,924 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:21:59,924 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374878299] [2019-11-15 22:21:59,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:21:59,924 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:21:59,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:21:59,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:21:59,925 INFO L87 Difference]: Start difference. First operand 31465 states and 50632 transitions. Second operand 4 states. [2019-11-15 22:22:00,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:00,739 INFO L93 Difference]: Finished difference Result 63899 states and 102746 transitions. [2019-11-15 22:22:00,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:22:00,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 791 [2019-11-15 22:22:00,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:22:00,764 INFO L225 Difference]: With dead ends: 63899 [2019-11-15 22:22:00,764 INFO L226 Difference]: Without dead ends: 32453 [2019-11-15 22:22:00,779 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:22:00,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32453 states. [2019-11-15 22:22:01,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32453 to 31465. [2019-11-15 22:22:01,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31465 states. [2019-11-15 22:22:01,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31465 states to 31465 states and 50556 transitions. [2019-11-15 22:22:01,533 INFO L78 Accepts]: Start accepts. Automaton has 31465 states and 50556 transitions. Word has length 791 [2019-11-15 22:22:01,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:22:01,534 INFO L462 AbstractCegarLoop]: Abstraction has 31465 states and 50556 transitions. [2019-11-15 22:22:01,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:22:01,534 INFO L276 IsEmpty]: Start isEmpty. Operand 31465 states and 50556 transitions. [2019-11-15 22:22:01,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2019-11-15 22:22:01,569 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:01,569 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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:22:01,569 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:22:01,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:01,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1080198468, now seen corresponding path program 1 times [2019-11-15 22:22:01,570 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:01,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762748152] [2019-11-15 22:22:01,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:01,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:01,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:01,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:01,912 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-11-15 22:22:02,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 1705 proven. 0 refuted. 0 times theorem prover too weak. 4273 trivial. 0 not checked. [2019-11-15 22:22:02,224 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762748152] [2019-11-15 22:22:02,225 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:22:02,225 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:22:02,225 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401276857] [2019-11-15 22:22:02,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:22:02,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:22:02,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:22:02,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:22:02,227 INFO L87 Difference]: Start difference. First operand 31465 states and 50556 transitions. Second operand 4 states. [2019-11-15 22:22:03,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:03,369 INFO L93 Difference]: Finished difference Result 64526 states and 103334 transitions. [2019-11-15 22:22:03,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:22:03,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 791 [2019-11-15 22:22:03,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:22:03,397 INFO L225 Difference]: With dead ends: 64526 [2019-11-15 22:22:03,397 INFO L226 Difference]: Without dead ends: 33080 [2019-11-15 22:22:03,412 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:22:03,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33080 states. [2019-11-15 22:22:04,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33080 to 31465. [2019-11-15 22:22:04,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31465 states. [2019-11-15 22:22:04,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31465 states to 31465 states and 50499 transitions. [2019-11-15 22:22:04,057 INFO L78 Accepts]: Start accepts. Automaton has 31465 states and 50499 transitions. Word has length 791 [2019-11-15 22:22:04,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:22:04,057 INFO L462 AbstractCegarLoop]: Abstraction has 31465 states and 50499 transitions. [2019-11-15 22:22:04,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:22:04,057 INFO L276 IsEmpty]: Start isEmpty. Operand 31465 states and 50499 transitions. [2019-11-15 22:22:04,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2019-11-15 22:22:04,082 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:04,083 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 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:22:04,083 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:22:04,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:04,083 INFO L82 PathProgramCache]: Analyzing trace with hash -98047108, now seen corresponding path program 1 times [2019-11-15 22:22:04,083 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:04,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392843246] [2019-11-15 22:22:04,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:04,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:04,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:04,799 INFO L134 CoverageAnalysis]: Checked inductivity of 5999 backedges. 1726 proven. 0 refuted. 0 times theorem prover too weak. 4273 trivial. 0 not checked. [2019-11-15 22:22:04,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392843246] [2019-11-15 22:22:04,799 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:22:04,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:22:04,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522557142] [2019-11-15 22:22:04,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:22:04,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:22:04,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:22:04,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:22:04,802 INFO L87 Difference]: Start difference. First operand 31465 states and 50499 transitions. Second operand 4 states. [2019-11-15 22:22:06,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:06,040 INFO L93 Difference]: Finished difference Result 64469 states and 103163 transitions. [2019-11-15 22:22:06,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:22:06,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 791 [2019-11-15 22:22:06,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:22:06,072 INFO L225 Difference]: With dead ends: 64469 [2019-11-15 22:22:06,072 INFO L226 Difference]: Without dead ends: 33023 [2019-11-15 22:22:06,090 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:22:06,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33023 states. [2019-11-15 22:22:06,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33023 to 31465. [2019-11-15 22:22:06,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31465 states. [2019-11-15 22:22:06,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31465 states to 31465 states and 50442 transitions. [2019-11-15 22:22:06,795 INFO L78 Accepts]: Start accepts. Automaton has 31465 states and 50442 transitions. Word has length 791 [2019-11-15 22:22:06,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:22:06,795 INFO L462 AbstractCegarLoop]: Abstraction has 31465 states and 50442 transitions. [2019-11-15 22:22:06,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:22:06,795 INFO L276 IsEmpty]: Start isEmpty. Operand 31465 states and 50442 transitions. [2019-11-15 22:22:06,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2019-11-15 22:22:06,820 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:06,821 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 20, 20, 18, 18, 17, 17, 16, 16, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:06,821 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:22:06,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:06,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1920727816, now seen corresponding path program 1 times [2019-11-15 22:22:06,822 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:06,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175850663] [2019-11-15 22:22:06,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:06,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:06,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:07,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5946 backedges. 1469 proven. 0 refuted. 0 times theorem prover too weak. 4477 trivial. 0 not checked. [2019-11-15 22:22:07,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175850663] [2019-11-15 22:22:07,215 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:22:07,215 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:22:07,215 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489621381] [2019-11-15 22:22:07,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:22:07,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:22:07,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:22:07,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:22:07,216 INFO L87 Difference]: Start difference. First operand 31465 states and 50442 transitions. Second operand 4 states. [2019-11-15 22:22:08,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:08,118 INFO L93 Difference]: Finished difference Result 63899 states and 102366 transitions. [2019-11-15 22:22:08,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:22:08,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 792 [2019-11-15 22:22:08,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:22:08,143 INFO L225 Difference]: With dead ends: 63899 [2019-11-15 22:22:08,143 INFO L226 Difference]: Without dead ends: 32453 [2019-11-15 22:22:08,157 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:22:08,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32453 states. [2019-11-15 22:22:08,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32453 to 31465. [2019-11-15 22:22:08,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31465 states. [2019-11-15 22:22:08,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31465 states to 31465 states and 50366 transitions. [2019-11-15 22:22:08,925 INFO L78 Accepts]: Start accepts. Automaton has 31465 states and 50366 transitions. Word has length 792 [2019-11-15 22:22:08,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:22:08,925 INFO L462 AbstractCegarLoop]: Abstraction has 31465 states and 50366 transitions. [2019-11-15 22:22:08,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:22:08,925 INFO L276 IsEmpty]: Start isEmpty. Operand 31465 states and 50366 transitions. [2019-11-15 22:22:08,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2019-11-15 22:22:08,961 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:08,962 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:08,962 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:22:08,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:08,962 INFO L82 PathProgramCache]: Analyzing trace with hash -628831017, now seen corresponding path program 1 times [2019-11-15 22:22:08,962 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:08,962 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140900177] [2019-11-15 22:22:08,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:08,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:08,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:09,543 INFO L134 CoverageAnalysis]: Checked inductivity of 5873 backedges. 1600 proven. 0 refuted. 0 times theorem prover too weak. 4273 trivial. 0 not checked. [2019-11-15 22:22:09,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140900177] [2019-11-15 22:22:09,543 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:22:09,544 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:22:09,544 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372281252] [2019-11-15 22:22:09,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:22:09,544 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:22:09,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:22:09,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:22:09,545 INFO L87 Difference]: Start difference. First operand 31465 states and 50366 transitions. Second operand 4 states. [2019-11-15 22:22:10,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:10,429 INFO L93 Difference]: Finished difference Result 47968 states and 76317 transitions. [2019-11-15 22:22:10,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:22:10,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 792 [2019-11-15 22:22:10,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:22:10,454 INFO L225 Difference]: With dead ends: 47968 [2019-11-15 22:22:10,455 INFO L226 Difference]: Without dead ends: 33023 [2019-11-15 22:22:10,465 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:22:10,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33023 states. [2019-11-15 22:22:11,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33023 to 31465. [2019-11-15 22:22:11,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31465 states. [2019-11-15 22:22:11,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31465 states to 31465 states and 50309 transitions. [2019-11-15 22:22:11,109 INFO L78 Accepts]: Start accepts. Automaton has 31465 states and 50309 transitions. Word has length 792 [2019-11-15 22:22:11,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:22:11,110 INFO L462 AbstractCegarLoop]: Abstraction has 31465 states and 50309 transitions. [2019-11-15 22:22:11,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:22:11,110 INFO L276 IsEmpty]: Start isEmpty. Operand 31465 states and 50309 transitions. [2019-11-15 22:22:11,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 794 [2019-11-15 22:22:11,138 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:11,139 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 20, 18, 18, 17, 17, 16, 16, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:11,139 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:22:11,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:11,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1099963125, now seen corresponding path program 1 times [2019-11-15 22:22:11,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:11,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646746984] [2019-11-15 22:22:11,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:11,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:11,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:11,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5966 backedges. 1489 proven. 0 refuted. 0 times theorem prover too weak. 4477 trivial. 0 not checked. [2019-11-15 22:22:11,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646746984] [2019-11-15 22:22:11,701 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:22:11,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:22:11,701 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157309408] [2019-11-15 22:22:11,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:22:11,702 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:22:11,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:22:11,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:22:11,703 INFO L87 Difference]: Start difference. First operand 31465 states and 50309 transitions. Second operand 4 states. [2019-11-15 22:22:12,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:12,963 INFO L93 Difference]: Finished difference Result 63671 states and 101812 transitions. [2019-11-15 22:22:12,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:22:12,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 793 [2019-11-15 22:22:12,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:22:12,992 INFO L225 Difference]: With dead ends: 63671 [2019-11-15 22:22:12,992 INFO L226 Difference]: Without dead ends: 32225 [2019-11-15 22:22:13,001 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:22:13,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32225 states. [2019-11-15 22:22:13,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32225 to 31465. [2019-11-15 22:22:13,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31465 states. [2019-11-15 22:22:13,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31465 states to 31465 states and 50233 transitions. [2019-11-15 22:22:13,662 INFO L78 Accepts]: Start accepts. Automaton has 31465 states and 50233 transitions. Word has length 793 [2019-11-15 22:22:13,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:22:13,662 INFO L462 AbstractCegarLoop]: Abstraction has 31465 states and 50233 transitions. [2019-11-15 22:22:13,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:22:13,662 INFO L276 IsEmpty]: Start isEmpty. Operand 31465 states and 50233 transitions. [2019-11-15 22:22:13,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 794 [2019-11-15 22:22:13,687 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:13,687 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:13,687 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:22:13,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:13,688 INFO L82 PathProgramCache]: Analyzing trace with hash 2081306368, now seen corresponding path program 1 times [2019-11-15 22:22:13,688 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:13,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348881078] [2019-11-15 22:22:13,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:13,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:13,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:14,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5894 backedges. 1621 proven. 0 refuted. 0 times theorem prover too weak. 4273 trivial. 0 not checked. [2019-11-15 22:22:14,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348881078] [2019-11-15 22:22:14,069 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:22:14,070 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:22:14,070 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468062400] [2019-11-15 22:22:14,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:22:14,070 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:22:14,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:22:14,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:22:14,070 INFO L87 Difference]: Start difference. First operand 31465 states and 50233 transitions. Second operand 4 states. [2019-11-15 22:22:14,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:14,949 INFO L93 Difference]: Finished difference Result 47968 states and 76127 transitions. [2019-11-15 22:22:14,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:22:14,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 793 [2019-11-15 22:22:14,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:22:14,975 INFO L225 Difference]: With dead ends: 47968 [2019-11-15 22:22:14,975 INFO L226 Difference]: Without dead ends: 33023 [2019-11-15 22:22:14,986 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:22:15,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33023 states. [2019-11-15 22:22:15,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33023 to 31465. [2019-11-15 22:22:15,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31465 states. [2019-11-15 22:22:15,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31465 states to 31465 states and 50176 transitions. [2019-11-15 22:22:15,632 INFO L78 Accepts]: Start accepts. Automaton has 31465 states and 50176 transitions. Word has length 793 [2019-11-15 22:22:15,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:22:15,632 INFO L462 AbstractCegarLoop]: Abstraction has 31465 states and 50176 transitions. [2019-11-15 22:22:15,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:22:15,632 INFO L276 IsEmpty]: Start isEmpty. Operand 31465 states and 50176 transitions. [2019-11-15 22:22:15,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 795 [2019-11-15 22:22:15,656 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:15,656 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:15,657 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:22:15,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:15,657 INFO L82 PathProgramCache]: Analyzing trace with hash 318309116, now seen corresponding path program 1 times [2019-11-15 22:22:15,657 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:15,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744302771] [2019-11-15 22:22:15,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:15,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:15,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:16,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5915 backedges. 1642 proven. 0 refuted. 0 times theorem prover too weak. 4273 trivial. 0 not checked. [2019-11-15 22:22:16,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744302771] [2019-11-15 22:22:16,073 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:22:16,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:22:16,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346211256] [2019-11-15 22:22:16,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:22:16,074 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:22:16,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:22:16,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:22:16,075 INFO L87 Difference]: Start difference. First operand 31465 states and 50176 transitions. Second operand 4 states. [2019-11-15 22:22:17,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:17,185 INFO L93 Difference]: Finished difference Result 47968 states and 76051 transitions. [2019-11-15 22:22:17,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:22:17,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 794 [2019-11-15 22:22:17,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:22:17,211 INFO L225 Difference]: With dead ends: 47968 [2019-11-15 22:22:17,211 INFO L226 Difference]: Without dead ends: 33023 [2019-11-15 22:22:17,219 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:22:17,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33023 states. [2019-11-15 22:22:17,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33023 to 31465. [2019-11-15 22:22:17,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31465 states. [2019-11-15 22:22:17,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31465 states to 31465 states and 50119 transitions. [2019-11-15 22:22:17,951 INFO L78 Accepts]: Start accepts. Automaton has 31465 states and 50119 transitions. Word has length 794 [2019-11-15 22:22:17,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:22:17,951 INFO L462 AbstractCegarLoop]: Abstraction has 31465 states and 50119 transitions. [2019-11-15 22:22:17,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:22:17,952 INFO L276 IsEmpty]: Start isEmpty. Operand 31465 states and 50119 transitions. [2019-11-15 22:22:17,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2019-11-15 22:22:17,980 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:17,980 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:17,981 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:22:17,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:17,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1622058885, now seen corresponding path program 1 times [2019-11-15 22:22:17,981 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:17,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023038125] [2019-11-15 22:22:17,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:17,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:17,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:18,548 INFO L134 CoverageAnalysis]: Checked inductivity of 5936 backedges. 1663 proven. 0 refuted. 0 times theorem prover too weak. 4273 trivial. 0 not checked. [2019-11-15 22:22:18,549 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023038125] [2019-11-15 22:22:18,549 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:22:18,549 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:22:18,550 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437576461] [2019-11-15 22:22:18,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:22:18,551 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:22:18,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:22:18,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:22:18,551 INFO L87 Difference]: Start difference. First operand 31465 states and 50119 transitions. Second operand 4 states. [2019-11-15 22:22:19,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:19,820 INFO L93 Difference]: Finished difference Result 47778 states and 75747 transitions. [2019-11-15 22:22:19,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:22:19,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 795 [2019-11-15 22:22:19,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:22:19,848 INFO L225 Difference]: With dead ends: 47778 [2019-11-15 22:22:19,848 INFO L226 Difference]: Without dead ends: 32833 [2019-11-15 22:22:19,859 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:22:19,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32833 states. [2019-11-15 22:22:20,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32833 to 31465. [2019-11-15 22:22:20,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31465 states. [2019-11-15 22:22:20,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31465 states to 31465 states and 50062 transitions. [2019-11-15 22:22:20,536 INFO L78 Accepts]: Start accepts. Automaton has 31465 states and 50062 transitions. Word has length 795 [2019-11-15 22:22:20,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:22:20,536 INFO L462 AbstractCegarLoop]: Abstraction has 31465 states and 50062 transitions. [2019-11-15 22:22:20,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:22:20,537 INFO L276 IsEmpty]: Start isEmpty. Operand 31465 states and 50062 transitions. [2019-11-15 22:22:20,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 797 [2019-11-15 22:22:20,562 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:20,563 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:20,563 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:22:20,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:20,563 INFO L82 PathProgramCache]: Analyzing trace with hash -574305234, now seen corresponding path program 1 times [2019-11-15 22:22:20,563 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:20,563 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259017784] [2019-11-15 22:22:20,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:20,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:20,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 5957 backedges. 2037 proven. 0 refuted. 0 times theorem prover too weak. 3920 trivial. 0 not checked. [2019-11-15 22:22:20,943 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259017784] [2019-11-15 22:22:20,944 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:22:20,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:22:20,944 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038417414] [2019-11-15 22:22:20,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:22:20,944 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:22:20,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:22:20,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:22:20,945 INFO L87 Difference]: Start difference. First operand 31465 states and 50062 transitions. Second operand 4 states. [2019-11-15 22:22:22,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:22,114 INFO L93 Difference]: Finished difference Result 67775 states and 107806 transitions. [2019-11-15 22:22:22,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:22:22,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 796 [2019-11-15 22:22:22,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:22:22,143 INFO L225 Difference]: With dead ends: 67775 [2019-11-15 22:22:22,143 INFO L226 Difference]: Without dead ends: 36329 [2019-11-15 22:22:22,157 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:22:22,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36329 states. [2019-11-15 22:22:22,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36329 to 31427. [2019-11-15 22:22:22,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31427 states. [2019-11-15 22:22:22,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31427 states to 31427 states and 49986 transitions. [2019-11-15 22:22:22,850 INFO L78 Accepts]: Start accepts. Automaton has 31427 states and 49986 transitions. Word has length 796 [2019-11-15 22:22:22,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:22:22,851 INFO L462 AbstractCegarLoop]: Abstraction has 31427 states and 49986 transitions. [2019-11-15 22:22:22,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:22:22,851 INFO L276 IsEmpty]: Start isEmpty. Operand 31427 states and 49986 transitions. [2019-11-15 22:22:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 798 [2019-11-15 22:22:22,874 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:22,874 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:22,874 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:22:22,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:22,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1011192769, now seen corresponding path program 1 times [2019-11-15 22:22:22,875 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:22,875 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807628974] [2019-11-15 22:22:22,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:22,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:22,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:23,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5999 backedges. 2084 proven. 0 refuted. 0 times theorem prover too weak. 3915 trivial. 0 not checked. [2019-11-15 22:22:23,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807628974] [2019-11-15 22:22:23,348 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:22:23,348 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:22:23,348 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509653641] [2019-11-15 22:22:23,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:22:23,349 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:22:23,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:22:23,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:22:23,349 INFO L87 Difference]: Start difference. First operand 31427 states and 49986 transitions. Second operand 4 states. [2019-11-15 22:22:24,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:24,495 INFO L93 Difference]: Finished difference Result 67363 states and 105925 transitions. [2019-11-15 22:22:24,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:22:24,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 797 [2019-11-15 22:22:24,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:22:24,526 INFO L225 Difference]: With dead ends: 67363 [2019-11-15 22:22:24,526 INFO L226 Difference]: Without dead ends: 35955 [2019-11-15 22:22:24,541 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:22:24,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35955 states. [2019-11-15 22:22:25,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35955 to 31427. [2019-11-15 22:22:25,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31427 states. [2019-11-15 22:22:25,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31427 states to 31427 states and 49910 transitions. [2019-11-15 22:22:25,250 INFO L78 Accepts]: Start accepts. Automaton has 31427 states and 49910 transitions. Word has length 797 [2019-11-15 22:22:25,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:22:25,250 INFO L462 AbstractCegarLoop]: Abstraction has 31427 states and 49910 transitions. [2019-11-15 22:22:25,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:22:25,250 INFO L276 IsEmpty]: Start isEmpty. Operand 31427 states and 49910 transitions. [2019-11-15 22:22:25,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 799 [2019-11-15 22:22:25,278 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:25,279 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 16, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:25,279 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:22:25,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:25,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1416642851, now seen corresponding path program 1 times [2019-11-15 22:22:25,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:25,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217866249] [2019-11-15 22:22:25,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:25,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:25,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:26,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6014 backedges. 2099 proven. 0 refuted. 0 times theorem prover too weak. 3915 trivial. 0 not checked. [2019-11-15 22:22:26,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217866249] [2019-11-15 22:22:26,208 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:22:26,208 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:22:26,208 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129360797] [2019-11-15 22:22:26,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:22:26,209 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:22:26,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:22:26,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:22:26,210 INFO L87 Difference]: Start difference. First operand 31427 states and 49910 transitions. Second operand 4 states. [2019-11-15 22:22:27,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:27,681 INFO L93 Difference]: Finished difference Result 66907 states and 105141 transitions. [2019-11-15 22:22:27,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:22:27,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 798 [2019-11-15 22:22:27,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:22:27,713 INFO L225 Difference]: With dead ends: 66907 [2019-11-15 22:22:27,714 INFO L226 Difference]: Without dead ends: 35499 [2019-11-15 22:22:27,730 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:22:27,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35499 states. [2019-11-15 22:22:28,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35499 to 31427. [2019-11-15 22:22:28,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31427 states. [2019-11-15 22:22:28,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31427 states to 31427 states and 49834 transitions. [2019-11-15 22:22:28,475 INFO L78 Accepts]: Start accepts. Automaton has 31427 states and 49834 transitions. Word has length 798 [2019-11-15 22:22:28,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:22:28,476 INFO L462 AbstractCegarLoop]: Abstraction has 31427 states and 49834 transitions. [2019-11-15 22:22:28,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:22:28,476 INFO L276 IsEmpty]: Start isEmpty. Operand 31427 states and 49834 transitions. [2019-11-15 22:22:28,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 799 [2019-11-15 22:22:28,502 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:28,503 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:28,503 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:22:28,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:28,503 INFO L82 PathProgramCache]: Analyzing trace with hash -602133198, now seen corresponding path program 1 times [2019-11-15 22:22:28,504 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:22:28,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124980435] [2019-11-15 22:22:28,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:28,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:22:28,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:22:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:29,279 INFO L134 CoverageAnalysis]: Checked inductivity of 5873 backedges. 2223 proven. 54 refuted. 0 times theorem prover too weak. 3596 trivial. 0 not checked. [2019-11-15 22:22:29,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124980435] [2019-11-15 22:22:29,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35540875] [2019-11-15 22:22:29,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/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:22:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:29,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 2531 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:22:29,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:22:29,738 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_175|, |v_#memory_$Pointer$.offset_161|], 5=[|v_#memory_int_179|]} [2019-11-15 22:22:29,743 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 81 treesize of output 63 [2019-11-15 22:22:29,743 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:22:29,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:22:29,749 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 51 [2019-11-15 22:22:29,750 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:22:29,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:22:29,786 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:22:29,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 141 [2019-11-15 22:22:29,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:22:29,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:22:29,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:22:29,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:22:29,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:22:29,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:22:29,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:22:29,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:22:29,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:22:29,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:22:29,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:22:29,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:22:30,002 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:22:30,003 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.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) 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) [2019-11-15 22:22:30,006 INFO L168 Benchmark]: Toolchain (without parser) took 88945.42 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 939.4 MB in the beginning and 1.9 GB in the end (delta: -1.0 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2019-11-15 22:22:30,006 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:22:30,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 903.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -176.9 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:22:30,006 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:22:30,007 INFO L168 Benchmark]: Boogie Preprocessor took 92.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:22:30,007 INFO L168 Benchmark]: RCFGBuilder took 1176.89 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: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:22:30,007 INFO L168 Benchmark]: TraceAbstraction took 86655.26 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: -940.3 MB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2019-11-15 22:22:30,009 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 903.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -176.9 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 111.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 92.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1176.89 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: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 86655.26 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: -940.3 MB). Peak memory consumption was 2.9 GB. 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... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 22:22:32,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:22:32,273 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:22:32,284 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:22:32,284 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:22:32,285 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:22:32,287 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:22:32,288 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:22:32,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:22:32,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:22:32,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:22:32,300 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:22:32,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:22:32,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:22:32,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:22:32,306 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:22:32,308 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:22:32,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:22:32,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:22:32,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:22:32,321 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:22:32,324 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:22:32,325 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:22:32,327 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:22:32,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:22:32,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:22:32,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:22:32,333 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:22:32,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:22:32,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:22:32,335 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:22:32,336 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:22:32,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:22:32,337 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:22:32,338 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:22:32,338 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:22:32,339 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:22:32,339 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:22:32,339 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:22:32,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:22:32,341 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:22:32,342 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 22:22:32,355 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:22:32,355 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:22:32,356 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:22:32,357 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:22:32,357 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:22:32,357 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:22:32,357 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:22:32,358 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:22:32,358 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:22:32,358 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:22:32,358 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:22:32,359 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:22:32,359 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 22:22:32,359 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 22:22:32,359 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:22:32,359 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:22:32,360 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:22:32,360 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:22:32,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:22:32,360 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:22:32,361 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:22:32,361 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:22:32,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:22:32,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:22:32,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:22:32,362 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:22:32,362 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 22:22:32,362 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 22:22:32,363 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:22:32,363 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 22:22:32,373 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_c4b1e14d-5454-4612-8714-05bff9a2163e/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 -> cc19bcc101ef1dd198c78f620192eb69b4a92f44 [2019-11-15 22:22:32,416 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:22:32,427 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:22:32,430 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:22:32,431 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:22:32,432 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:22:32,433 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.06.i.cil-2.c [2019-11-15 22:22:32,485 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/bin/uautomizer/data/a2e3793db/05c2b7a9153848a88d5b1cb7d5b119cf/FLAGc2a9ed429 [2019-11-15 22:22:33,017 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:22:33,018 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/sv-benchmarks/c/ssh/s3_srvr.blast.06.i.cil-2.c [2019-11-15 22:22:33,048 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/bin/uautomizer/data/a2e3793db/05c2b7a9153848a88d5b1cb7d5b119cf/FLAGc2a9ed429 [2019-11-15 22:22:33,508 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/bin/uautomizer/data/a2e3793db/05c2b7a9153848a88d5b1cb7d5b119cf [2019-11-15 22:22:33,510 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:22:33,511 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:22:33,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:22:33,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:22:33,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:22:33,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:22:33" (1/1) ... [2019-11-15 22:22:33,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ddde614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:33, skipping insertion in model container [2019-11-15 22:22:33,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:22:33" (1/1) ... [2019-11-15 22:22:33,524 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:22:33,589 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:22:34,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:22:34,119 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:22:34,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:22:34,313 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:22:34,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:34 WrapperNode [2019-11-15 22:22:34,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:22:34,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:22:34,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:22:34,315 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:22:34,322 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:22:34" (1/1) ... [2019-11-15 22:22:34,366 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:22:34" (1/1) ... [2019-11-15 22:22:34,430 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:22:34,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:22:34,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:22:34,437 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:22:34,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:34" (1/1) ... [2019-11-15 22:22:34,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:34" (1/1) ... [2019-11-15 22:22:34,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:34" (1/1) ... [2019-11-15 22:22:34,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:34" (1/1) ... [2019-11-15 22:22:34,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:34" (1/1) ... [2019-11-15 22:22:34,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:22:34" (1/1) ... [2019-11-15 22:22:34,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:34" (1/1) ... [2019-11-15 22:22:34,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:22:34,565 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:22:34,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:22:34,565 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:22:34,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/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:22:34,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:22:34,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:22:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 22:22:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:22:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:22:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:22:34,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:22:34,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 22:22:34,950 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 22:22:38,885 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 22:22:38,885 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 22:22:38,887 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:22:38,888 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:22:38,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:22:38 BoogieIcfgContainer [2019-11-15 22:22:38,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:22:38,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:22:38,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:22:38,894 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:22:38,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:22:33" (1/3) ... [2019-11-15 22:22:38,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cbae5af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:22:38, skipping insertion in model container [2019-11-15 22:22:38,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:22:34" (2/3) ... [2019-11-15 22:22:38,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cbae5af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:22:38, skipping insertion in model container [2019-11-15 22:22:38,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:22:38" (3/3) ... [2019-11-15 22:22:38,899 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.06.i.cil-2.c [2019-11-15 22:22:38,908 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:22:38,918 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:22:38,928 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:22:38,957 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:22:38,957 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:22:38,957 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:22:38,957 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:22:38,958 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:22:38,958 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:22:38,958 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:22:38,958 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:22:38,984 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2019-11-15 22:22:39,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 22:22:39,003 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:39,004 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:22:39,005 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:22:39,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:39,011 INFO L82 PathProgramCache]: Analyzing trace with hash -635828374, now seen corresponding path program 1 times [2019-11-15 22:22:39,024 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:22:39,024 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1678008105] [2019-11-15 22:22:39,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/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:22:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:39,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:22:39,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:22:39,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:22:39,352 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:22:39,383 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:22:39,384 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1678008105] [2019-11-15 22:22:39,385 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:22:39,385 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:22:39,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92895729] [2019-11-15 22:22:39,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:22:39,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:22:39,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:22:39,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:22:39,407 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 4 states. [2019-11-15 22:22:39,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:39,765 INFO L93 Difference]: Finished difference Result 608 states and 1053 transitions. [2019-11-15 22:22:39,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:22:39,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-15 22:22:39,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:22:39,783 INFO L225 Difference]: With dead ends: 608 [2019-11-15 22:22:39,783 INFO L226 Difference]: Without dead ends: 417 [2019-11-15 22:22:39,787 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 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:22:39,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-11-15 22:22:39,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2019-11-15 22:22:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-11-15 22:22:39,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 641 transitions. [2019-11-15 22:22:39,889 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 641 transitions. Word has length 45 [2019-11-15 22:22:39,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:22:39,890 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 641 transitions. [2019-11-15 22:22:39,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:22:39,890 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 641 transitions. [2019-11-15 22:22:39,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-15 22:22:39,901 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:39,902 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, 1, 1, 1, 1] [2019-11-15 22:22:40,104 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:22:40,110 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:22:40,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:40,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1145622847, now seen corresponding path program 1 times [2019-11-15 22:22:40,111 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:22:40,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1993365921] [2019-11-15 22:22:40,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/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:22:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:40,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:22:40,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:22:40,384 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:22:40,384 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:22:40,421 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:22:40,422 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1993365921] [2019-11-15 22:22:40,422 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:22:40,423 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:22:40,423 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824676806] [2019-11-15 22:22:40,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:22:40,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:22:40,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:22:40,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:22:40,427 INFO L87 Difference]: Start difference. First operand 417 states and 641 transitions. Second operand 4 states. [2019-11-15 22:22:41,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:41,365 INFO L93 Difference]: Finished difference Result 958 states and 1503 transitions. [2019-11-15 22:22:41,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:22:41,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-15 22:22:41,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:22:41,372 INFO L225 Difference]: With dead ends: 958 [2019-11-15 22:22:41,372 INFO L226 Difference]: Without dead ends: 685 [2019-11-15 22:22:41,380 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 212 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:22:41,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-11-15 22:22:41,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2019-11-15 22:22:41,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-11-15 22:22:41,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1046 transitions. [2019-11-15 22:22:41,445 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1046 transitions. Word has length 108 [2019-11-15 22:22:41,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:22:41,448 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 1046 transitions. [2019-11-15 22:22:41,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:22:41,452 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1046 transitions. [2019-11-15 22:22:41,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-15 22:22:41,457 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:41,458 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, 1, 1, 1, 1, 1, 1] [2019-11-15 22:22:41,663 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:22:41,664 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:22:41,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:41,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1801355127, now seen corresponding path program 1 times [2019-11-15 22:22:41,669 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:22:41,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [221353023] [2019-11-15 22:22:41,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/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:22:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:42,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:22:42,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:22:42,110 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:22:42,110 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:22:42,168 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:22:42,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [221353023] [2019-11-15 22:22:42,169 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:22:42,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:22:42,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691408984] [2019-11-15 22:22:42,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:22:42,172 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:22:42,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:22:42,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:22:42,172 INFO L87 Difference]: Start difference. First operand 685 states and 1046 transitions. Second operand 4 states. [2019-11-15 22:22:44,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:44,098 INFO L93 Difference]: Finished difference Result 1497 states and 2316 transitions. [2019-11-15 22:22:44,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:22:44,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-11-15 22:22:44,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:22:44,105 INFO L225 Difference]: With dead ends: 1497 [2019-11-15 22:22:44,105 INFO L226 Difference]: Without dead ends: 956 [2019-11-15 22:22:44,107 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 344 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:22:44,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2019-11-15 22:22:44,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 956. [2019-11-15 22:22:44,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-11-15 22:22:44,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1454 transitions. [2019-11-15 22:22:44,144 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1454 transitions. Word has length 174 [2019-11-15 22:22:44,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:22:44,145 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 1454 transitions. [2019-11-15 22:22:44,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:22:44,145 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1454 transitions. [2019-11-15 22:22:44,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-15 22:22:44,150 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:44,150 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, 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:22:44,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:22:44,365 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:22:44,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:44,366 INFO L82 PathProgramCache]: Analyzing trace with hash -859904317, now seen corresponding path program 1 times [2019-11-15 22:22:44,367 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:22:44,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [629475460] [2019-11-15 22:22:44,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/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:22:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:44,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:22:44,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:22:44,744 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-11-15 22:22:44,744 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:22:44,883 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-11-15 22:22:44,884 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [629475460] [2019-11-15 22:22:44,884 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:22:44,884 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:22:44,885 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235618572] [2019-11-15 22:22:44,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:22:44,894 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:22:44,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:22:44,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:22:44,895 INFO L87 Difference]: Start difference. First operand 956 states and 1454 transitions. Second operand 4 states. [2019-11-15 22:22:45,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:45,671 INFO L93 Difference]: Finished difference Result 2037 states and 3127 transitions. [2019-11-15 22:22:45,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:22:45,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-11-15 22:22:45,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:22:45,679 INFO L225 Difference]: With dead ends: 2037 [2019-11-15 22:22:45,679 INFO L226 Difference]: Without dead ends: 1225 [2019-11-15 22:22:45,682 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 476 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:22:45,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2019-11-15 22:22:45,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2019-11-15 22:22:45,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2019-11-15 22:22:45,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1857 transitions. [2019-11-15 22:22:45,728 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1857 transitions. Word has length 240 [2019-11-15 22:22:45,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:22:45,730 INFO L462 AbstractCegarLoop]: Abstraction has 1225 states and 1857 transitions. [2019-11-15 22:22:45,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:22:45,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1857 transitions. [2019-11-15 22:22:45,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-11-15 22:22:45,738 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:45,738 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, 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] [2019-11-15 22:22:45,946 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:22:45,946 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:22:45,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:45,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1248575700, now seen corresponding path program 1 times [2019-11-15 22:22:45,947 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:22:45,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1816428952] [2019-11-15 22:22:45,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/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:22:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:46,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:22:46,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:22:46,391 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-11-15 22:22:46,393 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:22:46,485 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-11-15 22:22:46,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1816428952] [2019-11-15 22:22:46,486 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:22:46,486 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:22:46,487 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061408753] [2019-11-15 22:22:46,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:22:46,488 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:22:46,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:22:46,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:22:46,488 INFO L87 Difference]: Start difference. First operand 1225 states and 1857 transitions. Second operand 4 states. [2019-11-15 22:22:48,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:48,264 INFO L93 Difference]: Finished difference Result 2575 states and 3931 transitions. [2019-11-15 22:22:48,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:22:48,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2019-11-15 22:22:48,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:22:48,274 INFO L225 Difference]: With dead ends: 2575 [2019-11-15 22:22:48,274 INFO L226 Difference]: Without dead ends: 1494 [2019-11-15 22:22:48,276 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 624 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:22:48,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2019-11-15 22:22:48,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1494. [2019-11-15 22:22:48,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1494 states. [2019-11-15 22:22:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 2258 transitions. [2019-11-15 22:22:48,366 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 2258 transitions. Word has length 314 [2019-11-15 22:22:48,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:22:48,367 INFO L462 AbstractCegarLoop]: Abstraction has 1494 states and 2258 transitions. [2019-11-15 22:22:48,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:22:48,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 2258 transitions. [2019-11-15 22:22:48,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-11-15 22:22:48,377 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:48,377 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, 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:22:48,580 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:22:48,581 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:22:48,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:48,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1936580360, now seen corresponding path program 1 times [2019-11-15 22:22:48,582 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:22:48,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1020248449] [2019-11-15 22:22:48,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/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:22:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:49,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:22:49,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:22:49,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 727 proven. 0 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2019-11-15 22:22:49,260 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:22:49,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 727 proven. 0 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2019-11-15 22:22:49,434 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1020248449] [2019-11-15 22:22:49,434 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:22:49,435 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:22:49,435 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131322380] [2019-11-15 22:22:49,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:22:49,437 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:22:49,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:22:49,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:22:49,437 INFO L87 Difference]: Start difference. First operand 1494 states and 2258 transitions. Second operand 4 states. [2019-11-15 22:22:51,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:51,446 INFO L93 Difference]: Finished difference Result 3111 states and 4728 transitions. [2019-11-15 22:22:51,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:22:51,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 388 [2019-11-15 22:22:51,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:22:51,457 INFO L225 Difference]: With dead ends: 3111 [2019-11-15 22:22:51,457 INFO L226 Difference]: Without dead ends: 1761 [2019-11-15 22:22:51,459 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 774 GetRequests, 772 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:22:51,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2019-11-15 22:22:51,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1761. [2019-11-15 22:22:51,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1761 states. [2019-11-15 22:22:51,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2655 transitions. [2019-11-15 22:22:51,525 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2655 transitions. Word has length 388 [2019-11-15 22:22:51,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:22:51,526 INFO L462 AbstractCegarLoop]: Abstraction has 1761 states and 2655 transitions. [2019-11-15 22:22:51,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:22:51,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2655 transitions. [2019-11-15 22:22:51,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2019-11-15 22:22:51,537 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:51,538 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, 3, 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] [2019-11-15 22:22:51,741 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:22:51,749 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:22:51,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:51,750 INFO L82 PathProgramCache]: Analyzing trace with hash 968373987, now seen corresponding path program 1 times [2019-11-15 22:22:51,750 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:22:51,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1559801363] [2019-11-15 22:22:51,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/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:22:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:52,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:22:52,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:22:52,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 1045 proven. 0 refuted. 0 times theorem prover too weak. 791 trivial. 0 not checked. [2019-11-15 22:22:52,345 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:22:52,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 1045 proven. 0 refuted. 0 times theorem prover too weak. 791 trivial. 0 not checked. [2019-11-15 22:22:52,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1559801363] [2019-11-15 22:22:52,514 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:22:52,514 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:22:52,514 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12939846] [2019-11-15 22:22:52,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:22:52,515 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:22:52,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:22:52,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:22:52,516 INFO L87 Difference]: Start difference. First operand 1761 states and 2655 transitions. Second operand 4 states. [2019-11-15 22:22:53,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:53,157 INFO L93 Difference]: Finished difference Result 3646 states and 5522 transitions. [2019-11-15 22:22:53,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:22:53,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 461 [2019-11-15 22:22:53,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:22:53,170 INFO L225 Difference]: With dead ends: 3646 [2019-11-15 22:22:53,171 INFO L226 Difference]: Without dead ends: 2029 [2019-11-15 22:22:53,173 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 920 GetRequests, 918 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:22:53,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2019-11-15 22:22:53,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 2029. [2019-11-15 22:22:53,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states. [2019-11-15 22:22:53,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 3051 transitions. [2019-11-15 22:22:53,249 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 3051 transitions. Word has length 461 [2019-11-15 22:22:53,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:22:53,249 INFO L462 AbstractCegarLoop]: Abstraction has 2029 states and 3051 transitions. [2019-11-15 22:22:53,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:22:53,250 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 3051 transitions. [2019-11-15 22:22:53,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2019-11-15 22:22:53,261 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:53,262 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, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 22:22:53,465 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:22:53,465 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:22:53,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:53,465 INFO L82 PathProgramCache]: Analyzing trace with hash 206659388, now seen corresponding path program 1 times [2019-11-15 22:22:53,466 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:22:53,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [132183777] [2019-11-15 22:22:53,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/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:22:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:53,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:22:53,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:22:54,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2217 backedges. 1208 proven. 0 refuted. 0 times theorem prover too weak. 1009 trivial. 0 not checked. [2019-11-15 22:22:54,122 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:22:54,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2217 backedges. 1208 proven. 0 refuted. 0 times theorem prover too weak. 1009 trivial. 0 not checked. [2019-11-15 22:22:54,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [132183777] [2019-11-15 22:22:54,301 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:22:54,301 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:22:54,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469517242] [2019-11-15 22:22:54,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:22:54,303 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:22:54,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:22:54,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:22:54,303 INFO L87 Difference]: Start difference. First operand 2029 states and 3051 transitions. Second operand 4 states. [2019-11-15 22:22:54,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:54,977 INFO L93 Difference]: Finished difference Result 4182 states and 6312 transitions. [2019-11-15 22:22:54,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:22:54,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 507 [2019-11-15 22:22:54,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:22:54,990 INFO L225 Difference]: With dead ends: 4182 [2019-11-15 22:22:54,990 INFO L226 Difference]: Without dead ends: 2297 [2019-11-15 22:22:54,993 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1012 GetRequests, 1010 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:22:54,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2019-11-15 22:22:55,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 2297. [2019-11-15 22:22:55,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2297 states. [2019-11-15 22:22:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2297 states to 2297 states and 3445 transitions. [2019-11-15 22:22:55,077 INFO L78 Accepts]: Start accepts. Automaton has 2297 states and 3445 transitions. Word has length 507 [2019-11-15 22:22:55,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:22:55,078 INFO L462 AbstractCegarLoop]: Abstraction has 2297 states and 3445 transitions. [2019-11-15 22:22:55,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:22:55,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2297 states and 3445 transitions. [2019-11-15 22:22:55,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2019-11-15 22:22:55,085 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:55,086 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, 11, 10, 10, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:22:55,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:22:55,300 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:22:55,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:55,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1411611625, now seen corresponding path program 1 times [2019-11-15 22:22:55,302 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:22:55,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1308962176] [2019-11-15 22:22:55,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/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:22:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:55,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 1210 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:22:55,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:22:56,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3019 backedges. 1631 proven. 0 refuted. 0 times theorem prover too weak. 1388 trivial. 0 not checked. [2019-11-15 22:22:56,099 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:22:56,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3019 backedges. 1631 proven. 0 refuted. 0 times theorem prover too weak. 1388 trivial. 0 not checked. [2019-11-15 22:22:56,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1308962176] [2019-11-15 22:22:56,326 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:22:56,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:22:56,327 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803492075] [2019-11-15 22:22:56,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:22:56,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:22:56,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:22:56,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:22:56,329 INFO L87 Difference]: Start difference. First operand 2297 states and 3445 transitions. Second operand 4 states. [2019-11-15 22:22:57,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:57,176 INFO L93 Difference]: Finished difference Result 4719 states and 7100 transitions. [2019-11-15 22:22:57,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:22:57,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 582 [2019-11-15 22:22:57,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:22:57,191 INFO L225 Difference]: With dead ends: 4719 [2019-11-15 22:22:57,191 INFO L226 Difference]: Without dead ends: 2566 [2019-11-15 22:22:57,195 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1162 GetRequests, 1160 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:22:57,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2019-11-15 22:22:57,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2566. [2019-11-15 22:22:57,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2566 states. [2019-11-15 22:22:57,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3839 transitions. [2019-11-15 22:22:57,296 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3839 transitions. Word has length 582 [2019-11-15 22:22:57,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:22:57,296 INFO L462 AbstractCegarLoop]: Abstraction has 2566 states and 3839 transitions. [2019-11-15 22:22:57,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:22:57,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3839 transitions. [2019-11-15 22:22:57,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2019-11-15 22:22:57,313 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:57,313 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:57,523 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:22:57,523 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:22:57,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:57,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1318961976, now seen corresponding path program 1 times [2019-11-15 22:22:57,525 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:22:57,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1482528552] [2019-11-15 22:22:57,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/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:22:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:22:58,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 1358 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:22:58,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:22:58,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3958 backedges. 2122 proven. 0 refuted. 0 times theorem prover too weak. 1836 trivial. 0 not checked. [2019-11-15 22:22:58,313 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:22:58,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3958 backedges. 2122 proven. 0 refuted. 0 times theorem prover too weak. 1836 trivial. 0 not checked. [2019-11-15 22:22:58,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1482528552] [2019-11-15 22:22:58,570 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:22:58,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 22:22:58,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505388772] [2019-11-15 22:22:58,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:22:58,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:22:58,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:22:58,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:22:58,572 INFO L87 Difference]: Start difference. First operand 2566 states and 3839 transitions. Second operand 3 states. [2019-11-15 22:22:59,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:22:59,282 INFO L93 Difference]: Finished difference Result 5118 states and 7672 transitions. [2019-11-15 22:22:59,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:22:59,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 657 [2019-11-15 22:22:59,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:22:59,296 INFO L225 Difference]: With dead ends: 5118 [2019-11-15 22:22:59,296 INFO L226 Difference]: Without dead ends: 2696 [2019-11-15 22:22:59,300 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1312 GetRequests, 1311 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:22:59,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2019-11-15 22:22:59,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2696. [2019-11-15 22:22:59,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2696 states. [2019-11-15 22:22:59,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 4028 transitions. [2019-11-15 22:22:59,399 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 4028 transitions. Word has length 657 [2019-11-15 22:22:59,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:22:59,400 INFO L462 AbstractCegarLoop]: Abstraction has 2696 states and 4028 transitions. [2019-11-15 22:22:59,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:22:59,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 4028 transitions. [2019-11-15 22:22:59,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2019-11-15 22:22:59,409 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:22:59,409 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:59,618 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:22:59,618 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:22:59,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:22:59,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1556242659, now seen corresponding path program 1 times [2019-11-15 22:22:59,620 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:22:59,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1310715921] [2019-11-15 22:22:59,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:23:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:00,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 1435 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:23:00,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:23:00,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4496 backedges. 2482 proven. 0 refuted. 0 times theorem prover too weak. 2014 trivial. 0 not checked. [2019-11-15 22:23:00,547 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:23:00,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4496 backedges. 2482 proven. 0 refuted. 0 times theorem prover too weak. 2014 trivial. 0 not checked. [2019-11-15 22:23:00,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1310715921] [2019-11-15 22:23:00,967 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:00,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:23:00,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760090169] [2019-11-15 22:23:00,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:23:00,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:23:00,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:23:00,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:23:00,971 INFO L87 Difference]: Start difference. First operand 2696 states and 4028 transitions. Second operand 4 states. [2019-11-15 22:23:01,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:01,860 INFO L93 Difference]: Finished difference Result 5511 states and 8257 transitions. [2019-11-15 22:23:01,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:23:01,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 696 [2019-11-15 22:23:01,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:01,878 INFO L225 Difference]: With dead ends: 5511 [2019-11-15 22:23:01,879 INFO L226 Difference]: Without dead ends: 2959 [2019-11-15 22:23:01,883 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1390 GetRequests, 1388 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:23:01,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2019-11-15 22:23:02,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 2959. [2019-11-15 22:23:02,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2959 states. [2019-11-15 22:23:02,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 4413 transitions. [2019-11-15 22:23:02,017 INFO L78 Accepts]: Start accepts. Automaton has 2959 states and 4413 transitions. Word has length 696 [2019-11-15 22:23:02,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:02,018 INFO L462 AbstractCegarLoop]: Abstraction has 2959 states and 4413 transitions. [2019-11-15 22:23:02,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:23:02,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2959 states and 4413 transitions. [2019-11-15 22:23:02,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2019-11-15 22:23:02,031 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:02,032 INFO L380 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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:23:02,258 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:23:02,258 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:23:02,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:02,259 INFO L82 PathProgramCache]: Analyzing trace with hash 236244657, now seen corresponding path program 1 times [2019-11-15 22:23:02,261 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:23:02,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [562347589] [2019-11-15 22:23:02,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4b1e14d-5454-4612-8714-05bff9a2163e/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:23:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:22,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 1606 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-15 22:23:22,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:23:23,029 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:23:23,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:23,502 WARN L191 SmtUtils]: Spent 468.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-15 22:23:23,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:23,508 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_307|], 2=[|v_#memory_$Pointer$.base_302|, |v_#memory_$Pointer$.base_301|]} [2019-11-15 22:23:23,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:23,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:23,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:23,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:23,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:23,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:23,623 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:23:23,624 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:23,810 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-15 22:23:23,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:23,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:23,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:23,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:23,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:23,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:23,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:23,856 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:23:23,858 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:23,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:23,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:23,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:23,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:23,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:23,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:23,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:23,935 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:23:23,936 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:23,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:23,970 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:23:23,970 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:84, output treesize:14 [2019-11-15 22:23:23,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:23,985 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:23:23,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:23,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:23,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:23,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-11-15 22:23:24,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:24,002 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:23:24,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:24,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:24,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:24,018 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-11-15 22:23:24,031 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:23:24,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:24,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:24,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:24,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:24,062 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:23:24,062 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:24,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:24,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:24,072 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-11-15 22:23:24,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:24,087 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:23:24,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:24,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:24,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:24,100 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-11-15 22:23:24,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:24,110 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:23:24,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:24,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:24,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:24,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-11-15 22:23:24,133 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:23:24,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:24,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:24,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:24,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:24,176 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:23:24,177 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:24,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:24,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:24,191 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-11-15 22:23:24,197 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_302|], 2=[|v_#memory_$Pointer$.base_314|]} [2019-11-15 22:23:24,202 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:23:24,203 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:23:24,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:24,274 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:24,275 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:23:24,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:24,278 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:24,304 INFO L567 ElimStorePlain]: treesize reduction 40, result has 25.9 percent of original size [2019-11-15 22:23:24,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:24,305 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-11-15 22:23:24,313 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:23:24,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:24,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:24,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:24,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:24,354 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:23:24,355 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:24,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:24,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:24,368 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-11-15 22:23:24,374 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_303|], 2=[|v_#memory_$Pointer$.base_316|]} [2019-11-15 22:23:24,378 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:23:24,378 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:23:24,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:24,438 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:24,438 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:23:24,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:24,439 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:24,475 INFO L567 ElimStorePlain]: treesize reduction 40, result has 25.9 percent of original size [2019-11-15 22:23:24,475 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:24,475 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-11-15 22:23:24,480 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_321|, |v_#memory_$Pointer$.offset_301|], 2=[|v_#memory_$Pointer$.base_306|, |v_#memory_$Pointer$.base_317|]} [2019-11-15 22:23:24,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:24,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:24,492 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 109 treesize of output 40 [2019-11-15 22:23:24,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:24,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:24,532 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 21 treesize of output 15 [2019-11-15 22:23:24,533 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:23:24,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:24,567 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:23:24,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:24,604 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:23:24,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:24,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:24,616 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:23:24,617 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:23:24,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:24,627 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:23:24,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:24,649 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:23:24,650 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:142, output treesize:35 [2019-11-15 22:23:24,752 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 33 treesize of output 15 [2019-11-15 22:23:24,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:24,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:24,761 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:23:24,762 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:3 [2019-11-15 22:23:25,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5702 backedges. 1785 proven. 91 refuted. 0 times theorem prover too weak. 3826 trivial. 0 not checked. [2019-11-15 22:23:25,579 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:23:25,627 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_int|, |v_#memory_$Pointer$.offset_301|], 2=[|v_#memory_$Pointer$.base_306|]} [2019-11-15 22:23:33,794 WARN L191 SmtUtils]: Spent 8.16 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-15 22:23:33,794 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:33,795 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 63 treesize of output 107 [2019-11-15 22:23:33,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:33,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:23:33,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:23:33,830 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:33,831 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 107 treesize of output 107 [2019-11-15 22:23:33,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:33,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:23:33,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:33,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:33,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:23:33,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:33,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:33,841 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:23:33,841 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimCell_25], 1=[v_arrayElimCell_26]} [2019-11-15 22:23:34,044 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:23:34,045 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:23:34,048 INFO L168 Benchmark]: Toolchain (without parser) took 60536.79 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 947.0 MB in the beginning and 1.7 GB in the end (delta: -786.6 MB). Peak memory consumption was 437.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:23:34,048 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:23:34,048 INFO L168 Benchmark]: CACSL2BoogieTranslator took 801.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -184.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:23:34,049 INFO L168 Benchmark]: Boogie Procedure Inliner took 122.21 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:23:34,049 INFO L168 Benchmark]: Boogie Preprocessor took 127.90 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:23:34,049 INFO L168 Benchmark]: RCFGBuilder took 4324.52 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.7 MB). Peak memory consumption was 96.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:23:34,050 INFO L168 Benchmark]: TraceAbstraction took 55155.94 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -712.2 MB). Peak memory consumption was 355.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:23:34,052 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 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 801.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -184.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 122.21 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 127.90 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4324.52 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.7 MB). Peak memory consumption was 96.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 55155.94 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -712.2 MB). Peak memory consumption was 355.2 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...