./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/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 86985028c31ac38cb951d6f73c1e89691e53b5e6 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/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 86985028c31ac38cb951d6f73c1e89691e53b5e6 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: NullPointerException: null --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:19:08,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:19:08,044 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:19:08,061 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:19:08,062 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:19:08,063 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:19:08,066 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:19:08,078 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:19:08,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:19:08,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:19:08,088 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:19:08,090 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:19:08,090 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:19:08,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:19:08,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:19:08,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:19:08,098 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:19:08,100 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:19:08,103 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:19:08,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:19:08,111 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:19:08,114 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:19:08,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:19:08,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:19:08,120 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:19:08,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:19:08,121 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:19:08,123 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:19:08,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:19:08,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:19:08,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:19:08,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:19:08,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:19:08,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:19:08,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:19:08,131 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:19:08,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:19:08,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:19:08,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:19:08,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:19:08,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:19:08,136 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:19:08,167 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:19:08,167 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:19:08,168 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:19:08,169 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:19:08,169 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:19:08,169 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:19:08,170 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:19:08,170 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:19:08,170 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:19:08,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:19:08,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:19:08,171 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:19:08,172 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:19:08,172 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:19:08,172 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:19:08,173 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:19:08,173 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:19:08,173 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:19:08,174 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:19:08,174 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:19:08,174 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:19:08,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:19:08,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:19:08,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:19:08,176 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:19:08,176 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:19:08,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:19:08,177 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:19:08,177 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_fffaa154-98e0-434d-bfa8-934c79c01f4a/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 -> 86985028c31ac38cb951d6f73c1e89691e53b5e6 [2019-11-15 21:19:08,215 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:19:08,227 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:19:08,232 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:19:08,234 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:19:08,235 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:19:08,237 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-1.c [2019-11-15 21:19:08,313 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/data/507cd88a9/1752d2f472604e83b8a3843447facea3/FLAG8b92f8553 [2019-11-15 21:19:09,013 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:19:09,014 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-1.c [2019-11-15 21:19:09,034 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/data/507cd88a9/1752d2f472604e83b8a3843447facea3/FLAG8b92f8553 [2019-11-15 21:19:09,174 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/data/507cd88a9/1752d2f472604e83b8a3843447facea3 [2019-11-15 21:19:09,178 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:19:09,179 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:19:09,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:19:09,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:19:09,188 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:19:09,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:19:09" (1/1) ... [2019-11-15 21:19:09,192 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41e37240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:09, skipping insertion in model container [2019-11-15 21:19:09,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:19:09" (1/1) ... [2019-11-15 21:19:09,201 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:19:09,290 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:19:09,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:19:09,882 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:19:10,056 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:19:10,081 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:19:10,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:10 WrapperNode [2019-11-15 21:19:10,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:19:10,083 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:19:10,083 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:19:10,083 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:19:10,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:10" (1/1) ... [2019-11-15 21:19:10,120 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:10" (1/1) ... [2019-11-15 21:19:10,177 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:19:10,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:19:10,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:19:10,178 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:19:10,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:10" (1/1) ... [2019-11-15 21:19:10,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:10" (1/1) ... [2019-11-15 21:19:10,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:10" (1/1) ... [2019-11-15 21:19:10,202 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:10" (1/1) ... [2019-11-15 21:19:10,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:10" (1/1) ... [2019-11-15 21:19:10,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:10" (1/1) ... [2019-11-15 21:19:10,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:10" (1/1) ... [2019-11-15 21:19:10,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:19:10,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:19:10,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:19:10,290 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:19:10,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/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 21:19:10,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:19:10,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:19:10,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:19:10,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:19:10,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:19:10,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:19:10,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:19:10,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:19:10,799 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:19:11,835 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-15 21:19:11,840 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-15 21:19:11,841 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:19:11,844 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 21:19:11,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:19:11 BoogieIcfgContainer [2019-11-15 21:19:11,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:19:11,847 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:19:11,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:19:11,850 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:19:11,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:19:09" (1/3) ... [2019-11-15 21:19:11,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b912d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:19:11, skipping insertion in model container [2019-11-15 21:19:11,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:10" (2/3) ... [2019-11-15 21:19:11,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b912d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:19:11, skipping insertion in model container [2019-11-15 21:19:11,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:19:11" (3/3) ... [2019-11-15 21:19:11,854 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-1.c [2019-11-15 21:19:11,865 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:19:11,873 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:19:11,886 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:19:11,914 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:19:11,914 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:19:11,914 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:19:11,914 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:19:11,915 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:19:11,915 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:19:11,915 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:19:11,915 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:19:11,943 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2019-11-15 21:19:11,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 21:19:11,951 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:11,952 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:19:11,954 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:11,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:11,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1457703966, now seen corresponding path program 1 times [2019-11-15 21:19:11,972 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:11,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315805516] [2019-11-15 21:19:11,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:11,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:11,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:12,310 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 21:19:12,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315805516] [2019-11-15 21:19:12,312 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:12,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:12,313 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321988398] [2019-11-15 21:19:12,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:12,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:12,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:12,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:12,336 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 4 states. [2019-11-15 21:19:12,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:12,890 INFO L93 Difference]: Finished difference Result 259 states and 432 transitions. [2019-11-15 21:19:12,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:12,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-15 21:19:12,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:12,906 INFO L225 Difference]: With dead ends: 259 [2019-11-15 21:19:12,906 INFO L226 Difference]: Without dead ends: 118 [2019-11-15 21:19:12,911 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 21:19:12,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-15 21:19:12,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-11-15 21:19:12,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-15 21:19:12,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 174 transitions. [2019-11-15 21:19:12,988 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 174 transitions. Word has length 24 [2019-11-15 21:19:12,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:12,988 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 174 transitions. [2019-11-15 21:19:12,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:12,989 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 174 transitions. [2019-11-15 21:19:12,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 21:19:12,994 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:12,994 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] [2019-11-15 21:19:12,995 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:12,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:12,995 INFO L82 PathProgramCache]: Analyzing trace with hash -823871220, now seen corresponding path program 1 times [2019-11-15 21:19:12,996 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:12,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558716218] [2019-11-15 21:19:12,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:12,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:12,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:13,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:19:13,234 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558716218] [2019-11-15 21:19:13,234 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:13,235 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:19:13,235 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013960401] [2019-11-15 21:19:13,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:19:13,240 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:13,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:19:13,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:19:13,241 INFO L87 Difference]: Start difference. First operand 117 states and 174 transitions. Second operand 3 states. [2019-11-15 21:19:13,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:13,329 INFO L93 Difference]: Finished difference Result 327 states and 490 transitions. [2019-11-15 21:19:13,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:19:13,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-15 21:19:13,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:13,337 INFO L225 Difference]: With dead ends: 327 [2019-11-15 21:19:13,337 INFO L226 Difference]: Without dead ends: 220 [2019-11-15 21:19:13,341 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 21:19:13,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-11-15 21:19:13,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-11-15 21:19:13,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-15 21:19:13,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 324 transitions. [2019-11-15 21:19:13,375 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 324 transitions. Word has length 39 [2019-11-15 21:19:13,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:13,375 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 324 transitions. [2019-11-15 21:19:13,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:19:13,376 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 324 transitions. [2019-11-15 21:19:13,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 21:19:13,379 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:13,380 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 21:19:13,380 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:13,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:13,380 INFO L82 PathProgramCache]: Analyzing trace with hash 417767905, now seen corresponding path program 1 times [2019-11-15 21:19:13,381 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:13,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699708184] [2019-11-15 21:19:13,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:13,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:13,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:13,508 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:19:13,509 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699708184] [2019-11-15 21:19:13,509 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:13,509 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:19:13,510 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529407813] [2019-11-15 21:19:13,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:19:13,511 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:13,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:19:13,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:19:13,511 INFO L87 Difference]: Start difference. First operand 220 states and 324 transitions. Second operand 3 states. [2019-11-15 21:19:13,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:13,614 INFO L93 Difference]: Finished difference Result 429 states and 639 transitions. [2019-11-15 21:19:13,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:19:13,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-15 21:19:13,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:13,621 INFO L225 Difference]: With dead ends: 429 [2019-11-15 21:19:13,621 INFO L226 Difference]: Without dead ends: 322 [2019-11-15 21:19:13,622 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:19:13,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-15 21:19:13,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2019-11-15 21:19:13,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-11-15 21:19:13,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 473 transitions. [2019-11-15 21:19:13,674 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 473 transitions. Word has length 54 [2019-11-15 21:19:13,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:13,675 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 473 transitions. [2019-11-15 21:19:13,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:19:13,676 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 473 transitions. [2019-11-15 21:19:13,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 21:19:13,680 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:13,680 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-11-15 21:19:13,680 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:13,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:13,681 INFO L82 PathProgramCache]: Analyzing trace with hash -647263272, now seen corresponding path program 1 times [2019-11-15 21:19:13,681 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:13,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262649110] [2019-11-15 21:19:13,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:13,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:13,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:13,889 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:19:13,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262649110] [2019-11-15 21:19:13,890 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:13,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:13,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859482724] [2019-11-15 21:19:13,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:13,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:13,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:13,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:13,892 INFO L87 Difference]: Start difference. First operand 322 states and 473 transitions. Second operand 4 states. [2019-11-15 21:19:14,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:14,842 INFO L93 Difference]: Finished difference Result 822 states and 1213 transitions. [2019-11-15 21:19:14,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:14,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-15 21:19:14,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:14,848 INFO L225 Difference]: With dead ends: 822 [2019-11-15 21:19:14,848 INFO L226 Difference]: Without dead ends: 510 [2019-11-15 21:19:14,851 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 21:19:14,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-11-15 21:19:14,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 372. [2019-11-15 21:19:14,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-11-15 21:19:14,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 559 transitions. [2019-11-15 21:19:14,876 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 559 transitions. Word has length 72 [2019-11-15 21:19:14,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:14,876 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 559 transitions. [2019-11-15 21:19:14,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:14,877 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 559 transitions. [2019-11-15 21:19:14,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 21:19:14,880 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:14,881 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-11-15 21:19:14,881 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:14,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:14,882 INFO L82 PathProgramCache]: Analyzing trace with hash -781276778, now seen corresponding path program 1 times [2019-11-15 21:19:14,882 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:14,882 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049365466] [2019-11-15 21:19:14,882 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:14,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:14,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:15,056 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:19:15,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049365466] [2019-11-15 21:19:15,057 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:15,057 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:15,057 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299907880] [2019-11-15 21:19:15,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:15,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:15,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:15,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:15,059 INFO L87 Difference]: Start difference. First operand 372 states and 559 transitions. Second operand 4 states. [2019-11-15 21:19:15,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:15,601 INFO L93 Difference]: Finished difference Result 818 states and 1229 transitions. [2019-11-15 21:19:15,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:15,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-15 21:19:15,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:15,610 INFO L225 Difference]: With dead ends: 818 [2019-11-15 21:19:15,611 INFO L226 Difference]: Without dead ends: 456 [2019-11-15 21:19:15,612 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 21:19:15,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-11-15 21:19:15,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 412. [2019-11-15 21:19:15,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-11-15 21:19:15,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 627 transitions. [2019-11-15 21:19:15,637 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 627 transitions. Word has length 72 [2019-11-15 21:19:15,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:15,638 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 627 transitions. [2019-11-15 21:19:15,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:15,638 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 627 transitions. [2019-11-15 21:19:15,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 21:19:15,643 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:15,644 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-11-15 21:19:15,644 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:15,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:15,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1405257089, now seen corresponding path program 1 times [2019-11-15 21:19:15,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:15,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068645723] [2019-11-15 21:19:15,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:15,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:15,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:15,805 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:19:15,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068645723] [2019-11-15 21:19:15,806 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:15,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:15,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773351261] [2019-11-15 21:19:15,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:15,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:15,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:15,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:15,810 INFO L87 Difference]: Start difference. First operand 412 states and 627 transitions. Second operand 4 states. [2019-11-15 21:19:16,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:16,471 INFO L93 Difference]: Finished difference Result 944 states and 1425 transitions. [2019-11-15 21:19:16,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:16,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-15 21:19:16,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:16,479 INFO L225 Difference]: With dead ends: 944 [2019-11-15 21:19:16,480 INFO L226 Difference]: Without dead ends: 542 [2019-11-15 21:19:16,481 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 21:19:16,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-11-15 21:19:16,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 414. [2019-11-15 21:19:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-15 21:19:16,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 629 transitions. [2019-11-15 21:19:16,503 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 629 transitions. Word has length 73 [2019-11-15 21:19:16,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:16,520 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 629 transitions. [2019-11-15 21:19:16,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:16,521 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 629 transitions. [2019-11-15 21:19:16,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 21:19:16,523 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:16,523 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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] [2019-11-15 21:19:16,524 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:16,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:16,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1922517418, now seen corresponding path program 2 times [2019-11-15 21:19:16,524 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:16,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444130270] [2019-11-15 21:19:16,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:16,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:16,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:19:16,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444130270] [2019-11-15 21:19:16,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:16,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:16,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143790647] [2019-11-15 21:19:16,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:16,709 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:16,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:16,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:16,710 INFO L87 Difference]: Start difference. First operand 414 states and 629 transitions. Second operand 4 states. [2019-11-15 21:19:17,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:17,264 INFO L93 Difference]: Finished difference Result 944 states and 1423 transitions. [2019-11-15 21:19:17,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:17,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 21:19:17,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:17,271 INFO L225 Difference]: With dead ends: 944 [2019-11-15 21:19:17,271 INFO L226 Difference]: Without dead ends: 540 [2019-11-15 21:19:17,272 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 21:19:17,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-11-15 21:19:17,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 414. [2019-11-15 21:19:17,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-15 21:19:17,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 627 transitions. [2019-11-15 21:19:17,290 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 627 transitions. Word has length 87 [2019-11-15 21:19:17,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:17,290 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 627 transitions. [2019-11-15 21:19:17,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:17,291 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 627 transitions. [2019-11-15 21:19:17,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 21:19:17,293 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:17,293 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-11-15 21:19:17,293 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:17,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:17,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1941172876, now seen corresponding path program 1 times [2019-11-15 21:19:17,294 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:17,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153787484] [2019-11-15 21:19:17,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:17,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:17,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:17,397 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:19:17,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153787484] [2019-11-15 21:19:17,398 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:17,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:17,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620405121] [2019-11-15 21:19:17,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:17,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:17,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:17,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:17,400 INFO L87 Difference]: Start difference. First operand 414 states and 627 transitions. Second operand 4 states. [2019-11-15 21:19:18,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:18,020 INFO L93 Difference]: Finished difference Result 944 states and 1419 transitions. [2019-11-15 21:19:18,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:18,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 21:19:18,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:18,026 INFO L225 Difference]: With dead ends: 944 [2019-11-15 21:19:18,026 INFO L226 Difference]: Without dead ends: 540 [2019-11-15 21:19:18,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 21:19:18,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-11-15 21:19:18,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 414. [2019-11-15 21:19:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-15 21:19:18,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 625 transitions. [2019-11-15 21:19:18,046 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 625 transitions. Word has length 87 [2019-11-15 21:19:18,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:18,047 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 625 transitions. [2019-11-15 21:19:18,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:18,048 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 625 transitions. [2019-11-15 21:19:18,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 21:19:18,049 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:18,050 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 21:19:18,050 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:18,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:18,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1648293783, now seen corresponding path program 1 times [2019-11-15 21:19:18,051 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:18,051 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630561782] [2019-11-15 21:19:18,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:18,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:18,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:19:18,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630561782] [2019-11-15 21:19:18,143 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:18,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:18,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430070105] [2019-11-15 21:19:18,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:18,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:18,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:18,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:18,145 INFO L87 Difference]: Start difference. First operand 414 states and 625 transitions. Second operand 4 states. [2019-11-15 21:19:18,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:18,781 INFO L93 Difference]: Finished difference Result 797 states and 1191 transitions. [2019-11-15 21:19:18,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:18,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 21:19:18,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:18,787 INFO L225 Difference]: With dead ends: 797 [2019-11-15 21:19:18,787 INFO L226 Difference]: Without dead ends: 540 [2019-11-15 21:19:18,788 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 21:19:18,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-11-15 21:19:18,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 414. [2019-11-15 21:19:18,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-15 21:19:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 623 transitions. [2019-11-15 21:19:18,807 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 623 transitions. Word has length 87 [2019-11-15 21:19:18,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:18,808 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 623 transitions. [2019-11-15 21:19:18,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:18,808 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 623 transitions. [2019-11-15 21:19:18,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 21:19:18,810 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:18,811 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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] [2019-11-15 21:19:18,811 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:18,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:18,812 INFO L82 PathProgramCache]: Analyzing trace with hash 527082712, now seen corresponding path program 2 times [2019-11-15 21:19:18,812 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:18,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367620402] [2019-11-15 21:19:18,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:18,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:18,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:18,903 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:19:18,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367620402] [2019-11-15 21:19:18,904 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:18,904 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:18,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653039861] [2019-11-15 21:19:18,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:18,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:18,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:18,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:18,907 INFO L87 Difference]: Start difference. First operand 414 states and 623 transitions. Second operand 4 states. [2019-11-15 21:19:19,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:19,410 INFO L93 Difference]: Finished difference Result 860 states and 1285 transitions. [2019-11-15 21:19:19,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:19,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 21:19:19,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:19,415 INFO L225 Difference]: With dead ends: 860 [2019-11-15 21:19:19,415 INFO L226 Difference]: Without dead ends: 456 [2019-11-15 21:19:19,416 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 21:19:19,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-11-15 21:19:19,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 414. [2019-11-15 21:19:19,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-15 21:19:19,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 621 transitions. [2019-11-15 21:19:19,479 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 621 transitions. Word has length 87 [2019-11-15 21:19:19,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:19,479 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 621 transitions. [2019-11-15 21:19:19,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:19,480 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 621 transitions. [2019-11-15 21:19:19,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 21:19:19,481 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:19,482 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-11-15 21:19:19,482 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:19,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:19,482 INFO L82 PathProgramCache]: Analyzing trace with hash 508427254, now seen corresponding path program 1 times [2019-11-15 21:19:19,482 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:19,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081751018] [2019-11-15 21:19:19,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:19,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:19,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:19,565 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:19:19,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081751018] [2019-11-15 21:19:19,566 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:19,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:19,567 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758031203] [2019-11-15 21:19:19,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:19,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:19,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:19,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:19,568 INFO L87 Difference]: Start difference. First operand 414 states and 621 transitions. Second operand 4 states. [2019-11-15 21:19:20,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:20,040 INFO L93 Difference]: Finished difference Result 860 states and 1281 transitions. [2019-11-15 21:19:20,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:20,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 21:19:20,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:20,044 INFO L225 Difference]: With dead ends: 860 [2019-11-15 21:19:20,045 INFO L226 Difference]: Without dead ends: 456 [2019-11-15 21:19:20,046 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 21:19:20,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-11-15 21:19:20,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 414. [2019-11-15 21:19:20,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-15 21:19:20,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 619 transitions. [2019-11-15 21:19:20,060 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 619 transitions. Word has length 87 [2019-11-15 21:19:20,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:20,061 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 619 transitions. [2019-11-15 21:19:20,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 619 transitions. [2019-11-15 21:19:20,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 21:19:20,063 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:20,063 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 21:19:20,063 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:20,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:20,064 INFO L82 PathProgramCache]: Analyzing trace with hash -197073383, now seen corresponding path program 1 times [2019-11-15 21:19:20,064 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:20,064 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952913378] [2019-11-15 21:19:20,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:20,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:20,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:20,151 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:19:20,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952913378] [2019-11-15 21:19:20,152 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:20,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:20,153 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29505337] [2019-11-15 21:19:20,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:20,153 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:20,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:20,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:20,154 INFO L87 Difference]: Start difference. First operand 414 states and 619 transitions. Second operand 4 states. [2019-11-15 21:19:20,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:20,580 INFO L93 Difference]: Finished difference Result 713 states and 1056 transitions. [2019-11-15 21:19:20,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:20,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 21:19:20,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:20,584 INFO L225 Difference]: With dead ends: 713 [2019-11-15 21:19:20,585 INFO L226 Difference]: Without dead ends: 456 [2019-11-15 21:19:20,585 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 21:19:20,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-11-15 21:19:20,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 414. [2019-11-15 21:19:20,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-15 21:19:20,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 617 transitions. [2019-11-15 21:19:20,600 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 617 transitions. Word has length 87 [2019-11-15 21:19:20,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:20,601 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 617 transitions. [2019-11-15 21:19:20,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:20,601 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 617 transitions. [2019-11-15 21:19:20,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 21:19:20,603 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:20,603 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2019-11-15 21:19:20,604 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:20,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:20,604 INFO L82 PathProgramCache]: Analyzing trace with hash 426750187, now seen corresponding path program 1 times [2019-11-15 21:19:20,605 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:20,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800781483] [2019-11-15 21:19:20,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:20,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:20,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:19:20,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800781483] [2019-11-15 21:19:20,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:20,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:20,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629150275] [2019-11-15 21:19:20,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:20,696 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:20,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:20,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:20,698 INFO L87 Difference]: Start difference. First operand 414 states and 617 transitions. Second operand 4 states. [2019-11-15 21:19:21,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:21,285 INFO L93 Difference]: Finished difference Result 944 states and 1399 transitions. [2019-11-15 21:19:21,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:21,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 21:19:21,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:21,290 INFO L225 Difference]: With dead ends: 944 [2019-11-15 21:19:21,290 INFO L226 Difference]: Without dead ends: 540 [2019-11-15 21:19:21,291 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 21:19:21,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-11-15 21:19:21,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 414. [2019-11-15 21:19:21,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-15 21:19:21,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 615 transitions. [2019-11-15 21:19:21,307 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 615 transitions. Word has length 88 [2019-11-15 21:19:21,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:21,307 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 615 transitions. [2019-11-15 21:19:21,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:21,308 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 615 transitions. [2019-11-15 21:19:21,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 21:19:21,309 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:21,310 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 21:19:21,310 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:21,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:21,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1812208562, now seen corresponding path program 1 times [2019-11-15 21:19:21,311 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:21,311 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789102407] [2019-11-15 21:19:21,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:21,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:21,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:21,426 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:19:21,427 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789102407] [2019-11-15 21:19:21,427 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:21,427 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:21,427 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689137045] [2019-11-15 21:19:21,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:21,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:21,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:21,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:21,429 INFO L87 Difference]: Start difference. First operand 414 states and 615 transitions. Second operand 4 states. [2019-11-15 21:19:22,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:22,081 INFO L93 Difference]: Finished difference Result 791 states and 1169 transitions. [2019-11-15 21:19:22,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:22,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 21:19:22,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:22,086 INFO L225 Difference]: With dead ends: 791 [2019-11-15 21:19:22,086 INFO L226 Difference]: Without dead ends: 534 [2019-11-15 21:19:22,087 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 21:19:22,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-11-15 21:19:22,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 414. [2019-11-15 21:19:22,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-15 21:19:22,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 613 transitions. [2019-11-15 21:19:22,104 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 613 transitions. Word has length 88 [2019-11-15 21:19:22,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:22,105 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 613 transitions. [2019-11-15 21:19:22,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:22,105 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 613 transitions. [2019-11-15 21:19:22,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 21:19:22,107 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:22,107 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2019-11-15 21:19:22,108 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:22,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:22,108 INFO L82 PathProgramCache]: Analyzing trace with hash -945057111, now seen corresponding path program 1 times [2019-11-15 21:19:22,108 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:22,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605043114] [2019-11-15 21:19:22,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:22,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:22,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:22,198 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:19:22,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605043114] [2019-11-15 21:19:22,198 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:22,198 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:22,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35919339] [2019-11-15 21:19:22,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:22,199 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:22,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:22,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:22,200 INFO L87 Difference]: Start difference. First operand 414 states and 613 transitions. Second operand 4 states. [2019-11-15 21:19:22,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:22,594 INFO L93 Difference]: Finished difference Result 860 states and 1265 transitions. [2019-11-15 21:19:22,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:22,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 21:19:22,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:22,602 INFO L225 Difference]: With dead ends: 860 [2019-11-15 21:19:22,602 INFO L226 Difference]: Without dead ends: 456 [2019-11-15 21:19:22,604 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 21:19:22,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-11-15 21:19:22,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 414. [2019-11-15 21:19:22,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-15 21:19:22,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 611 transitions. [2019-11-15 21:19:22,619 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 611 transitions. Word has length 88 [2019-11-15 21:19:22,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:22,620 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 611 transitions. [2019-11-15 21:19:22,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:22,620 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 611 transitions. [2019-11-15 21:19:22,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 21:19:22,622 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:22,622 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 21:19:22,622 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:22,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:22,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1110951436, now seen corresponding path program 1 times [2019-11-15 21:19:22,623 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:22,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927995955] [2019-11-15 21:19:22,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:22,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:22,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:22,703 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:19:22,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927995955] [2019-11-15 21:19:22,704 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:22,704 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:22,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979969971] [2019-11-15 21:19:22,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:22,705 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:22,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:22,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:22,706 INFO L87 Difference]: Start difference. First operand 414 states and 611 transitions. Second operand 4 states. [2019-11-15 21:19:23,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:23,074 INFO L93 Difference]: Finished difference Result 707 states and 1037 transitions. [2019-11-15 21:19:23,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:23,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 21:19:23,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:23,078 INFO L225 Difference]: With dead ends: 707 [2019-11-15 21:19:23,078 INFO L226 Difference]: Without dead ends: 450 [2019-11-15 21:19:23,079 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 21:19:23,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-15 21:19:23,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 414. [2019-11-15 21:19:23,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-15 21:19:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 609 transitions. [2019-11-15 21:19:23,093 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 609 transitions. Word has length 88 [2019-11-15 21:19:23,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:23,094 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 609 transitions. [2019-11-15 21:19:23,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:23,094 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 609 transitions. [2019-11-15 21:19:23,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 21:19:23,096 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:23,096 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2019-11-15 21:19:23,096 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:23,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:23,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1723046503, now seen corresponding path program 1 times [2019-11-15 21:19:23,097 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:23,097 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767934888] [2019-11-15 21:19:23,097 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:23,097 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:23,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:23,185 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:19:23,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767934888] [2019-11-15 21:19:23,186 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:23,186 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:23,186 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835839529] [2019-11-15 21:19:23,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:23,187 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:23,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:23,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:23,188 INFO L87 Difference]: Start difference. First operand 414 states and 609 transitions. Second operand 4 states. [2019-11-15 21:19:23,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:23,680 INFO L93 Difference]: Finished difference Result 938 states and 1376 transitions. [2019-11-15 21:19:23,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:23,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-15 21:19:23,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:23,684 INFO L225 Difference]: With dead ends: 938 [2019-11-15 21:19:23,685 INFO L226 Difference]: Without dead ends: 534 [2019-11-15 21:19:23,686 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 21:19:23,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-11-15 21:19:23,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 414. [2019-11-15 21:19:23,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-15 21:19:23,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 607 transitions. [2019-11-15 21:19:23,704 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 607 transitions. Word has length 89 [2019-11-15 21:19:23,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:23,704 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 607 transitions. [2019-11-15 21:19:23,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:23,705 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 607 transitions. [2019-11-15 21:19:23,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 21:19:23,707 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:23,707 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2019-11-15 21:19:23,707 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:23,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:23,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1299399781, now seen corresponding path program 1 times [2019-11-15 21:19:23,708 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:23,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275583971] [2019-11-15 21:19:23,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:23,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:23,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:23,858 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:19:23,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275583971] [2019-11-15 21:19:23,858 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:23,859 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:23,859 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628128283] [2019-11-15 21:19:23,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:23,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:23,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:23,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:23,860 INFO L87 Difference]: Start difference. First operand 414 states and 607 transitions. Second operand 4 states. [2019-11-15 21:19:24,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:24,220 INFO L93 Difference]: Finished difference Result 854 states and 1246 transitions. [2019-11-15 21:19:24,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:24,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-15 21:19:24,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:24,224 INFO L225 Difference]: With dead ends: 854 [2019-11-15 21:19:24,224 INFO L226 Difference]: Without dead ends: 450 [2019-11-15 21:19:24,225 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 21:19:24,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-15 21:19:24,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 414. [2019-11-15 21:19:24,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-15 21:19:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 605 transitions. [2019-11-15 21:19:24,240 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 605 transitions. Word has length 89 [2019-11-15 21:19:24,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:24,240 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 605 transitions. [2019-11-15 21:19:24,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:24,240 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 605 transitions. [2019-11-15 21:19:24,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 21:19:24,242 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:24,243 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 21:19:24,243 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:24,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:24,243 INFO L82 PathProgramCache]: Analyzing trace with hash 2106732528, now seen corresponding path program 1 times [2019-11-15 21:19:24,244 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:24,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662401403] [2019-11-15 21:19:24,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:24,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:24,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:24,321 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:19:24,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662401403] [2019-11-15 21:19:24,322 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:24,322 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:24,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112510736] [2019-11-15 21:19:24,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:24,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:24,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:24,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:24,324 INFO L87 Difference]: Start difference. First operand 414 states and 605 transitions. Second operand 4 states. [2019-11-15 21:19:24,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:24,936 INFO L93 Difference]: Finished difference Result 920 states and 1346 transitions. [2019-11-15 21:19:24,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:24,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-15 21:19:24,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:24,940 INFO L225 Difference]: With dead ends: 920 [2019-11-15 21:19:24,940 INFO L226 Difference]: Without dead ends: 516 [2019-11-15 21:19:24,941 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 21:19:24,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-11-15 21:19:24,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 414. [2019-11-15 21:19:24,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-15 21:19:24,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 603 transitions. [2019-11-15 21:19:24,957 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 603 transitions. Word has length 90 [2019-11-15 21:19:24,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:24,958 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 603 transitions. [2019-11-15 21:19:24,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:24,958 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 603 transitions. [2019-11-15 21:19:24,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 21:19:24,960 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:24,960 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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] [2019-11-15 21:19:24,960 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:24,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:24,961 INFO L82 PathProgramCache]: Analyzing trace with hash 415305537, now seen corresponding path program 1 times [2019-11-15 21:19:24,961 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:24,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140481352] [2019-11-15 21:19:24,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:24,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:24,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:25,046 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:19:25,046 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140481352] [2019-11-15 21:19:25,047 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:25,047 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:25,047 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780075276] [2019-11-15 21:19:25,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:25,048 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:25,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:25,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:25,049 INFO L87 Difference]: Start difference. First operand 414 states and 603 transitions. Second operand 4 states. [2019-11-15 21:19:25,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:25,626 INFO L93 Difference]: Finished difference Result 920 states and 1342 transitions. [2019-11-15 21:19:25,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:25,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-15 21:19:25,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:25,630 INFO L225 Difference]: With dead ends: 920 [2019-11-15 21:19:25,631 INFO L226 Difference]: Without dead ends: 516 [2019-11-15 21:19:25,632 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 21:19:25,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-11-15 21:19:25,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 414. [2019-11-15 21:19:25,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-15 21:19:25,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 601 transitions. [2019-11-15 21:19:25,647 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 601 transitions. Word has length 90 [2019-11-15 21:19:25,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:25,647 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 601 transitions. [2019-11-15 21:19:25,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:25,648 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 601 transitions. [2019-11-15 21:19:25,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 21:19:25,649 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:25,649 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 21:19:25,650 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:25,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:25,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1940088274, now seen corresponding path program 1 times [2019-11-15 21:19:25,650 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:25,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289247737] [2019-11-15 21:19:25,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:25,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:25,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:25,741 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:19:25,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289247737] [2019-11-15 21:19:25,741 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:25,742 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:25,742 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602271369] [2019-11-15 21:19:25,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:25,743 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:25,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:25,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:25,745 INFO L87 Difference]: Start difference. First operand 414 states and 601 transitions. Second operand 4 states. [2019-11-15 21:19:26,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:26,172 INFO L93 Difference]: Finished difference Result 836 states and 1212 transitions. [2019-11-15 21:19:26,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:26,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-15 21:19:26,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:26,177 INFO L225 Difference]: With dead ends: 836 [2019-11-15 21:19:26,177 INFO L226 Difference]: Without dead ends: 432 [2019-11-15 21:19:26,178 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 21:19:26,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-11-15 21:19:26,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 414. [2019-11-15 21:19:26,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-15 21:19:26,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 599 transitions. [2019-11-15 21:19:26,192 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 599 transitions. Word has length 90 [2019-11-15 21:19:26,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:26,192 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 599 transitions. [2019-11-15 21:19:26,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:26,193 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 599 transitions. [2019-11-15 21:19:26,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 21:19:26,195 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:26,195 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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] [2019-11-15 21:19:26,195 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:26,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:26,196 INFO L82 PathProgramCache]: Analyzing trace with hash 663452031, now seen corresponding path program 1 times [2019-11-15 21:19:26,196 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:26,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054602968] [2019-11-15 21:19:26,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:26,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:26,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:26,289 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-15 21:19:26,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054602968] [2019-11-15 21:19:26,290 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:26,290 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:19:26,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093425017] [2019-11-15 21:19:26,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:19:26,291 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:26,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:19:26,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:19:26,292 INFO L87 Difference]: Start difference. First operand 414 states and 599 transitions. Second operand 3 states. [2019-11-15 21:19:26,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:26,334 INFO L93 Difference]: Finished difference Result 820 states and 1193 transitions. [2019-11-15 21:19:26,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:19:26,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-11-15 21:19:26,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:26,340 INFO L225 Difference]: With dead ends: 820 [2019-11-15 21:19:26,340 INFO L226 Difference]: Without dead ends: 565 [2019-11-15 21:19:26,341 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 21:19:26,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-11-15 21:19:26,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2019-11-15 21:19:26,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-11-15 21:19:26,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 818 transitions. [2019-11-15 21:19:26,359 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 818 transitions. Word has length 90 [2019-11-15 21:19:26,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:26,360 INFO L462 AbstractCegarLoop]: Abstraction has 565 states and 818 transitions. [2019-11-15 21:19:26,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:19:26,360 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 818 transitions. [2019-11-15 21:19:26,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 21:19:26,362 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:26,363 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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] [2019-11-15 21:19:26,363 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:26,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:26,363 INFO L82 PathProgramCache]: Analyzing trace with hash -69191723, now seen corresponding path program 1 times [2019-11-15 21:19:26,363 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:26,364 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090209593] [2019-11-15 21:19:26,364 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:26,364 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:26,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:26,433 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-15 21:19:26,434 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090209593] [2019-11-15 21:19:26,434 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:26,434 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:19:26,434 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564205874] [2019-11-15 21:19:26,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:19:26,435 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:26,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:19:26,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:19:26,436 INFO L87 Difference]: Start difference. First operand 565 states and 818 transitions. Second operand 3 states. [2019-11-15 21:19:26,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:26,483 INFO L93 Difference]: Finished difference Result 1122 states and 1631 transitions. [2019-11-15 21:19:26,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:19:26,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-11-15 21:19:26,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:26,489 INFO L225 Difference]: With dead ends: 1122 [2019-11-15 21:19:26,489 INFO L226 Difference]: Without dead ends: 716 [2019-11-15 21:19:26,490 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 21:19:26,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-11-15 21:19:26,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2019-11-15 21:19:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-11-15 21:19:26,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1038 transitions. [2019-11-15 21:19:26,513 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1038 transitions. Word has length 92 [2019-11-15 21:19:26,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:26,513 INFO L462 AbstractCegarLoop]: Abstraction has 716 states and 1038 transitions. [2019-11-15 21:19:26,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:19:26,513 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1038 transitions. [2019-11-15 21:19:26,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-15 21:19:26,516 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:26,516 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 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] [2019-11-15 21:19:26,516 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:26,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:26,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1514033431, now seen corresponding path program 1 times [2019-11-15 21:19:26,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:26,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416271717] [2019-11-15 21:19:26,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:26,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:26,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:26,607 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 21:19:26,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416271717] [2019-11-15 21:19:26,607 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:26,607 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:19:26,608 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130386031] [2019-11-15 21:19:26,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:19:26,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:26,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:19:26,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:19:26,610 INFO L87 Difference]: Start difference. First operand 716 states and 1038 transitions. Second operand 3 states. [2019-11-15 21:19:26,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:26,660 INFO L93 Difference]: Finished difference Result 869 states and 1261 transitions. [2019-11-15 21:19:26,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:19:26,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-11-15 21:19:26,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:26,667 INFO L225 Difference]: With dead ends: 869 [2019-11-15 21:19:26,667 INFO L226 Difference]: Without dead ends: 867 [2019-11-15 21:19:26,669 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 21:19:26,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2019-11-15 21:19:26,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 867. [2019-11-15 21:19:26,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2019-11-15 21:19:26,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1259 transitions. [2019-11-15 21:19:26,699 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1259 transitions. Word has length 113 [2019-11-15 21:19:26,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:26,699 INFO L462 AbstractCegarLoop]: Abstraction has 867 states and 1259 transitions. [2019-11-15 21:19:26,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:19:26,700 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1259 transitions. [2019-11-15 21:19:26,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-15 21:19:26,703 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:26,703 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 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] [2019-11-15 21:19:26,703 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:26,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:26,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1863685102, now seen corresponding path program 1 times [2019-11-15 21:19:26,704 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:26,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625995743] [2019-11-15 21:19:26,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:26,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:26,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:26,820 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 21:19:26,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625995743] [2019-11-15 21:19:26,821 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:26,821 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:26,821 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847368848] [2019-11-15 21:19:26,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:26,822 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:26,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:26,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:26,823 INFO L87 Difference]: Start difference. First operand 867 states and 1259 transitions. Second operand 4 states. [2019-11-15 21:19:27,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:27,321 INFO L93 Difference]: Finished difference Result 2035 states and 2967 transitions. [2019-11-15 21:19:27,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:27,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-11-15 21:19:27,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:27,330 INFO L225 Difference]: With dead ends: 2035 [2019-11-15 21:19:27,330 INFO L226 Difference]: Without dead ends: 1178 [2019-11-15 21:19:27,332 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 21:19:27,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2019-11-15 21:19:27,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1011. [2019-11-15 21:19:27,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2019-11-15 21:19:27,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1511 transitions. [2019-11-15 21:19:27,370 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1511 transitions. Word has length 139 [2019-11-15 21:19:27,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:27,370 INFO L462 AbstractCegarLoop]: Abstraction has 1011 states and 1511 transitions. [2019-11-15 21:19:27,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:27,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1511 transitions. [2019-11-15 21:19:27,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-15 21:19:27,374 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:27,375 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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] [2019-11-15 21:19:27,375 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:27,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:27,376 INFO L82 PathProgramCache]: Analyzing trace with hash 623941966, now seen corresponding path program 2 times [2019-11-15 21:19:27,376 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:27,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412356287] [2019-11-15 21:19:27,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:27,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:27,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:27,486 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-15 21:19:27,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412356287] [2019-11-15 21:19:27,486 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:27,487 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:27,487 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606169075] [2019-11-15 21:19:27,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:27,488 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:27,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:27,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:27,488 INFO L87 Difference]: Start difference. First operand 1011 states and 1511 transitions. Second operand 4 states. [2019-11-15 21:19:27,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:27,982 INFO L93 Difference]: Finished difference Result 2173 states and 3207 transitions. [2019-11-15 21:19:27,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:27,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-15 21:19:27,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:27,991 INFO L225 Difference]: With dead ends: 2173 [2019-11-15 21:19:27,992 INFO L226 Difference]: Without dead ends: 1172 [2019-11-15 21:19:27,994 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 21:19:27,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2019-11-15 21:19:28,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1011. [2019-11-15 21:19:28,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2019-11-15 21:19:28,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1505 transitions. [2019-11-15 21:19:28,031 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1505 transitions. Word has length 154 [2019-11-15 21:19:28,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:28,031 INFO L462 AbstractCegarLoop]: Abstraction has 1011 states and 1505 transitions. [2019-11-15 21:19:28,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:28,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1505 transitions. [2019-11-15 21:19:28,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-15 21:19:28,035 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:28,036 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 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] [2019-11-15 21:19:28,036 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:28,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:28,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1031461140, now seen corresponding path program 1 times [2019-11-15 21:19:28,037 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:28,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053987557] [2019-11-15 21:19:28,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:28,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:28,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:28,148 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-15 21:19:28,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053987557] [2019-11-15 21:19:28,148 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:28,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:28,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014392554] [2019-11-15 21:19:28,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:28,150 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:28,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:28,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:28,150 INFO L87 Difference]: Start difference. First operand 1011 states and 1505 transitions. Second operand 4 states. [2019-11-15 21:19:28,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:28,664 INFO L93 Difference]: Finished difference Result 2173 states and 3195 transitions. [2019-11-15 21:19:28,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:28,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-15 21:19:28,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:28,674 INFO L225 Difference]: With dead ends: 2173 [2019-11-15 21:19:28,674 INFO L226 Difference]: Without dead ends: 1172 [2019-11-15 21:19:28,676 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 21:19:28,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2019-11-15 21:19:28,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1011. [2019-11-15 21:19:28,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2019-11-15 21:19:28,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1499 transitions. [2019-11-15 21:19:28,713 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1499 transitions. Word has length 154 [2019-11-15 21:19:28,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:28,713 INFO L462 AbstractCegarLoop]: Abstraction has 1011 states and 1499 transitions. [2019-11-15 21:19:28,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1499 transitions. [2019-11-15 21:19:28,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-15 21:19:28,718 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:28,718 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 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] [2019-11-15 21:19:28,718 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:28,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:28,719 INFO L82 PathProgramCache]: Analyzing trace with hash 492624719, now seen corresponding path program 1 times [2019-11-15 21:19:28,719 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:28,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424893584] [2019-11-15 21:19:28,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:28,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:28,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:28,836 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-11-15 21:19:28,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424893584] [2019-11-15 21:19:28,836 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:28,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:28,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194670479] [2019-11-15 21:19:28,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:28,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:28,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:28,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:28,838 INFO L87 Difference]: Start difference. First operand 1011 states and 1499 transitions. Second operand 4 states. [2019-11-15 21:19:29,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:29,257 INFO L93 Difference]: Finished difference Result 2012 states and 2991 transitions. [2019-11-15 21:19:29,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:29,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-15 21:19:29,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:29,266 INFO L225 Difference]: With dead ends: 2012 [2019-11-15 21:19:29,266 INFO L226 Difference]: Without dead ends: 1184 [2019-11-15 21:19:29,268 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 21:19:29,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2019-11-15 21:19:29,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1101. [2019-11-15 21:19:29,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-11-15 21:19:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1649 transitions. [2019-11-15 21:19:29,313 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1649 transitions. Word has length 154 [2019-11-15 21:19:29,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:29,314 INFO L462 AbstractCegarLoop]: Abstraction has 1101 states and 1649 transitions. [2019-11-15 21:19:29,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:29,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1649 transitions. [2019-11-15 21:19:29,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-15 21:19:29,318 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:29,318 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 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] [2019-11-15 21:19:29,319 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:29,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:29,319 INFO L82 PathProgramCache]: Analyzing trace with hash -399585947, now seen corresponding path program 1 times [2019-11-15 21:19:29,319 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:29,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471229382] [2019-11-15 21:19:29,320 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:29,320 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:29,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:29,423 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-15 21:19:29,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471229382] [2019-11-15 21:19:29,424 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:29,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:29,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526184105] [2019-11-15 21:19:29,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:29,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:29,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:29,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:29,435 INFO L87 Difference]: Start difference. First operand 1101 states and 1649 transitions. Second operand 4 states. [2019-11-15 21:19:29,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:29,936 INFO L93 Difference]: Finished difference Result 2353 states and 3483 transitions. [2019-11-15 21:19:29,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:29,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-11-15 21:19:29,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:29,945 INFO L225 Difference]: With dead ends: 2353 [2019-11-15 21:19:29,945 INFO L226 Difference]: Without dead ends: 1262 [2019-11-15 21:19:29,949 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 21:19:29,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2019-11-15 21:19:29,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1101. [2019-11-15 21:19:29,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-11-15 21:19:29,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1643 transitions. [2019-11-15 21:19:29,986 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1643 transitions. Word has length 155 [2019-11-15 21:19:29,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:29,987 INFO L462 AbstractCegarLoop]: Abstraction has 1101 states and 1643 transitions. [2019-11-15 21:19:29,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:29,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1643 transitions. [2019-11-15 21:19:29,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-15 21:19:29,991 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:29,992 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 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] [2019-11-15 21:19:29,992 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:29,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:29,992 INFO L82 PathProgramCache]: Analyzing trace with hash 866001681, now seen corresponding path program 1 times [2019-11-15 21:19:29,993 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:29,993 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135025539] [2019-11-15 21:19:29,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:29,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:29,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:30,105 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-15 21:19:30,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135025539] [2019-11-15 21:19:30,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:30,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:30,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172593767] [2019-11-15 21:19:30,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:30,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:30,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:30,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:30,107 INFO L87 Difference]: Start difference. First operand 1101 states and 1643 transitions. Second operand 4 states. [2019-11-15 21:19:30,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:30,638 INFO L93 Difference]: Finished difference Result 2353 states and 3471 transitions. [2019-11-15 21:19:30,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:30,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-15 21:19:30,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:30,647 INFO L225 Difference]: With dead ends: 2353 [2019-11-15 21:19:30,648 INFO L226 Difference]: Without dead ends: 1262 [2019-11-15 21:19:30,651 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 21:19:30,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2019-11-15 21:19:30,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1101. [2019-11-15 21:19:30,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-11-15 21:19:30,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1637 transitions. [2019-11-15 21:19:30,688 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1637 transitions. Word has length 156 [2019-11-15 21:19:30,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:30,689 INFO L462 AbstractCegarLoop]: Abstraction has 1101 states and 1637 transitions. [2019-11-15 21:19:30,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:30,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1637 transitions. [2019-11-15 21:19:30,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-15 21:19:30,693 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:30,694 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 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] [2019-11-15 21:19:30,695 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:30,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:30,695 INFO L82 PathProgramCache]: Analyzing trace with hash 301838314, now seen corresponding path program 1 times [2019-11-15 21:19:30,696 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:30,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895887713] [2019-11-15 21:19:30,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:30,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:30,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:30,845 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-15 21:19:30,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895887713] [2019-11-15 21:19:30,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:30,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:30,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071439275] [2019-11-15 21:19:30,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:30,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:30,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:30,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:30,848 INFO L87 Difference]: Start difference. First operand 1101 states and 1637 transitions. Second operand 4 states. [2019-11-15 21:19:31,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:31,404 INFO L93 Difference]: Finished difference Result 2299 states and 3393 transitions. [2019-11-15 21:19:31,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:31,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-15 21:19:31,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:31,413 INFO L225 Difference]: With dead ends: 2299 [2019-11-15 21:19:31,413 INFO L226 Difference]: Without dead ends: 1208 [2019-11-15 21:19:31,415 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 21:19:31,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2019-11-15 21:19:31,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1101. [2019-11-15 21:19:31,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-11-15 21:19:31,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1631 transitions. [2019-11-15 21:19:31,450 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1631 transitions. Word has length 157 [2019-11-15 21:19:31,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:31,451 INFO L462 AbstractCegarLoop]: Abstraction has 1101 states and 1631 transitions. [2019-11-15 21:19:31,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:31,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1631 transitions. [2019-11-15 21:19:31,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-15 21:19:31,455 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:31,456 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 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] [2019-11-15 21:19:31,456 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:31,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:31,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1956986361, now seen corresponding path program 1 times [2019-11-15 21:19:31,457 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:31,457 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876692587] [2019-11-15 21:19:31,457 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:31,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:31,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:31,630 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 229 proven. 1 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-15 21:19:31,631 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876692587] [2019-11-15 21:19:31,631 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932329311] [2019-11-15 21:19:31,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/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 21:19:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:31,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 21:19:31,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:19:31,988 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 21:19:31,988 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 21:19:31,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:31,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:31,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:19:31,996 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 21:19:32,050 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 21:19:32,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 21:19:32,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:32,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:32,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:19:32,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2019-11-15 21:19:32,119 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-15 21:19:32,119 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:19:32,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 21:19:32,120 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644043768] [2019-11-15 21:19:32,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:32,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:32,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:32,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:19:32,122 INFO L87 Difference]: Start difference. First operand 1101 states and 1631 transitions. Second operand 4 states. [2019-11-15 21:19:32,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:32,659 INFO L93 Difference]: Finished difference Result 2299 states and 3381 transitions. [2019-11-15 21:19:32,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:32,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-15 21:19:32,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:32,669 INFO L225 Difference]: With dead ends: 2299 [2019-11-15 21:19:32,669 INFO L226 Difference]: Without dead ends: 1208 [2019-11-15 21:19:32,673 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:19:32,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2019-11-15 21:19:32,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1101. [2019-11-15 21:19:32,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-11-15 21:19:32,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1625 transitions. [2019-11-15 21:19:32,722 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1625 transitions. Word has length 157 [2019-11-15 21:19:32,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:32,722 INFO L462 AbstractCegarLoop]: Abstraction has 1101 states and 1625 transitions. [2019-11-15 21:19:32,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:32,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1625 transitions. [2019-11-15 21:19:32,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-15 21:19:32,727 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:32,727 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 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] [2019-11-15 21:19:32,940 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:19:32,940 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:32,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:32,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1343611909, now seen corresponding path program 1 times [2019-11-15 21:19:32,941 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:32,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12540262] [2019-11-15 21:19:32,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:32,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:32,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:33,080 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-15 21:19:33,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12540262] [2019-11-15 21:19:33,081 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:33,081 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:33,081 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455392070] [2019-11-15 21:19:33,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:33,083 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:33,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:33,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:33,083 INFO L87 Difference]: Start difference. First operand 1101 states and 1625 transitions. Second operand 4 states. [2019-11-15 21:19:33,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:33,598 INFO L93 Difference]: Finished difference Result 2471 states and 3655 transitions. [2019-11-15 21:19:33,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:33,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-15 21:19:33,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:33,608 INFO L225 Difference]: With dead ends: 2471 [2019-11-15 21:19:33,608 INFO L226 Difference]: Without dead ends: 1380 [2019-11-15 21:19:33,611 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 21:19:33,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2019-11-15 21:19:33,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1233. [2019-11-15 21:19:33,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2019-11-15 21:19:33,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1853 transitions. [2019-11-15 21:19:33,658 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1853 transitions. Word has length 157 [2019-11-15 21:19:33,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:33,659 INFO L462 AbstractCegarLoop]: Abstraction has 1233 states and 1853 transitions. [2019-11-15 21:19:33,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:33,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1853 transitions. [2019-11-15 21:19:33,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-15 21:19:33,663 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:33,665 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 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] [2019-11-15 21:19:33,665 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:33,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:33,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1945125106, now seen corresponding path program 1 times [2019-11-15 21:19:33,666 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:33,666 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210018127] [2019-11-15 21:19:33,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:33,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:33,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:33,893 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 231 proven. 1 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-15 21:19:33,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210018127] [2019-11-15 21:19:33,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560717777] [2019-11-15 21:19:33,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/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 21:19:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:34,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 21:19:34,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:19:34,183 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 21:19:34,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 21:19:34,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:34,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:34,195 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:19:34,195 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 21:19:34,220 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 21:19:34,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 21:19:34,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:34,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:34,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:19:34,226 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2019-11-15 21:19:34,272 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-15 21:19:34,273 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:19:34,273 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 21:19:34,273 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605990965] [2019-11-15 21:19:34,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:34,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:34,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:34,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:19:34,275 INFO L87 Difference]: Start difference. First operand 1233 states and 1853 transitions. Second operand 4 states. [2019-11-15 21:19:34,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:34,841 INFO L93 Difference]: Finished difference Result 2541 states and 3794 transitions. [2019-11-15 21:19:34,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:34,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-15 21:19:34,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:34,850 INFO L225 Difference]: With dead ends: 2541 [2019-11-15 21:19:34,851 INFO L226 Difference]: Without dead ends: 1318 [2019-11-15 21:19:34,853 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:19:34,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2019-11-15 21:19:34,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1233. [2019-11-15 21:19:34,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2019-11-15 21:19:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1847 transitions. [2019-11-15 21:19:34,899 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1847 transitions. Word has length 158 [2019-11-15 21:19:34,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:34,900 INFO L462 AbstractCegarLoop]: Abstraction has 1233 states and 1847 transitions. [2019-11-15 21:19:34,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:34,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1847 transitions. [2019-11-15 21:19:34,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-15 21:19:34,904 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:34,906 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2019-11-15 21:19:35,110 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:19:35,111 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:35,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:35,111 INFO L82 PathProgramCache]: Analyzing trace with hash 931552525, now seen corresponding path program 1 times [2019-11-15 21:19:35,111 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:35,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458049025] [2019-11-15 21:19:35,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:35,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:35,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:35,315 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-11-15 21:19:35,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458049025] [2019-11-15 21:19:35,316 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:35,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:35,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012924990] [2019-11-15 21:19:35,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:35,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:35,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:35,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:35,317 INFO L87 Difference]: Start difference. First operand 1233 states and 1847 transitions. Second operand 4 states. [2019-11-15 21:19:36,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:36,024 INFO L93 Difference]: Finished difference Result 3013 states and 4517 transitions. [2019-11-15 21:19:36,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:36,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-11-15 21:19:36,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:36,046 INFO L225 Difference]: With dead ends: 3013 [2019-11-15 21:19:36,053 INFO L226 Difference]: Without dead ends: 1790 [2019-11-15 21:19:36,055 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 21:19:36,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-11-15 21:19:36,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1383. [2019-11-15 21:19:36,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1383 states. [2019-11-15 21:19:36,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 2105 transitions. [2019-11-15 21:19:36,106 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 2105 transitions. Word has length 161 [2019-11-15 21:19:36,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:36,106 INFO L462 AbstractCegarLoop]: Abstraction has 1383 states and 2105 transitions. [2019-11-15 21:19:36,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:36,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2105 transitions. [2019-11-15 21:19:36,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-15 21:19:36,112 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:36,112 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2019-11-15 21:19:36,112 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:36,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:36,113 INFO L82 PathProgramCache]: Analyzing trace with hash 797539019, now seen corresponding path program 1 times [2019-11-15 21:19:36,113 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:36,113 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433752332] [2019-11-15 21:19:36,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:36,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:36,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:36,247 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-11-15 21:19:36,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433752332] [2019-11-15 21:19:36,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:36,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:36,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204906499] [2019-11-15 21:19:36,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:36,250 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:36,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:36,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:36,251 INFO L87 Difference]: Start difference. First operand 1383 states and 2105 transitions. Second operand 4 states. [2019-11-15 21:19:36,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:36,896 INFO L93 Difference]: Finished difference Result 3307 states and 5027 transitions. [2019-11-15 21:19:36,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:36,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-11-15 21:19:36,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:36,906 INFO L225 Difference]: With dead ends: 3307 [2019-11-15 21:19:36,907 INFO L226 Difference]: Without dead ends: 1934 [2019-11-15 21:19:36,909 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 21:19:36,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2019-11-15 21:19:36,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1377. [2019-11-15 21:19:36,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1377 states. [2019-11-15 21:19:36,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 2099 transitions. [2019-11-15 21:19:36,958 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 2099 transitions. Word has length 161 [2019-11-15 21:19:36,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:36,959 INFO L462 AbstractCegarLoop]: Abstraction has 1377 states and 2099 transitions. [2019-11-15 21:19:36,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:36,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 2099 transitions. [2019-11-15 21:19:36,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-15 21:19:36,964 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:36,964 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2019-11-15 21:19:36,965 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:36,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:36,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1191060756, now seen corresponding path program 1 times [2019-11-15 21:19:36,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:36,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804966291] [2019-11-15 21:19:36,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:36,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:36,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:37,106 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-11-15 21:19:37,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804966291] [2019-11-15 21:19:37,107 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:37,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:37,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602962980] [2019-11-15 21:19:37,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:37,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:37,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:37,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:37,108 INFO L87 Difference]: Start difference. First operand 1377 states and 2099 transitions. Second operand 4 states. [2019-11-15 21:19:37,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:37,756 INFO L93 Difference]: Finished difference Result 3281 states and 4995 transitions. [2019-11-15 21:19:37,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:37,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-11-15 21:19:37,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:37,771 INFO L225 Difference]: With dead ends: 3281 [2019-11-15 21:19:37,771 INFO L226 Difference]: Without dead ends: 1914 [2019-11-15 21:19:37,774 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 21:19:37,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2019-11-15 21:19:37,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1508. [2019-11-15 21:19:37,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2019-11-15 21:19:37,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2323 transitions. [2019-11-15 21:19:37,823 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 2323 transitions. Word has length 162 [2019-11-15 21:19:37,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:37,824 INFO L462 AbstractCegarLoop]: Abstraction has 1508 states and 2323 transitions. [2019-11-15 21:19:37,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:37,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2323 transitions. [2019-11-15 21:19:37,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-15 21:19:37,829 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:37,829 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2019-11-15 21:19:37,830 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:37,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:37,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1050512146, now seen corresponding path program 1 times [2019-11-15 21:19:37,830 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:37,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185902656] [2019-11-15 21:19:37,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:37,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:37,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:37,961 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-11-15 21:19:37,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185902656] [2019-11-15 21:19:37,962 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:37,962 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:37,962 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982167088] [2019-11-15 21:19:37,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:37,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:37,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:37,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:37,964 INFO L87 Difference]: Start difference. First operand 1508 states and 2323 transitions. Second operand 4 states. [2019-11-15 21:19:38,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:38,533 INFO L93 Difference]: Finished difference Result 3393 states and 5185 transitions. [2019-11-15 21:19:38,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:38,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-11-15 21:19:38,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:38,541 INFO L225 Difference]: With dead ends: 3393 [2019-11-15 21:19:38,542 INFO L226 Difference]: Without dead ends: 1895 [2019-11-15 21:19:38,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 21:19:38,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2019-11-15 21:19:38,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1358. [2019-11-15 21:19:38,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2019-11-15 21:19:38,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 2065 transitions. [2019-11-15 21:19:38,588 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 2065 transitions. Word has length 162 [2019-11-15 21:19:38,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:38,588 INFO L462 AbstractCegarLoop]: Abstraction has 1358 states and 2065 transitions. [2019-11-15 21:19:38,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:38,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 2065 transitions. [2019-11-15 21:19:38,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-15 21:19:38,594 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:38,594 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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] [2019-11-15 21:19:38,595 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:38,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:38,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1050364799, now seen corresponding path program 2 times [2019-11-15 21:19:38,595 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:38,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838313645] [2019-11-15 21:19:38,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:38,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:38,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:38,737 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-11-15 21:19:38,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838313645] [2019-11-15 21:19:38,738 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:38,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:38,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030605091] [2019-11-15 21:19:38,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:38,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:38,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:38,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:38,741 INFO L87 Difference]: Start difference. First operand 1358 states and 2065 transitions. Second operand 4 states. [2019-11-15 21:19:39,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:39,328 INFO L93 Difference]: Finished difference Result 3237 states and 4915 transitions. [2019-11-15 21:19:39,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:39,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-11-15 21:19:39,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:39,335 INFO L225 Difference]: With dead ends: 3237 [2019-11-15 21:19:39,335 INFO L226 Difference]: Without dead ends: 1889 [2019-11-15 21:19:39,338 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 21:19:39,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2019-11-15 21:19:39,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1430. [2019-11-15 21:19:39,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1430 states. [2019-11-15 21:19:39,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 2167 transitions. [2019-11-15 21:19:39,391 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 2167 transitions. Word has length 176 [2019-11-15 21:19:39,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:39,392 INFO L462 AbstractCegarLoop]: Abstraction has 1430 states and 2167 transitions. [2019-11-15 21:19:39,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:39,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 2167 transitions. [2019-11-15 21:19:39,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-15 21:19:39,398 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:39,399 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 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] [2019-11-15 21:19:39,399 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:39,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:39,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1069020257, now seen corresponding path program 1 times [2019-11-15 21:19:39,400 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:39,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273048684] [2019-11-15 21:19:39,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:39,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:39,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:39,567 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-11-15 21:19:39,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273048684] [2019-11-15 21:19:39,567 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:39,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:39,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439521627] [2019-11-15 21:19:39,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:39,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:39,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:39,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:39,570 INFO L87 Difference]: Start difference. First operand 1430 states and 2167 transitions. Second operand 4 states. [2019-11-15 21:19:40,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:40,091 INFO L93 Difference]: Finished difference Result 3309 states and 5011 transitions. [2019-11-15 21:19:40,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:40,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-11-15 21:19:40,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:40,097 INFO L225 Difference]: With dead ends: 3309 [2019-11-15 21:19:40,097 INFO L226 Difference]: Without dead ends: 1889 [2019-11-15 21:19:40,100 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 21:19:40,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2019-11-15 21:19:40,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1436. [2019-11-15 21:19:40,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1436 states. [2019-11-15 21:19:40,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2173 transitions. [2019-11-15 21:19:40,143 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2173 transitions. Word has length 176 [2019-11-15 21:19:40,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:40,144 INFO L462 AbstractCegarLoop]: Abstraction has 1436 states and 2173 transitions. [2019-11-15 21:19:40,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:40,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2173 transitions. [2019-11-15 21:19:40,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-15 21:19:40,149 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:40,150 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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] [2019-11-15 21:19:40,150 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:40,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:40,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1399235331, now seen corresponding path program 2 times [2019-11-15 21:19:40,151 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:40,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006323005] [2019-11-15 21:19:40,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:40,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:40,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-11-15 21:19:40,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006323005] [2019-11-15 21:19:40,279 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:40,279 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:40,279 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439022245] [2019-11-15 21:19:40,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:40,280 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:40,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:40,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:40,281 INFO L87 Difference]: Start difference. First operand 1436 states and 2173 transitions. Second operand 4 states. [2019-11-15 21:19:40,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:40,787 INFO L93 Difference]: Finished difference Result 3315 states and 5011 transitions. [2019-11-15 21:19:40,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:40,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-11-15 21:19:40,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:40,792 INFO L225 Difference]: With dead ends: 3315 [2019-11-15 21:19:40,792 INFO L226 Difference]: Without dead ends: 1889 [2019-11-15 21:19:40,794 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 21:19:40,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2019-11-15 21:19:40,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1436. [2019-11-15 21:19:40,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1436 states. [2019-11-15 21:19:40,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2167 transitions. [2019-11-15 21:19:40,838 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2167 transitions. Word has length 176 [2019-11-15 21:19:40,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:40,838 INFO L462 AbstractCegarLoop]: Abstraction has 1436 states and 2167 transitions. [2019-11-15 21:19:40,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:40,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2167 transitions. [2019-11-15 21:19:40,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-15 21:19:40,844 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:40,844 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 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] [2019-11-15 21:19:40,844 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:40,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:40,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1380579873, now seen corresponding path program 1 times [2019-11-15 21:19:40,845 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:40,845 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137921129] [2019-11-15 21:19:40,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:40,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:40,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:40,968 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-11-15 21:19:40,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137921129] [2019-11-15 21:19:40,968 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:40,969 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:40,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291399467] [2019-11-15 21:19:40,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:40,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:40,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:40,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:40,970 INFO L87 Difference]: Start difference. First operand 1436 states and 2167 transitions. Second operand 4 states. [2019-11-15 21:19:41,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:41,500 INFO L93 Difference]: Finished difference Result 3315 states and 4999 transitions. [2019-11-15 21:19:41,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:41,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-11-15 21:19:41,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:41,506 INFO L225 Difference]: With dead ends: 3315 [2019-11-15 21:19:41,507 INFO L226 Difference]: Without dead ends: 1889 [2019-11-15 21:19:41,509 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 21:19:41,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2019-11-15 21:19:41,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1358. [2019-11-15 21:19:41,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2019-11-15 21:19:41,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 2053 transitions. [2019-11-15 21:19:41,552 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 2053 transitions. Word has length 176 [2019-11-15 21:19:41,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:41,553 INFO L462 AbstractCegarLoop]: Abstraction has 1358 states and 2053 transitions. [2019-11-15 21:19:41,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:41,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 2053 transitions. [2019-11-15 21:19:41,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-15 21:19:41,558 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:41,558 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 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] [2019-11-15 21:19:41,559 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:41,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:41,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1693677600, now seen corresponding path program 1 times [2019-11-15 21:19:41,559 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:41,560 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294652624] [2019-11-15 21:19:41,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:41,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:41,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:41,696 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-11-15 21:19:41,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294652624] [2019-11-15 21:19:41,697 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:41,697 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:41,697 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484767381] [2019-11-15 21:19:41,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:41,699 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:41,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:41,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:41,700 INFO L87 Difference]: Start difference. First operand 1358 states and 2053 transitions. Second operand 4 states. [2019-11-15 21:19:42,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:42,365 INFO L93 Difference]: Finished difference Result 3237 states and 4879 transitions. [2019-11-15 21:19:42,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:42,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-11-15 21:19:42,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:42,370 INFO L225 Difference]: With dead ends: 3237 [2019-11-15 21:19:42,370 INFO L226 Difference]: Without dead ends: 1889 [2019-11-15 21:19:42,373 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 21:19:42,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2019-11-15 21:19:42,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1442. [2019-11-15 21:19:42,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1442 states. [2019-11-15 21:19:42,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1442 states and 2167 transitions. [2019-11-15 21:19:42,419 INFO L78 Accepts]: Start accepts. Automaton has 1442 states and 2167 transitions. Word has length 177 [2019-11-15 21:19:42,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:42,421 INFO L462 AbstractCegarLoop]: Abstraction has 1442 states and 2167 transitions. [2019-11-15 21:19:42,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:42,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 2167 transitions. [2019-11-15 21:19:42,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-15 21:19:42,427 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:42,427 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 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] [2019-11-15 21:19:42,427 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:42,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:42,428 INFO L82 PathProgramCache]: Analyzing trace with hash 321870302, now seen corresponding path program 1 times [2019-11-15 21:19:42,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:42,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787800665] [2019-11-15 21:19:42,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:42,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:42,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:42,551 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-11-15 21:19:42,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787800665] [2019-11-15 21:19:42,552 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:42,552 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:42,552 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299469750] [2019-11-15 21:19:42,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:42,554 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:42,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:42,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:42,555 INFO L87 Difference]: Start difference. First operand 1442 states and 2167 transitions. Second operand 4 states. [2019-11-15 21:19:43,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:43,225 INFO L93 Difference]: Finished difference Result 3321 states and 4987 transitions. [2019-11-15 21:19:43,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:43,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-11-15 21:19:43,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:43,230 INFO L225 Difference]: With dead ends: 3321 [2019-11-15 21:19:43,231 INFO L226 Difference]: Without dead ends: 1889 [2019-11-15 21:19:43,233 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 21:19:43,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2019-11-15 21:19:43,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1358. [2019-11-15 21:19:43,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2019-11-15 21:19:43,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 2047 transitions. [2019-11-15 21:19:43,273 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 2047 transitions. Word has length 177 [2019-11-15 21:19:43,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:43,274 INFO L462 AbstractCegarLoop]: Abstraction has 1358 states and 2047 transitions. [2019-11-15 21:19:43,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:43,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 2047 transitions. [2019-11-15 21:19:43,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-15 21:19:43,279 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:43,279 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 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] [2019-11-15 21:19:43,280 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:43,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:43,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1103002364, now seen corresponding path program 1 times [2019-11-15 21:19:43,280 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:43,281 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972924454] [2019-11-15 21:19:43,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:43,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:43,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:43,401 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-11-15 21:19:43,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972924454] [2019-11-15 21:19:43,401 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:43,401 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:43,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260776106] [2019-11-15 21:19:43,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:43,402 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:43,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:43,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:43,403 INFO L87 Difference]: Start difference. First operand 1358 states and 2047 transitions. Second operand 4 states. [2019-11-15 21:19:44,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:44,152 INFO L93 Difference]: Finished difference Result 3237 states and 4861 transitions. [2019-11-15 21:19:44,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:44,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-15 21:19:44,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:44,157 INFO L225 Difference]: With dead ends: 3237 [2019-11-15 21:19:44,157 INFO L226 Difference]: Without dead ends: 1889 [2019-11-15 21:19:44,160 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 21:19:44,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2019-11-15 21:19:44,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1448. [2019-11-15 21:19:44,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1448 states. [2019-11-15 21:19:44,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 2167 transitions. [2019-11-15 21:19:44,204 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 2167 transitions. Word has length 178 [2019-11-15 21:19:44,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:44,205 INFO L462 AbstractCegarLoop]: Abstraction has 1448 states and 2167 transitions. [2019-11-15 21:19:44,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:44,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 2167 transitions. [2019-11-15 21:19:44,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-15 21:19:44,208 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:44,209 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 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] [2019-11-15 21:19:44,209 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:44,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:44,209 INFO L82 PathProgramCache]: Analyzing trace with hash -679355642, now seen corresponding path program 1 times [2019-11-15 21:19:44,210 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:44,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251231287] [2019-11-15 21:19:44,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:44,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:44,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:44,338 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-11-15 21:19:44,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251231287] [2019-11-15 21:19:44,340 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:44,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:44,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089219379] [2019-11-15 21:19:44,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:44,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:44,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:44,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:44,342 INFO L87 Difference]: Start difference. First operand 1448 states and 2167 transitions. Second operand 4 states. [2019-11-15 21:19:44,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:44,905 INFO L93 Difference]: Finished difference Result 3327 states and 4975 transitions. [2019-11-15 21:19:44,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:44,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-15 21:19:44,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:44,910 INFO L225 Difference]: With dead ends: 3327 [2019-11-15 21:19:44,910 INFO L226 Difference]: Without dead ends: 1889 [2019-11-15 21:19:44,912 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 21:19:44,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2019-11-15 21:19:44,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1358. [2019-11-15 21:19:44,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2019-11-15 21:19:44,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 2041 transitions. [2019-11-15 21:19:44,958 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 2041 transitions. Word has length 178 [2019-11-15 21:19:44,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:44,958 INFO L462 AbstractCegarLoop]: Abstraction has 1358 states and 2041 transitions. [2019-11-15 21:19:44,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:44,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 2041 transitions. [2019-11-15 21:19:44,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-15 21:19:44,962 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:44,962 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 5, 5, 4, 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] [2019-11-15 21:19:44,962 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:44,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:44,963 INFO L82 PathProgramCache]: Analyzing trace with hash -146735643, now seen corresponding path program 1 times [2019-11-15 21:19:44,963 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:44,963 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593075134] [2019-11-15 21:19:44,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:44,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:44,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:45,117 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-11-15 21:19:45,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593075134] [2019-11-15 21:19:45,118 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:45,118 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:45,119 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198504157] [2019-11-15 21:19:45,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:45,119 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:45,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:45,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:45,120 INFO L87 Difference]: Start difference. First operand 1358 states and 2041 transitions. Second operand 4 states. [2019-11-15 21:19:45,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:45,682 INFO L93 Difference]: Finished difference Result 3183 states and 4777 transitions. [2019-11-15 21:19:45,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:45,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-11-15 21:19:45,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:45,684 INFO L225 Difference]: With dead ends: 3183 [2019-11-15 21:19:45,684 INFO L226 Difference]: Without dead ends: 1835 [2019-11-15 21:19:45,686 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 21:19:45,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2019-11-15 21:19:45,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1454. [2019-11-15 21:19:45,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2019-11-15 21:19:45,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 2167 transitions. [2019-11-15 21:19:45,733 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 2167 transitions. Word has length 179 [2019-11-15 21:19:45,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:45,734 INFO L462 AbstractCegarLoop]: Abstraction has 1454 states and 2167 transitions. [2019-11-15 21:19:45,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:45,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 2167 transitions. [2019-11-15 21:19:45,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-15 21:19:45,737 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:45,738 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 5, 5, 4, 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] [2019-11-15 21:19:45,738 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:45,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:45,739 INFO L82 PathProgramCache]: Analyzing trace with hash 101410851, now seen corresponding path program 1 times [2019-11-15 21:19:45,739 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:45,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075001266] [2019-11-15 21:19:45,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:45,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:45,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:45,864 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-11-15 21:19:45,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075001266] [2019-11-15 21:19:45,865 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:45,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:45,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369618627] [2019-11-15 21:19:45,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:45,866 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:45,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:45,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:45,867 INFO L87 Difference]: Start difference. First operand 1454 states and 2167 transitions. Second operand 4 states. [2019-11-15 21:19:46,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:46,462 INFO L93 Difference]: Finished difference Result 3279 states and 4897 transitions. [2019-11-15 21:19:46,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:46,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-11-15 21:19:46,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:46,466 INFO L225 Difference]: With dead ends: 3279 [2019-11-15 21:19:46,466 INFO L226 Difference]: Without dead ends: 1835 [2019-11-15 21:19:46,468 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 21:19:46,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2019-11-15 21:19:46,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1358. [2019-11-15 21:19:46,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2019-11-15 21:19:46,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 2035 transitions. [2019-11-15 21:19:46,515 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 2035 transitions. Word has length 179 [2019-11-15 21:19:46,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:46,515 INFO L462 AbstractCegarLoop]: Abstraction has 1358 states and 2035 transitions. [2019-11-15 21:19:46,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:46,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 2035 transitions. [2019-11-15 21:19:46,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-15 21:19:46,519 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:46,519 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:19:46,520 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:46,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:46,520 INFO L82 PathProgramCache]: Analyzing trace with hash 393615027, now seen corresponding path program 1 times [2019-11-15 21:19:46,520 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:46,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350807450] [2019-11-15 21:19:46,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:46,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:46,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:46,657 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-11-15 21:19:46,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350807450] [2019-11-15 21:19:46,657 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:46,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:46,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226636100] [2019-11-15 21:19:46,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:46,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:46,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:46,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:46,659 INFO L87 Difference]: Start difference. First operand 1358 states and 2035 transitions. Second operand 4 states. [2019-11-15 21:19:47,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:47,281 INFO L93 Difference]: Finished difference Result 3183 states and 4759 transitions. [2019-11-15 21:19:47,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:47,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-11-15 21:19:47,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:47,283 INFO L225 Difference]: With dead ends: 3183 [2019-11-15 21:19:47,283 INFO L226 Difference]: Without dead ends: 1835 [2019-11-15 21:19:47,285 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 21:19:47,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2019-11-15 21:19:47,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1496. [2019-11-15 21:19:47,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2019-11-15 21:19:47,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2239 transitions. [2019-11-15 21:19:47,326 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2239 transitions. Word has length 182 [2019-11-15 21:19:47,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:47,326 INFO L462 AbstractCegarLoop]: Abstraction has 1496 states and 2239 transitions. [2019-11-15 21:19:47,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2239 transitions. [2019-11-15 21:19:47,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-15 21:19:47,330 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:47,330 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:19:47,330 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:47,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:47,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1287101365, now seen corresponding path program 1 times [2019-11-15 21:19:47,331 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:47,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953033550] [2019-11-15 21:19:47,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:47,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:47,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:47,469 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-11-15 21:19:47,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953033550] [2019-11-15 21:19:47,470 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:47,470 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:47,470 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015722650] [2019-11-15 21:19:47,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:47,471 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:47,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:47,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:47,472 INFO L87 Difference]: Start difference. First operand 1496 states and 2239 transitions. Second operand 4 states. [2019-11-15 21:19:47,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:47,950 INFO L93 Difference]: Finished difference Result 3331 states and 4977 transitions. [2019-11-15 21:19:47,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:47,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-11-15 21:19:47,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:47,952 INFO L225 Difference]: With dead ends: 3331 [2019-11-15 21:19:47,952 INFO L226 Difference]: Without dead ends: 1845 [2019-11-15 21:19:47,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 21:19:47,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2019-11-15 21:19:48,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1368. [2019-11-15 21:19:48,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2019-11-15 21:19:48,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2049 transitions. [2019-11-15 21:19:48,009 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2049 transitions. Word has length 182 [2019-11-15 21:19:48,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:48,009 INFO L462 AbstractCegarLoop]: Abstraction has 1368 states and 2049 transitions. [2019-11-15 21:19:48,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:48,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2049 transitions. [2019-11-15 21:19:48,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-15 21:19:48,012 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:48,013 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 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] [2019-11-15 21:19:48,013 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:48,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:48,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1119344236, now seen corresponding path program 1 times [2019-11-15 21:19:48,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:48,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651227522] [2019-11-15 21:19:48,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:48,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:48,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:48,202 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-11-15 21:19:48,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651227522] [2019-11-15 21:19:48,203 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:48,203 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:48,203 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684473717] [2019-11-15 21:19:48,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:48,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:48,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:48,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:48,205 INFO L87 Difference]: Start difference. First operand 1368 states and 2049 transitions. Second operand 4 states. [2019-11-15 21:19:48,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:48,769 INFO L93 Difference]: Finished difference Result 3185 states and 4760 transitions. [2019-11-15 21:19:48,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:48,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-11-15 21:19:48,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:48,772 INFO L225 Difference]: With dead ends: 3185 [2019-11-15 21:19:48,772 INFO L226 Difference]: Without dead ends: 1827 [2019-11-15 21:19:48,774 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 21:19:48,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2019-11-15 21:19:48,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1512. [2019-11-15 21:19:48,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2019-11-15 21:19:48,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2259 transitions. [2019-11-15 21:19:48,823 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2259 transitions. Word has length 183 [2019-11-15 21:19:48,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:48,824 INFO L462 AbstractCegarLoop]: Abstraction has 1512 states and 2259 transitions. [2019-11-15 21:19:48,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:48,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2259 transitions. [2019-11-15 21:19:48,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-15 21:19:48,830 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:48,830 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 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] [2019-11-15 21:19:48,830 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:48,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:48,831 INFO L82 PathProgramCache]: Analyzing trace with hash 808928466, now seen corresponding path program 1 times [2019-11-15 21:19:48,831 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:48,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555046408] [2019-11-15 21:19:48,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:48,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:48,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:48,970 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-11-15 21:19:48,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555046408] [2019-11-15 21:19:48,971 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:48,971 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:48,971 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692136892] [2019-11-15 21:19:48,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:48,972 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:48,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:48,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:48,973 INFO L87 Difference]: Start difference. First operand 1512 states and 2259 transitions. Second operand 4 states. [2019-11-15 21:19:49,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:49,416 INFO L93 Difference]: Finished difference Result 3334 states and 4974 transitions. [2019-11-15 21:19:49,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:49,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-11-15 21:19:49,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:49,419 INFO L225 Difference]: With dead ends: 3334 [2019-11-15 21:19:49,419 INFO L226 Difference]: Without dead ends: 1832 [2019-11-15 21:19:49,420 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:19:49,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2019-11-15 21:19:49,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1373. [2019-11-15 21:19:49,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2019-11-15 21:19:49,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 2053 transitions. [2019-11-15 21:19:49,453 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 2053 transitions. Word has length 183 [2019-11-15 21:19:49,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:49,454 INFO L462 AbstractCegarLoop]: Abstraction has 1373 states and 2053 transitions. [2019-11-15 21:19:49,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:49,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 2053 transitions. [2019-11-15 21:19:49,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-15 21:19:49,456 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:49,456 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 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] [2019-11-15 21:19:49,457 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:49,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:49,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1139868884, now seen corresponding path program 1 times [2019-11-15 21:19:49,457 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:49,457 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20418177] [2019-11-15 21:19:49,457 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:49,457 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:49,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:49,607 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 177 proven. 39 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-11-15 21:19:49,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20418177] [2019-11-15 21:19:49,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211717916] [2019-11-15 21:19:49,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:19:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:49,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 21:19:49,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:19:49,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-15 21:19:49,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:49,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:49,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:19:49,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 21:19:49,902 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 21:19:49,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 21:19:49,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:49,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:49,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:19:49,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 21:19:49,931 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 21:19:49,931 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 21:19:49,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:49,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:49,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:19:49,935 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 21:19:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 177 proven. 39 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-11-15 21:19:49,986 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:19:49,986 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 21:19:49,986 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495449531] [2019-11-15 21:19:49,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:19:49,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:49,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:19:49,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:19:49,988 INFO L87 Difference]: Start difference. First operand 1373 states and 2053 transitions. Second operand 8 states. [2019-11-15 21:19:50,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:50,820 INFO L93 Difference]: Finished difference Result 2880 states and 4294 transitions. [2019-11-15 21:19:50,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:19:50,821 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 191 [2019-11-15 21:19:50,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:50,823 INFO L225 Difference]: With dead ends: 2880 [2019-11-15 21:19:50,823 INFO L226 Difference]: Without dead ends: 1517 [2019-11-15 21:19:50,825 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:19:50,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2019-11-15 21:19:50,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1439. [2019-11-15 21:19:50,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1439 states. [2019-11-15 21:19:50,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2138 transitions. [2019-11-15 21:19:50,860 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2138 transitions. Word has length 191 [2019-11-15 21:19:50,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:50,860 INFO L462 AbstractCegarLoop]: Abstraction has 1439 states and 2138 transitions. [2019-11-15 21:19:50,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:19:50,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2138 transitions. [2019-11-15 21:19:50,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-15 21:19:50,863 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:50,863 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 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] [2019-11-15 21:19:51,067 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:19:51,067 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:51,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:51,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1158524342, now seen corresponding path program 1 times [2019-11-15 21:19:51,068 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:51,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848869028] [2019-11-15 21:19:51,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:51,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:51,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:51,208 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 182 proven. 34 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2019-11-15 21:19:51,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848869028] [2019-11-15 21:19:51,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127932940] [2019-11-15 21:19:51,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:19:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:51,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 21:19:51,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:19:51,477 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-15 21:19:51,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:51,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:51,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:19:51,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 21:19:51,510 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 21:19:51,511 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 21:19:51,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:51,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:51,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:19:51,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 21:19:51,551 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 21:19:51,551 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 21:19:51,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:51,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:51,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:19:51,554 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 21:19:51,602 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 182 proven. 34 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2019-11-15 21:19:51,603 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:19:51,603 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 21:19:51,603 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786793158] [2019-11-15 21:19:51,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:19:51,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:51,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:19:51,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:19:51,605 INFO L87 Difference]: Start difference. First operand 1439 states and 2138 transitions. Second operand 8 states. [2019-11-15 21:19:52,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:52,552 INFO L93 Difference]: Finished difference Result 3007 states and 4441 transitions. [2019-11-15 21:19:52,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:19:52,552 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 191 [2019-11-15 21:19:52,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:52,555 INFO L225 Difference]: With dead ends: 3007 [2019-11-15 21:19:52,555 INFO L226 Difference]: Without dead ends: 1578 [2019-11-15 21:19:52,556 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:19:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2019-11-15 21:19:52,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1445. [2019-11-15 21:19:52,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-15 21:19:52,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2133 transitions. [2019-11-15 21:19:52,639 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2133 transitions. Word has length 191 [2019-11-15 21:19:52,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:52,639 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 2133 transitions. [2019-11-15 21:19:52,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:19:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2133 transitions. [2019-11-15 21:19:52,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-15 21:19:52,641 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:52,642 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 6, 6, 5, 5, 4, 4, 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] [2019-11-15 21:19:52,844 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:19:52,844 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:52,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:52,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1080949035, now seen corresponding path program 1 times [2019-11-15 21:19:52,845 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:52,845 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618604757] [2019-11-15 21:19:52,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:52,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:52,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:53,029 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 189 proven. 29 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2019-11-15 21:19:53,029 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618604757] [2019-11-15 21:19:53,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345482319] [2019-11-15 21:19:53,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:19:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:53,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 21:19:53,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:19:53,296 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-15 21:19:53,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:53,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:53,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:19:53,301 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 21:19:53,333 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 21:19:53,334 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 21:19:53,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:53,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:53,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:19:53,341 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 21:19:53,358 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 21:19:53,359 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 21:19:53,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:53,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:53,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:19:53,361 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 21:19:53,396 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 189 proven. 29 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2019-11-15 21:19:53,397 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:19:53,397 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 21:19:53,397 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506227013] [2019-11-15 21:19:53,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:19:53,398 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:53,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:19:53,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:19:53,399 INFO L87 Difference]: Start difference. First operand 1445 states and 2133 transitions. Second operand 8 states. [2019-11-15 21:19:54,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:54,198 INFO L93 Difference]: Finished difference Result 3019 states and 4431 transitions. [2019-11-15 21:19:54,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:19:54,199 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 192 [2019-11-15 21:19:54,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:54,200 INFO L225 Difference]: With dead ends: 3019 [2019-11-15 21:19:54,200 INFO L226 Difference]: Without dead ends: 1584 [2019-11-15 21:19:54,202 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:19:54,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2019-11-15 21:19:54,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1451. [2019-11-15 21:19:54,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2019-11-15 21:19:54,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2128 transitions. [2019-11-15 21:19:54,240 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2128 transitions. Word has length 192 [2019-11-15 21:19:54,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:54,240 INFO L462 AbstractCegarLoop]: Abstraction has 1451 states and 2128 transitions. [2019-11-15 21:19:54,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:19:54,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2128 transitions. [2019-11-15 21:19:54,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-15 21:19:54,244 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:54,244 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2019-11-15 21:19:54,449 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:19:54,449 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:54,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:54,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1782882441, now seen corresponding path program 1 times [2019-11-15 21:19:54,450 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:54,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776710237] [2019-11-15 21:19:54,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:54,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:54,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:54,586 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-11-15 21:19:54,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776710237] [2019-11-15 21:19:54,586 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:54,586 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:54,587 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512558676] [2019-11-15 21:19:54,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:54,587 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:54,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:54,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:54,587 INFO L87 Difference]: Start difference. First operand 1451 states and 2128 transitions. Second operand 4 states. [2019-11-15 21:19:54,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:54,964 INFO L93 Difference]: Finished difference Result 3171 states and 4636 transitions. [2019-11-15 21:19:54,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:54,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-15 21:19:54,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:54,966 INFO L225 Difference]: With dead ends: 3171 [2019-11-15 21:19:54,966 INFO L226 Difference]: Without dead ends: 1730 [2019-11-15 21:19:54,967 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 21:19:54,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2019-11-15 21:19:55,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1625. [2019-11-15 21:19:55,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1625 states. [2019-11-15 21:19:55,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 2380 transitions. [2019-11-15 21:19:55,012 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 2380 transitions. Word has length 192 [2019-11-15 21:19:55,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:55,012 INFO L462 AbstractCegarLoop]: Abstraction has 1625 states and 2380 transitions. [2019-11-15 21:19:55,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:55,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 2380 transitions. [2019-11-15 21:19:55,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-15 21:19:55,015 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:55,015 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2019-11-15 21:19:55,015 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:55,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:55,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1125299445, now seen corresponding path program 1 times [2019-11-15 21:19:55,016 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:55,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094437634] [2019-11-15 21:19:55,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:55,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:55,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2019-11-15 21:19:55,219 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094437634] [2019-11-15 21:19:55,219 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:55,219 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:55,220 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834581657] [2019-11-15 21:19:55,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:55,220 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:55,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:55,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:55,221 INFO L87 Difference]: Start difference. First operand 1625 states and 2380 transitions. Second operand 4 states. [2019-11-15 21:19:55,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:55,931 INFO L93 Difference]: Finished difference Result 3797 states and 5565 transitions. [2019-11-15 21:19:55,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:55,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-15 21:19:55,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:55,934 INFO L225 Difference]: With dead ends: 3797 [2019-11-15 21:19:55,934 INFO L226 Difference]: Without dead ends: 2182 [2019-11-15 21:19:55,935 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 21:19:55,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2019-11-15 21:19:55,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 1781. [2019-11-15 21:19:55,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1781 states. [2019-11-15 21:19:55,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2626 transitions. [2019-11-15 21:19:55,978 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2626 transitions. Word has length 192 [2019-11-15 21:19:55,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:55,979 INFO L462 AbstractCegarLoop]: Abstraction has 1781 states and 2626 transitions. [2019-11-15 21:19:55,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:55,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2626 transitions. [2019-11-15 21:19:55,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-15 21:19:55,981 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:55,982 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2019-11-15 21:19:55,982 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:55,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:55,982 INFO L82 PathProgramCache]: Analyzing trace with hash -991285939, now seen corresponding path program 1 times [2019-11-15 21:19:55,982 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:55,982 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530016124] [2019-11-15 21:19:55,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:55,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:55,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:56,117 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2019-11-15 21:19:56,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530016124] [2019-11-15 21:19:56,117 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:56,118 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:56,118 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26681809] [2019-11-15 21:19:56,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:56,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:56,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:56,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:56,119 INFO L87 Difference]: Start difference. First operand 1781 states and 2626 transitions. Second operand 4 states. [2019-11-15 21:19:56,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:56,856 INFO L93 Difference]: Finished difference Result 4097 states and 6045 transitions. [2019-11-15 21:19:56,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:56,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-15 21:19:56,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:56,859 INFO L225 Difference]: With dead ends: 4097 [2019-11-15 21:19:56,859 INFO L226 Difference]: Without dead ends: 2326 [2019-11-15 21:19:56,860 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 21:19:56,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2326 states. [2019-11-15 21:19:56,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2326 to 1775. [2019-11-15 21:19:56,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1775 states. [2019-11-15 21:19:56,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2620 transitions. [2019-11-15 21:19:56,905 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2620 transitions. Word has length 192 [2019-11-15 21:19:56,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:56,905 INFO L462 AbstractCegarLoop]: Abstraction has 1775 states and 2620 transitions. [2019-11-15 21:19:56,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:56,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2620 transitions. [2019-11-15 21:19:56,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-15 21:19:56,908 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:56,909 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 4, 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] [2019-11-15 21:19:56,909 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:56,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:56,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1217082129, now seen corresponding path program 1 times [2019-11-15 21:19:56,909 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:56,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327698541] [2019-11-15 21:19:56,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:56,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:56,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 196 proven. 24 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2019-11-15 21:19:57,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327698541] [2019-11-15 21:19:57,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581508659] [2019-11-15 21:19:57,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:19:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:57,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 21:19:57,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:19:57,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-15 21:19:57,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:57,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:57,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:19:57,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 21:19:57,466 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 21:19:57,466 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 21:19:57,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:57,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:57,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:19:57,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 21:19:57,501 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 21:19:57,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 21:19:57,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:57,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:57,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:19:57,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 21:19:57,553 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 196 proven. 24 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2019-11-15 21:19:57,553 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:19:57,554 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 21:19:57,554 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822376756] [2019-11-15 21:19:57,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:19:57,555 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:57,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:19:57,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:19:57,555 INFO L87 Difference]: Start difference. First operand 1775 states and 2620 transitions. Second operand 8 states. [2019-11-15 21:19:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:58,621 INFO L93 Difference]: Finished difference Result 3679 states and 5405 transitions. [2019-11-15 21:19:58,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:19:58,622 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 193 [2019-11-15 21:19:58,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:58,624 INFO L225 Difference]: With dead ends: 3679 [2019-11-15 21:19:58,625 INFO L226 Difference]: Without dead ends: 1914 [2019-11-15 21:19:58,627 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:19:58,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2019-11-15 21:19:58,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1781. [2019-11-15 21:19:58,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1781 states. [2019-11-15 21:19:58,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2609 transitions. [2019-11-15 21:19:58,690 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2609 transitions. Word has length 193 [2019-11-15 21:19:58,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:58,690 INFO L462 AbstractCegarLoop]: Abstraction has 1781 states and 2609 transitions. [2019-11-15 21:19:58,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:19:58,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2609 transitions. [2019-11-15 21:19:58,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-15 21:19:58,695 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:58,695 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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 21:19:58,902 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:19:58,902 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:58,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:58,903 INFO L82 PathProgramCache]: Analyzing trace with hash -528962386, now seen corresponding path program 1 times [2019-11-15 21:19:58,903 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:58,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575043950] [2019-11-15 21:19:58,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:58,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:58,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:59,091 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2019-11-15 21:19:59,091 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575043950] [2019-11-15 21:19:59,091 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:59,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:59,092 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890891136] [2019-11-15 21:19:59,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:59,093 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:59,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:59,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:59,093 INFO L87 Difference]: Start difference. First operand 1781 states and 2609 transitions. Second operand 4 states. [2019-11-15 21:19:59,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:59,606 INFO L93 Difference]: Finished difference Result 4083 states and 5985 transitions. [2019-11-15 21:19:59,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:19:59,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-11-15 21:19:59,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:59,608 INFO L225 Difference]: With dead ends: 4083 [2019-11-15 21:19:59,608 INFO L226 Difference]: Without dead ends: 2312 [2019-11-15 21:19:59,610 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 21:19:59,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2019-11-15 21:19:59,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 1910. [2019-11-15 21:19:59,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-11-15 21:19:59,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2807 transitions. [2019-11-15 21:19:59,656 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2807 transitions. Word has length 193 [2019-11-15 21:19:59,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:59,657 INFO L462 AbstractCegarLoop]: Abstraction has 1910 states and 2807 transitions. [2019-11-15 21:19:59,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:19:59,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2807 transitions. [2019-11-15 21:19:59,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-15 21:19:59,660 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:59,660 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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 21:19:59,660 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:19:59,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:59,661 INFO L82 PathProgramCache]: Analyzing trace with hash -669510996, now seen corresponding path program 1 times [2019-11-15 21:19:59,661 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:59,661 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282438382] [2019-11-15 21:19:59,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:59,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:59,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:59,794 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2019-11-15 21:19:59,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282438382] [2019-11-15 21:19:59,794 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:59,795 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:19:59,795 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156520448] [2019-11-15 21:19:59,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:19:59,796 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:59,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:19:59,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:19:59,796 INFO L87 Difference]: Start difference. First operand 1910 states and 2807 transitions. Second operand 4 states. [2019-11-15 21:20:00,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:00,338 INFO L93 Difference]: Finished difference Result 4191 states and 6147 transitions. [2019-11-15 21:20:00,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:00,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-11-15 21:20:00,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:00,340 INFO L225 Difference]: With dead ends: 4191 [2019-11-15 21:20:00,340 INFO L226 Difference]: Without dead ends: 2291 [2019-11-15 21:20:00,342 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 21:20:00,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2019-11-15 21:20:00,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 1760. [2019-11-15 21:20:00,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1760 states. [2019-11-15 21:20:00,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2573 transitions. [2019-11-15 21:20:00,389 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2573 transitions. Word has length 193 [2019-11-15 21:20:00,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:00,389 INFO L462 AbstractCegarLoop]: Abstraction has 1760 states and 2573 transitions. [2019-11-15 21:20:00,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:00,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2573 transitions. [2019-11-15 21:20:00,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-15 21:20:00,392 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:00,392 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 6, 6, 5, 5, 4, 4, 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] [2019-11-15 21:20:00,393 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:00,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:00,393 INFO L82 PathProgramCache]: Analyzing trace with hash 611758938, now seen corresponding path program 1 times [2019-11-15 21:20:00,393 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:00,394 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181042876] [2019-11-15 21:20:00,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:00,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:00,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:00,538 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 203 proven. 19 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-11-15 21:20:00,538 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181042876] [2019-11-15 21:20:00,539 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092711744] [2019-11-15 21:20:00,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:00,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 21:20:00,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:00,769 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-15 21:20:00,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:00,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:00,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:00,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 21:20:00,793 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 21:20:00,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 21:20:00,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:00,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:00,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:00,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 21:20:00,833 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 21:20:00,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 21:20:00,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:00,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:00,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:00,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 21:20:00,873 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 203 proven. 19 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-11-15 21:20:00,873 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:20:00,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 21:20:00,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422651255] [2019-11-15 21:20:00,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:20:00,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:00,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:20:00,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:20:00,875 INFO L87 Difference]: Start difference. First operand 1760 states and 2573 transitions. Second operand 8 states. [2019-11-15 21:20:01,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:01,616 INFO L93 Difference]: Finished difference Result 3356 states and 4893 transitions. [2019-11-15 21:20:01,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:20:01,617 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 194 [2019-11-15 21:20:01,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:01,618 INFO L225 Difference]: With dead ends: 3356 [2019-11-15 21:20:01,618 INFO L226 Difference]: Without dead ends: 1606 [2019-11-15 21:20:01,620 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:20:01,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2019-11-15 21:20:01,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1531. [2019-11-15 21:20:01,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1531 states. [2019-11-15 21:20:01,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 2217 transitions. [2019-11-15 21:20:01,659 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 2217 transitions. Word has length 194 [2019-11-15 21:20:01,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:01,660 INFO L462 AbstractCegarLoop]: Abstraction has 1531 states and 2217 transitions. [2019-11-15 21:20:01,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:20:01,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 2217 transitions. [2019-11-15 21:20:01,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-15 21:20:01,663 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:01,663 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2019-11-15 21:20:01,866 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:01,866 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:01,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:01,867 INFO L82 PathProgramCache]: Analyzing trace with hash -563035748, now seen corresponding path program 1 times [2019-11-15 21:20:01,867 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:01,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143870485] [2019-11-15 21:20:01,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:01,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:01,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:02,074 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-11-15 21:20:02,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143870485] [2019-11-15 21:20:02,074 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:02,075 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:02,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530773212] [2019-11-15 21:20:02,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:02,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:02,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:02,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:02,076 INFO L87 Difference]: Start difference. First operand 1531 states and 2217 transitions. Second operand 4 states. [2019-11-15 21:20:02,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:02,440 INFO L93 Difference]: Finished difference Result 3202 states and 4639 transitions. [2019-11-15 21:20:02,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:02,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-11-15 21:20:02,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:02,442 INFO L225 Difference]: With dead ends: 3202 [2019-11-15 21:20:02,443 INFO L226 Difference]: Without dead ends: 1681 [2019-11-15 21:20:02,444 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 21:20:02,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2019-11-15 21:20:02,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1576. [2019-11-15 21:20:02,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-15 21:20:02,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2292 transitions. [2019-11-15 21:20:02,483 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2292 transitions. Word has length 198 [2019-11-15 21:20:02,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:02,484 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 2292 transitions. [2019-11-15 21:20:02,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:02,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2292 transitions. [2019-11-15 21:20:02,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-15 21:20:02,486 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:02,487 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:02,487 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:02,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:02,487 INFO L82 PathProgramCache]: Analyzing trace with hash 970079390, now seen corresponding path program 1 times [2019-11-15 21:20:02,487 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:02,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310892807] [2019-11-15 21:20:02,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:02,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:02,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:02,718 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 361 proven. 1 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-11-15 21:20:02,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310892807] [2019-11-15 21:20:02,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996021862] [2019-11-15 21:20:02,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:02,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:20:02,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:02,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:20:02,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:02,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:02,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:02,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 21:20:02,977 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 21:20:02,978 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 21:20:02,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:02,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:02,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:02,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-15 21:20:03,004 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 21:20:03,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 21:20:03,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:03,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:03,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:03,007 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 21:20:03,069 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-11-15 21:20:03,070 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:20:03,070 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-15 21:20:03,070 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040296282] [2019-11-15 21:20:03,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:20:03,071 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:03,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:20:03,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:20:03,072 INFO L87 Difference]: Start difference. First operand 1576 states and 2292 transitions. Second operand 5 states. [2019-11-15 21:20:03,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:03,555 INFO L93 Difference]: Finished difference Result 3427 states and 4993 transitions. [2019-11-15 21:20:03,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:20:03,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 200 [2019-11-15 21:20:03,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:03,558 INFO L225 Difference]: With dead ends: 3427 [2019-11-15 21:20:03,558 INFO L226 Difference]: Without dead ends: 1861 [2019-11-15 21:20:03,560 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 199 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:20:03,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2019-11-15 21:20:03,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1586. [2019-11-15 21:20:03,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2019-11-15 21:20:03,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 2307 transitions. [2019-11-15 21:20:03,600 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 2307 transitions. Word has length 200 [2019-11-15 21:20:03,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:03,601 INFO L462 AbstractCegarLoop]: Abstraction has 1586 states and 2307 transitions. [2019-11-15 21:20:03,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:20:03,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 2307 transitions. [2019-11-15 21:20:03,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-15 21:20:03,603 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:03,603 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 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] [2019-11-15 21:20:03,803 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:03,804 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:03,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:03,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1088911914, now seen corresponding path program 1 times [2019-11-15 21:20:03,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:03,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150423435] [2019-11-15 21:20:03,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:03,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:03,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:03,935 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-11-15 21:20:03,935 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150423435] [2019-11-15 21:20:03,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:03,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:03,936 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811611696] [2019-11-15 21:20:03,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:03,937 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:03,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:03,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:03,937 INFO L87 Difference]: Start difference. First operand 1586 states and 2307 transitions. Second operand 4 states. [2019-11-15 21:20:04,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:04,313 INFO L93 Difference]: Finished difference Result 3252 states and 4719 transitions. [2019-11-15 21:20:04,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:04,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2019-11-15 21:20:04,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:04,315 INFO L225 Difference]: With dead ends: 3252 [2019-11-15 21:20:04,315 INFO L226 Difference]: Without dead ends: 1676 [2019-11-15 21:20:04,316 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 21:20:04,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2019-11-15 21:20:04,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1586. [2019-11-15 21:20:04,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2019-11-15 21:20:04,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 2302 transitions. [2019-11-15 21:20:04,359 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 2302 transitions. Word has length 200 [2019-11-15 21:20:04,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:04,359 INFO L462 AbstractCegarLoop]: Abstraction has 1586 states and 2302 transitions. [2019-11-15 21:20:04,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:04,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 2302 transitions. [2019-11-15 21:20:04,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-15 21:20:04,361 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:04,361 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 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] [2019-11-15 21:20:04,362 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:04,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:04,362 INFO L82 PathProgramCache]: Analyzing trace with hash 671515308, now seen corresponding path program 1 times [2019-11-15 21:20:04,362 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:04,362 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698185403] [2019-11-15 21:20:04,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:04,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:04,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-11-15 21:20:04,483 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698185403] [2019-11-15 21:20:04,483 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:04,484 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:04,484 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805996649] [2019-11-15 21:20:04,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:04,485 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:04,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:04,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:04,485 INFO L87 Difference]: Start difference. First operand 1586 states and 2302 transitions. Second operand 4 states. [2019-11-15 21:20:05,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:05,044 INFO L93 Difference]: Finished difference Result 3267 states and 4729 transitions. [2019-11-15 21:20:05,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:05,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2019-11-15 21:20:05,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:05,047 INFO L225 Difference]: With dead ends: 3267 [2019-11-15 21:20:05,048 INFO L226 Difference]: Without dead ends: 1691 [2019-11-15 21:20:05,049 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 21:20:05,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2019-11-15 21:20:05,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1586. [2019-11-15 21:20:05,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2019-11-15 21:20:05,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 2297 transitions. [2019-11-15 21:20:05,107 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 2297 transitions. Word has length 200 [2019-11-15 21:20:05,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:05,108 INFO L462 AbstractCegarLoop]: Abstraction has 1586 states and 2297 transitions. [2019-11-15 21:20:05,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:05,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 2297 transitions. [2019-11-15 21:20:05,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-15 21:20:05,110 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:05,111 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 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] [2019-11-15 21:20:05,111 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:05,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:05,112 INFO L82 PathProgramCache]: Analyzing trace with hash -428818167, now seen corresponding path program 1 times [2019-11-15 21:20:05,112 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:05,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975686087] [2019-11-15 21:20:05,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:05,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:05,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:05,359 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 363 proven. 1 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-11-15 21:20:05,359 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975686087] [2019-11-15 21:20:05,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675687642] [2019-11-15 21:20:05,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:05,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:20:05,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:05,596 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:20:05,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:05,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:05,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:05,599 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 21:20:05,619 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 21:20:05,620 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 21:20:05,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:05,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:05,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:05,625 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-15 21:20:05,646 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 21:20:05,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 21:20:05,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:05,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:05,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:05,649 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 21:20:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-11-15 21:20:05,692 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:20:05,692 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-15 21:20:05,692 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101753955] [2019-11-15 21:20:05,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:20:05,693 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:05,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:20:05,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:20:05,693 INFO L87 Difference]: Start difference. First operand 1586 states and 2297 transitions. Second operand 5 states. [2019-11-15 21:20:06,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:06,177 INFO L93 Difference]: Finished difference Result 3422 states and 4965 transitions. [2019-11-15 21:20:06,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:20:06,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 201 [2019-11-15 21:20:06,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:06,180 INFO L225 Difference]: With dead ends: 3422 [2019-11-15 21:20:06,180 INFO L226 Difference]: Without dead ends: 1846 [2019-11-15 21:20:06,181 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 200 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:20:06,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2019-11-15 21:20:06,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1591. [2019-11-15 21:20:06,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2019-11-15 21:20:06,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2302 transitions. [2019-11-15 21:20:06,231 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2302 transitions. Word has length 201 [2019-11-15 21:20:06,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:06,231 INFO L462 AbstractCegarLoop]: Abstraction has 1591 states and 2302 transitions. [2019-11-15 21:20:06,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:20:06,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2302 transitions. [2019-11-15 21:20:06,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-15 21:20:06,234 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:06,234 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 5, 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] [2019-11-15 21:20:06,434 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:06,435 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:06,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:06,435 INFO L82 PathProgramCache]: Analyzing trace with hash -278960597, now seen corresponding path program 1 times [2019-11-15 21:20:06,435 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:06,436 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277807249] [2019-11-15 21:20:06,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:06,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:06,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:06,627 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-11-15 21:20:06,628 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277807249] [2019-11-15 21:20:06,628 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:06,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:06,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357391844] [2019-11-15 21:20:06,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:06,629 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:06,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:06,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:06,630 INFO L87 Difference]: Start difference. First operand 1591 states and 2302 transitions. Second operand 4 states. [2019-11-15 21:20:07,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:07,177 INFO L93 Difference]: Finished difference Result 3237 states and 4675 transitions. [2019-11-15 21:20:07,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:07,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-11-15 21:20:07,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:07,181 INFO L225 Difference]: With dead ends: 3237 [2019-11-15 21:20:07,181 INFO L226 Difference]: Without dead ends: 1656 [2019-11-15 21:20:07,183 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 21:20:07,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2019-11-15 21:20:07,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1591. [2019-11-15 21:20:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2019-11-15 21:20:07,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2297 transitions. [2019-11-15 21:20:07,241 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2297 transitions. Word has length 201 [2019-11-15 21:20:07,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:07,241 INFO L462 AbstractCegarLoop]: Abstraction has 1591 states and 2297 transitions. [2019-11-15 21:20:07,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:07,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2297 transitions. [2019-11-15 21:20:07,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-15 21:20:07,244 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:07,245 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 5, 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] [2019-11-15 21:20:07,245 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:07,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:07,245 INFO L82 PathProgramCache]: Analyzing trace with hash -333353495, now seen corresponding path program 1 times [2019-11-15 21:20:07,246 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:07,246 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219465697] [2019-11-15 21:20:07,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:07,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:07,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:07,383 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-11-15 21:20:07,384 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219465697] [2019-11-15 21:20:07,384 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:07,384 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:07,385 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35042836] [2019-11-15 21:20:07,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:07,385 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:07,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:07,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:07,386 INFO L87 Difference]: Start difference. First operand 1591 states and 2297 transitions. Second operand 4 states. [2019-11-15 21:20:07,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:07,870 INFO L93 Difference]: Finished difference Result 3252 states and 4685 transitions. [2019-11-15 21:20:07,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:07,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-11-15 21:20:07,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:07,872 INFO L225 Difference]: With dead ends: 3252 [2019-11-15 21:20:07,872 INFO L226 Difference]: Without dead ends: 1671 [2019-11-15 21:20:07,873 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 21:20:07,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2019-11-15 21:20:07,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1591. [2019-11-15 21:20:07,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2019-11-15 21:20:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2292 transitions. [2019-11-15 21:20:07,913 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2292 transitions. Word has length 201 [2019-11-15 21:20:07,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:07,913 INFO L462 AbstractCegarLoop]: Abstraction has 1591 states and 2292 transitions. [2019-11-15 21:20:07,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:07,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2292 transitions. [2019-11-15 21:20:07,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-15 21:20:07,915 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:07,916 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:07,916 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:07,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:07,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1413772149, now seen corresponding path program 1 times [2019-11-15 21:20:07,917 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:07,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233233022] [2019-11-15 21:20:07,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:07,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:07,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:08,105 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2019-11-15 21:20:08,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233233022] [2019-11-15 21:20:08,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:08,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:08,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563920442] [2019-11-15 21:20:08,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:08,107 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:08,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:08,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:08,107 INFO L87 Difference]: Start difference. First operand 1591 states and 2292 transitions. Second operand 4 states. [2019-11-15 21:20:08,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:08,584 INFO L93 Difference]: Finished difference Result 3572 states and 5162 transitions. [2019-11-15 21:20:08,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:08,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2019-11-15 21:20:08,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:08,587 INFO L225 Difference]: With dead ends: 3572 [2019-11-15 21:20:08,587 INFO L226 Difference]: Without dead ends: 1991 [2019-11-15 21:20:08,588 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 21:20:08,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-11-15 21:20:08,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1706. [2019-11-15 21:20:08,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2019-11-15 21:20:08,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2462 transitions. [2019-11-15 21:20:08,630 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2462 transitions. Word has length 213 [2019-11-15 21:20:08,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:08,631 INFO L462 AbstractCegarLoop]: Abstraction has 1706 states and 2462 transitions. [2019-11-15 21:20:08,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:08,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2462 transitions. [2019-11-15 21:20:08,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-15 21:20:08,633 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:08,633 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:08,633 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:08,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:08,633 INFO L82 PathProgramCache]: Analyzing trace with hash 520285811, now seen corresponding path program 1 times [2019-11-15 21:20:08,634 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:08,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971504141] [2019-11-15 21:20:08,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:08,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:08,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:08,764 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2019-11-15 21:20:08,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971504141] [2019-11-15 21:20:08,765 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:08,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:08,765 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726073346] [2019-11-15 21:20:08,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:08,766 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:08,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:08,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:08,767 INFO L87 Difference]: Start difference. First operand 1706 states and 2462 transitions. Second operand 4 states. [2019-11-15 21:20:09,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:09,205 INFO L93 Difference]: Finished difference Result 3687 states and 5327 transitions. [2019-11-15 21:20:09,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:09,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2019-11-15 21:20:09,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:09,207 INFO L225 Difference]: With dead ends: 3687 [2019-11-15 21:20:09,207 INFO L226 Difference]: Without dead ends: 1991 [2019-11-15 21:20:09,208 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 21:20:09,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-11-15 21:20:09,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1591. [2019-11-15 21:20:09,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2019-11-15 21:20:09,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2287 transitions. [2019-11-15 21:20:09,250 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2287 transitions. Word has length 213 [2019-11-15 21:20:09,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:09,251 INFO L462 AbstractCegarLoop]: Abstraction has 1591 states and 2287 transitions. [2019-11-15 21:20:09,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:09,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2287 transitions. [2019-11-15 21:20:09,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-15 21:20:09,253 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:09,253 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:09,253 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:09,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:09,254 INFO L82 PathProgramCache]: Analyzing trace with hash 440755474, now seen corresponding path program 1 times [2019-11-15 21:20:09,254 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:09,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560823110] [2019-11-15 21:20:09,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:09,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:09,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2019-11-15 21:20:09,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560823110] [2019-11-15 21:20:09,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:09,446 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:09,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366075649] [2019-11-15 21:20:09,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:09,447 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:09,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:09,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:09,448 INFO L87 Difference]: Start difference. First operand 1591 states and 2287 transitions. Second operand 4 states. [2019-11-15 21:20:10,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:10,173 INFO L93 Difference]: Finished difference Result 3557 states and 5129 transitions. [2019-11-15 21:20:10,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:10,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2019-11-15 21:20:10,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:10,177 INFO L225 Difference]: With dead ends: 3557 [2019-11-15 21:20:10,177 INFO L226 Difference]: Without dead ends: 1976 [2019-11-15 21:20:10,179 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 21:20:10,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1976 states. [2019-11-15 21:20:10,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1976 to 1696. [2019-11-15 21:20:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1696 states. [2019-11-15 21:20:10,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2442 transitions. [2019-11-15 21:20:10,243 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2442 transitions. Word has length 214 [2019-11-15 21:20:10,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:10,244 INFO L462 AbstractCegarLoop]: Abstraction has 1696 states and 2442 transitions. [2019-11-15 21:20:10,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:10,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2442 transitions. [2019-11-15 21:20:10,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-15 21:20:10,247 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:10,248 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:10,248 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:10,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:10,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1487517228, now seen corresponding path program 1 times [2019-11-15 21:20:10,249 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:10,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214712260] [2019-11-15 21:20:10,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:10,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:10,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:10,413 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2019-11-15 21:20:10,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214712260] [2019-11-15 21:20:10,414 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:10,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:10,415 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416115187] [2019-11-15 21:20:10,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:10,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:10,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:10,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:10,416 INFO L87 Difference]: Start difference. First operand 1696 states and 2442 transitions. Second operand 4 states. [2019-11-15 21:20:10,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:10,881 INFO L93 Difference]: Finished difference Result 3647 states and 5259 transitions. [2019-11-15 21:20:10,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:10,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2019-11-15 21:20:10,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:10,884 INFO L225 Difference]: With dead ends: 3647 [2019-11-15 21:20:10,884 INFO L226 Difference]: Without dead ends: 1961 [2019-11-15 21:20:10,885 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 21:20:10,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2019-11-15 21:20:10,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1576. [2019-11-15 21:20:10,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-15 21:20:10,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2262 transitions. [2019-11-15 21:20:10,928 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2262 transitions. Word has length 214 [2019-11-15 21:20:10,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:10,929 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 2262 transitions. [2019-11-15 21:20:10,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:10,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2262 transitions. [2019-11-15 21:20:10,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-15 21:20:10,930 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:10,931 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 4, 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 21:20:10,931 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:10,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:10,931 INFO L82 PathProgramCache]: Analyzing trace with hash -320442235, now seen corresponding path program 1 times [2019-11-15 21:20:10,931 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:10,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183764973] [2019-11-15 21:20:10,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:10,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:10,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:11,274 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 363 proven. 1 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-11-15 21:20:11,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183764973] [2019-11-15 21:20:11,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290594611] [2019-11-15 21:20:11,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:11,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:20:11,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:11,567 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:20:11,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:11,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:11,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:11,571 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 21:20:11,595 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 21:20:11,595 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 21:20:11,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:11,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:11,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:11,603 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-15 21:20:11,631 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 21:20:11,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 21:20:11,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:11,637 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:11,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:11,637 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 21:20:11,693 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2019-11-15 21:20:11,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:20:11,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-15 21:20:11,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790151977] [2019-11-15 21:20:11,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:20:11,695 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:11,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:20:11,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:20:11,696 INFO L87 Difference]: Start difference. First operand 1576 states and 2262 transitions. Second operand 5 states. [2019-11-15 21:20:12,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:12,258 INFO L93 Difference]: Finished difference Result 3212 states and 4600 transitions. [2019-11-15 21:20:12,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:20:12,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 216 [2019-11-15 21:20:12,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:12,260 INFO L225 Difference]: With dead ends: 3212 [2019-11-15 21:20:12,260 INFO L226 Difference]: Without dead ends: 1646 [2019-11-15 21:20:12,261 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 215 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:20:12,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2019-11-15 21:20:12,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1576. [2019-11-15 21:20:12,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-15 21:20:12,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2257 transitions. [2019-11-15 21:20:12,303 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2257 transitions. Word has length 216 [2019-11-15 21:20:12,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:12,303 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 2257 transitions. [2019-11-15 21:20:12,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:20:12,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2257 transitions. [2019-11-15 21:20:12,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-15 21:20:12,304 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:12,305 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 4, 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 21:20:12,505 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:12,506 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:12,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:12,506 INFO L82 PathProgramCache]: Analyzing trace with hash -80202489, now seen corresponding path program 1 times [2019-11-15 21:20:12,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:12,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554381399] [2019-11-15 21:20:12,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:12,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:12,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:12,747 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 363 proven. 1 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-11-15 21:20:12,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554381399] [2019-11-15 21:20:12,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836848686] [2019-11-15 21:20:12,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:13,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:20:13,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:13,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:20:13,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:13,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:13,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:13,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 21:20:13,070 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 21:20:13,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 21:20:13,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:13,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:13,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:13,082 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-15 21:20:13,104 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 21:20:13,105 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 21:20:13,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:13,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:13,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:13,108 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 21:20:13,164 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2019-11-15 21:20:13,164 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:20:13,165 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-15 21:20:13,165 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66631038] [2019-11-15 21:20:13,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:20:13,165 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:13,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:20:13,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:20:13,166 INFO L87 Difference]: Start difference. First operand 1576 states and 2257 transitions. Second operand 5 states. [2019-11-15 21:20:13,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:13,673 INFO L93 Difference]: Finished difference Result 3227 states and 4610 transitions. [2019-11-15 21:20:13,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:20:13,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 216 [2019-11-15 21:20:13,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:13,675 INFO L225 Difference]: With dead ends: 3227 [2019-11-15 21:20:13,676 INFO L226 Difference]: Without dead ends: 1661 [2019-11-15 21:20:13,676 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 215 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:20:13,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2019-11-15 21:20:13,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1576. [2019-11-15 21:20:13,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-15 21:20:13,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2252 transitions. [2019-11-15 21:20:13,715 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2252 transitions. Word has length 216 [2019-11-15 21:20:13,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:13,716 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 2252 transitions. [2019-11-15 21:20:13,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:20:13,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2252 transitions. [2019-11-15 21:20:13,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-15 21:20:13,717 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:13,718 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:13,918 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:13,918 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:13,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:13,919 INFO L82 PathProgramCache]: Analyzing trace with hash 2096992742, now seen corresponding path program 1 times [2019-11-15 21:20:13,919 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:13,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084754233] [2019-11-15 21:20:13,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:13,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:13,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 365 proven. 1 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-15 21:20:14,132 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084754233] [2019-11-15 21:20:14,132 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661065102] [2019-11-15 21:20:14,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:14,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:20:14,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:14,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:20:14,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:14,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:14,374 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:14,374 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 21:20:14,396 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 21:20:14,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 21:20:14,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:14,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:14,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:14,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-15 21:20:14,441 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 21:20:14,441 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 21:20:14,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:14,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:14,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:14,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 21:20:14,488 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2019-11-15 21:20:14,488 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:20:14,488 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-15 21:20:14,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654361407] [2019-11-15 21:20:14,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:20:14,489 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:14,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:20:14,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:20:14,490 INFO L87 Difference]: Start difference. First operand 1576 states and 2252 transitions. Second operand 5 states. [2019-11-15 21:20:14,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:14,949 INFO L93 Difference]: Finished difference Result 3192 states and 4551 transitions. [2019-11-15 21:20:14,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:20:14,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-11-15 21:20:14,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:14,951 INFO L225 Difference]: With dead ends: 3192 [2019-11-15 21:20:14,951 INFO L226 Difference]: Without dead ends: 1626 [2019-11-15 21:20:14,952 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 216 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:20:14,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-11-15 21:20:15,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1576. [2019-11-15 21:20:15,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-15 21:20:15,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2247 transitions. [2019-11-15 21:20:15,004 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2247 transitions. Word has length 217 [2019-11-15 21:20:15,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:15,004 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 2247 transitions. [2019-11-15 21:20:15,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:20:15,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2247 transitions. [2019-11-15 21:20:15,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-15 21:20:15,006 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:15,006 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:15,207 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:15,207 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:15,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:15,208 INFO L82 PathProgramCache]: Analyzing trace with hash 954490276, now seen corresponding path program 1 times [2019-11-15 21:20:15,208 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:15,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70574983] [2019-11-15 21:20:15,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:15,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:15,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:15,425 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 365 proven. 1 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-15 21:20:15,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70574983] [2019-11-15 21:20:15,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076465282] [2019-11-15 21:20:15,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:15,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:20:15,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:15,700 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:20:15,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:15,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:15,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:15,704 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 21:20:15,730 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 21:20:15,730 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 21:20:15,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:15,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:15,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:15,738 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-15 21:20:15,763 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 21:20:15,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 21:20:15,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:15,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:15,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:15,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 21:20:15,912 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2019-11-15 21:20:15,912 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:20:15,913 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-15 21:20:15,913 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782663299] [2019-11-15 21:20:15,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:20:15,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:15,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:20:15,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:20:15,916 INFO L87 Difference]: Start difference. First operand 1576 states and 2247 transitions. Second operand 5 states. [2019-11-15 21:20:16,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:16,625 INFO L93 Difference]: Finished difference Result 3207 states and 4561 transitions. [2019-11-15 21:20:16,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:20:16,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-11-15 21:20:16,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:16,628 INFO L225 Difference]: With dead ends: 3207 [2019-11-15 21:20:16,628 INFO L226 Difference]: Without dead ends: 1641 [2019-11-15 21:20:16,630 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 216 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:20:16,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2019-11-15 21:20:16,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1576. [2019-11-15 21:20:16,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-15 21:20:16,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2242 transitions. [2019-11-15 21:20:16,684 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2242 transitions. Word has length 217 [2019-11-15 21:20:16,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:16,684 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 2242 transitions. [2019-11-15 21:20:16,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:20:16,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2242 transitions. [2019-11-15 21:20:16,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-15 21:20:16,686 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:16,686 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:16,887 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:16,887 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:16,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:16,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1993742684, now seen corresponding path program 1 times [2019-11-15 21:20:16,887 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:16,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209472407] [2019-11-15 21:20:16,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:16,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:16,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:17,941 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 2 proven. 282 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-15 21:20:17,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209472407] [2019-11-15 21:20:17,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337147880] [2019-11-15 21:20:17,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:18,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 56 conjunts are in the unsatisfiable core [2019-11-15 21:20:18,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:18,430 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:18,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2019-11-15 21:20:18,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:18,547 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-15 21:20:18,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:18,551 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_160|], 2=[|v_#memory_$Pointer$.base_148|, |v_#memory_$Pointer$.base_147|, |v_#memory_$Pointer$.base_146|]} [2019-11-15 21:20:18,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:18,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:18,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:18,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:18,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:18,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:18,628 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 12 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 21:20:18,628 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:18,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:18,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:18,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:18,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:18,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:18,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:18,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:18,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2019-11-15 21:20:18,694 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:18,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:18,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:18,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:18,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:18,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:18,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:18,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:18,741 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 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 21:20:18,741 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:18,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:18,797 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 21:20:18,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 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 21:20:18,799 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:18,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:18,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:18,817 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:121, output treesize:79 [2019-11-15 21:20:18,878 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 21:20:18,878 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 98 treesize of output 52 [2019-11-15 21:20:18,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:18,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:18,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:18,892 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2019-11-15 21:20:18,899 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_146|], 2=[|v_#memory_$Pointer$.base_150|], 6=[|v_#memory_$Pointer$.base_149|], 12=[|v_#memory_$Pointer$.base_162|]} [2019-11-15 21:20:18,911 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 21:20:18,912 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 21:20:18,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:18,952 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 21:20:18,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:18,983 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 21:20:19,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:19,212 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:19,212 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.downgradeDimensionsIfNecessary(ArrayOccurrenceAnalysis.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:200) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-11-15 21:20:19,216 INFO L168 Benchmark]: Toolchain (without parser) took 70038.10 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 944.8 MB in the beginning and 1.5 GB in the end (delta: -558.0 MB). Peak memory consumption was 608.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:20:19,217 INFO L168 Benchmark]: CDTParser took 0.37 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 21:20:19,217 INFO L168 Benchmark]: CACSL2BoogieTranslator took 898.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -174.6 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:20:19,218 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:20:19,218 INFO L168 Benchmark]: Boogie Preprocessor took 110.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:20:19,218 INFO L168 Benchmark]: RCFGBuilder took 1556.63 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: 95.7 MB). Peak memory consumption was 95.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:20:19,219 INFO L168 Benchmark]: TraceAbstraction took 67368.82 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -485.8 MB). Peak memory consumption was 529.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:20:19,221 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.37 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 898.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -174.6 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 95.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 110.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1556.63 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: 95.7 MB). Peak memory consumption was 95.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 67368.82 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -485.8 MB). Peak memory consumption was 529.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.NullPointerException de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.NullPointerException: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 21:20:21,980 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:20:21,982 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:20:21,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:20:21,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:20:21,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:20:21,998 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:20:22,001 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:20:22,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:20:22,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:20:22,006 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:20:22,007 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:20:22,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:20:22,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:20:22,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:20:22,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:20:22,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:20:22,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:20:22,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:20:22,019 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:20:22,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:20:22,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:20:22,025 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:20:22,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:20:22,030 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:20:22,030 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:20:22,031 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:20:22,032 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:20:22,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:20:22,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:20:22,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:20:22,036 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:20:22,037 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:20:22,038 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:20:22,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:20:22,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:20:22,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:20:22,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:20:22,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:20:22,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:20:22,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:20:22,045 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 21:20:22,064 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:20:22,064 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:20:22,065 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:20:22,066 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:20:22,066 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:20:22,066 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:20:22,067 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:20:22,067 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:20:22,067 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:20:22,068 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:20:22,068 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:20:22,068 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:20:22,069 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 21:20:22,069 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 21:20:22,069 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:20:22,069 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:20:22,070 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:20:22,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:20:22,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:20:22,071 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:20:22,071 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:20:22,071 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:20:22,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:20:22,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:20:22,072 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:20:22,073 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:20:22,073 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 21:20:22,073 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 21:20:22,074 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:20:22,074 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 21:20:22,074 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_fffaa154-98e0-434d-bfa8-934c79c01f4a/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 -> 86985028c31ac38cb951d6f73c1e89691e53b5e6 [2019-11-15 21:20:22,111 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:20:22,125 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:20:22,128 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:20:22,130 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:20:22,130 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:20:22,131 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-1.c [2019-11-15 21:20:22,199 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/data/9cf4bec36/8988d4c3efac49509822743f4904bec0/FLAGb4b869592 [2019-11-15 21:20:22,862 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:20:22,862 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-1.c [2019-11-15 21:20:22,885 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/data/9cf4bec36/8988d4c3efac49509822743f4904bec0/FLAGb4b869592 [2019-11-15 21:20:23,101 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/data/9cf4bec36/8988d4c3efac49509822743f4904bec0 [2019-11-15 21:20:23,104 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:20:23,106 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:20:23,108 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:20:23,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:20:23,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:20:23,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:20:23" (1/1) ... [2019-11-15 21:20:23,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25c41e75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:23, skipping insertion in model container [2019-11-15 21:20:23,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:20:23" (1/1) ... [2019-11-15 21:20:23,124 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:20:23,217 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:20:23,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:20:23,993 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:20:24,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:20:24,227 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:20:24,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:24 WrapperNode [2019-11-15 21:20:24,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:20:24,229 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:20:24,229 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:20:24,230 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:20:24,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:24" (1/1) ... [2019-11-15 21:20:24,289 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:24" (1/1) ... [2019-11-15 21:20:24,364 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:20:24,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:20:24,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:20:24,366 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:20:24,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:24" (1/1) ... [2019-11-15 21:20:24,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:24" (1/1) ... [2019-11-15 21:20:24,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:24" (1/1) ... [2019-11-15 21:20:24,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:24" (1/1) ... [2019-11-15 21:20:24,445 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:24" (1/1) ... [2019-11-15 21:20:24,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:24" (1/1) ... [2019-11-15 21:20:24,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:24" (1/1) ... [2019-11-15 21:20:24,467 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:20:24,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:20:24,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:20:24,468 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:20:24,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/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 21:20:24,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:20:24,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:20:24,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 21:20:24,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:20:24,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:20:24,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:20:24,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:20:24,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 21:20:24,910 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:20:27,510 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-15 21:20:27,511 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-15 21:20:27,513 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:20:27,513 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 21:20:27,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:20:27 BoogieIcfgContainer [2019-11-15 21:20:27,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:20:27,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:20:27,519 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:20:27,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:20:27,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:20:23" (1/3) ... [2019-11-15 21:20:27,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df177cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:20:27, skipping insertion in model container [2019-11-15 21:20:27,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:24" (2/3) ... [2019-11-15 21:20:27,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df177cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:20:27, skipping insertion in model container [2019-11-15 21:20:27,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:20:27" (3/3) ... [2019-11-15 21:20:27,529 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-1.c [2019-11-15 21:20:27,541 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:20:27,553 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:20:27,565 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:20:27,603 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:20:27,603 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:20:27,603 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:20:27,603 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:20:27,604 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:20:27,604 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:20:27,604 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:20:27,604 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:20:27,632 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2019-11-15 21:20:27,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 21:20:27,645 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:27,646 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:27,648 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:27,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:27,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1457703966, now seen corresponding path program 1 times [2019-11-15 21:20:27,671 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:20:27,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1765743420] [2019-11-15 21:20:27,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/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 21:20:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:27,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:20:27,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:27,966 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 21:20:27,967 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:20:27,989 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 21:20:27,991 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1765743420] [2019-11-15 21:20:27,991 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:27,992 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 21:20:27,993 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507086438] [2019-11-15 21:20:28,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:28,003 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:20:28,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:28,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:28,024 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 4 states. [2019-11-15 21:20:28,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:28,280 INFO L93 Difference]: Finished difference Result 496 states and 829 transitions. [2019-11-15 21:20:28,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:28,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-15 21:20:28,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:28,313 INFO L225 Difference]: With dead ends: 496 [2019-11-15 21:20:28,316 INFO L226 Difference]: Without dead ends: 321 [2019-11-15 21:20:28,322 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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 21:20:28,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-11-15 21:20:28,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2019-11-15 21:20:28,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-11-15 21:20:28,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 478 transitions. [2019-11-15 21:20:28,453 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 478 transitions. Word has length 24 [2019-11-15 21:20:28,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:28,454 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 478 transitions. [2019-11-15 21:20:28,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:28,454 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 478 transitions. [2019-11-15 21:20:28,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 21:20:28,459 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:28,459 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-11-15 21:20:28,663 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:20:28,666 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:28,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:28,667 INFO L82 PathProgramCache]: Analyzing trace with hash 908084980, now seen corresponding path program 1 times [2019-11-15 21:20:28,667 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:20:28,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [203182748] [2019-11-15 21:20:28,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/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 21:20:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:28,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:20:28,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:28,955 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:20:28,955 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:20:28,980 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:20:28,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [203182748] [2019-11-15 21:20:28,981 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:28,981 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 21:20:28,981 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487972444] [2019-11-15 21:20:28,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:28,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:20:28,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:28,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:28,985 INFO L87 Difference]: Start difference. First operand 321 states and 478 transitions. Second operand 4 states. [2019-11-15 21:20:30,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:30,632 INFO L93 Difference]: Finished difference Result 736 states and 1103 transitions. [2019-11-15 21:20:30,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:30,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-15 21:20:30,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:30,639 INFO L225 Difference]: With dead ends: 736 [2019-11-15 21:20:30,640 INFO L226 Difference]: Without dead ends: 525 [2019-11-15 21:20:30,645 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 126 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 21:20:30,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-11-15 21:20:30,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2019-11-15 21:20:30,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-11-15 21:20:30,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 779 transitions. [2019-11-15 21:20:30,710 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 779 transitions. Word has length 65 [2019-11-15 21:20:30,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:30,710 INFO L462 AbstractCegarLoop]: Abstraction has 525 states and 779 transitions. [2019-11-15 21:20:30,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:30,711 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 779 transitions. [2019-11-15 21:20:30,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-15 21:20:30,720 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:30,720 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2019-11-15 21:20:30,924 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:20:30,924 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:30,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:30,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1159650437, now seen corresponding path program 1 times [2019-11-15 21:20:30,926 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:20:30,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [781067170] [2019-11-15 21:20:30,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/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 21:20:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:31,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:20:31,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:31,263 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 21:20:31,263 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:20:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 21:20:31,300 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [781067170] [2019-11-15 21:20:31,309 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:31,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 21:20:31,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93061623] [2019-11-15 21:20:31,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:31,314 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:20:31,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:31,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:31,315 INFO L87 Difference]: Start difference. First operand 525 states and 779 transitions. Second operand 4 states. [2019-11-15 21:20:32,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:32,610 INFO L93 Difference]: Finished difference Result 1147 states and 1708 transitions. [2019-11-15 21:20:32,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:32,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-15 21:20:32,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:32,617 INFO L225 Difference]: With dead ends: 1147 [2019-11-15 21:20:32,617 INFO L226 Difference]: Without dead ends: 732 [2019-11-15 21:20:32,619 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:32,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2019-11-15 21:20:32,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2019-11-15 21:20:32,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2019-11-15 21:20:32,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1083 transitions. [2019-11-15 21:20:32,701 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1083 transitions. Word has length 104 [2019-11-15 21:20:32,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:32,706 INFO L462 AbstractCegarLoop]: Abstraction has 732 states and 1083 transitions. [2019-11-15 21:20:32,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:32,706 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1083 transitions. [2019-11-15 21:20:32,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-15 21:20:32,721 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:32,722 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 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] [2019-11-15 21:20:32,926 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:20:32,927 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:32,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:32,929 INFO L82 PathProgramCache]: Analyzing trace with hash 876212838, now seen corresponding path program 1 times [2019-11-15 21:20:32,931 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:20:32,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1665752786] [2019-11-15 21:20:32,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/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 21:20:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:35,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:20:35,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:35,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:35,308 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 21:20:35,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:35,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:35,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:35,329 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 21:20:35,378 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:35,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 21:20:35,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:35,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:35,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:35,383 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 21:20:35,437 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-15 21:20:35,438 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:20:35,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-15 21:20:35,510 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:35,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:35,511 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:35,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:35,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:35,513 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 21:20:35,538 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-15 21:20:35,539 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1665752786] [2019-11-15 21:20:35,540 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:35,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 21:20:35,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725616478] [2019-11-15 21:20:35,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:20:35,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:20:35,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:20:35,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:20:35,548 INFO L87 Difference]: Start difference. First operand 732 states and 1083 transitions. Second operand 7 states. [2019-11-15 21:20:44,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:44,665 INFO L93 Difference]: Finished difference Result 2644 states and 3934 transitions. [2019-11-15 21:20:44,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:20:44,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2019-11-15 21:20:44,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:44,684 INFO L225 Difference]: With dead ends: 2644 [2019-11-15 21:20:44,685 INFO L226 Difference]: Without dead ends: 1919 [2019-11-15 21:20:44,687 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:20:44,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2019-11-15 21:20:44,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 914. [2019-11-15 21:20:44,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-11-15 21:20:44,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1405 transitions. [2019-11-15 21:20:44,750 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1405 transitions. Word has length 124 [2019-11-15 21:20:44,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:44,752 INFO L462 AbstractCegarLoop]: Abstraction has 914 states and 1405 transitions. [2019-11-15 21:20:44,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:20:44,752 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1405 transitions. [2019-11-15 21:20:44,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-15 21:20:44,761 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:44,762 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 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] [2019-11-15 21:20:44,973 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:20:44,973 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:44,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:44,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1809772923, now seen corresponding path program 1 times [2019-11-15 21:20:44,975 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:20:44,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [181102656] [2019-11-15 21:20:44,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/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 21:20:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:47,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:20:47,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:47,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:47,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 21:20:47,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:47,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:47,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:47,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 21:20:47,473 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:47,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 21:20:47,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:47,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:47,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:47,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 21:20:47,524 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-15 21:20:47,524 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:20:47,574 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-15 21:20:47,577 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:47,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:47,579 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:47,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:47,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:47,581 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 21:20:47,607 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-15 21:20:47,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [181102656] [2019-11-15 21:20:47,608 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:47,608 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 21:20:47,608 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474341910] [2019-11-15 21:20:47,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:20:47,609 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:20:47,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:20:47,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:20:47,611 INFO L87 Difference]: Start difference. First operand 914 states and 1405 transitions. Second operand 7 states. [2019-11-15 21:21:02,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:02,031 INFO L93 Difference]: Finished difference Result 2958 states and 4495 transitions. [2019-11-15 21:21:02,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:21:02,035 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2019-11-15 21:21:02,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:02,051 INFO L225 Difference]: With dead ends: 2958 [2019-11-15 21:21:02,051 INFO L226 Difference]: Without dead ends: 2051 [2019-11-15 21:21:02,054 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:21:02,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2019-11-15 21:21:02,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 1077. [2019-11-15 21:21:02,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1077 states. [2019-11-15 21:21:02,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1694 transitions. [2019-11-15 21:21:02,120 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1694 transitions. Word has length 125 [2019-11-15 21:21:02,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:02,122 INFO L462 AbstractCegarLoop]: Abstraction has 1077 states and 1694 transitions. [2019-11-15 21:21:02,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:21:02,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1694 transitions. [2019-11-15 21:21:02,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-15 21:21:02,126 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:02,126 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 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] [2019-11-15 21:21:02,342 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:21:02,342 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:21:02,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:02,343 INFO L82 PathProgramCache]: Analyzing trace with hash 873704545, now seen corresponding path program 1 times [2019-11-15 21:21:02,343 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:21:02,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1511841670] [2019-11-15 21:21:02,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/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 21:21:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:05,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:21:05,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:05,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:05,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:05,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:05,193 INFO L341 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2019-11-15 21:21:05,193 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 35 [2019-11-15 21:21:05,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:05,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:05,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:21:05,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:22 [2019-11-15 21:21:05,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:05,262 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:05,263 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 26 [2019-11-15 21:21:05,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:05,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:05,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:05,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:15 [2019-11-15 21:21:05,290 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 15 treesize of output 7 [2019-11-15 21:21:05,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:05,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:05,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:05,294 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:5 [2019-11-15 21:21:05,333 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2019-11-15 21:21:05,334 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:21:05,423 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2019-11-15 21:21:05,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1511841670] [2019-11-15 21:21:05,424 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:21:05,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:21:05,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726971668] [2019-11-15 21:21:05,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:21:05,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:21:05,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:21:05,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:21:05,426 INFO L87 Difference]: Start difference. First operand 1077 states and 1694 transitions. Second operand 6 states. [2019-11-15 21:21:11,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:11,323 INFO L93 Difference]: Finished difference Result 2709 states and 4193 transitions. [2019-11-15 21:21:11,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:21:11,324 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2019-11-15 21:21:11,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:11,335 INFO L225 Difference]: With dead ends: 2709 [2019-11-15 21:21:11,335 INFO L226 Difference]: Without dead ends: 1793 [2019-11-15 21:21:11,337 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:21:11,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2019-11-15 21:21:11,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1189. [2019-11-15 21:21:11,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1189 states. [2019-11-15 21:21:11,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1870 transitions. [2019-11-15 21:21:11,409 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 1870 transitions. Word has length 146 [2019-11-15 21:21:11,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:11,410 INFO L462 AbstractCegarLoop]: Abstraction has 1189 states and 1870 transitions. [2019-11-15 21:21:11,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:21:11,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1870 transitions. [2019-11-15 21:21:11,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-15 21:21:11,414 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:11,414 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 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] [2019-11-15 21:21:11,627 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:21:11,628 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:21:11,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:11,628 INFO L82 PathProgramCache]: Analyzing trace with hash 910757238, now seen corresponding path program 1 times [2019-11-15 21:21:11,629 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:21:11,629 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1146239096] [2019-11-15 21:21:11,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/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 21:21:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:14,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:21:14,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:14,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:14,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:14,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:14,453 INFO L341 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2019-11-15 21:21:14,453 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 35 [2019-11-15 21:21:14,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:14,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:14,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:21:14,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:22 [2019-11-15 21:21:14,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:14,502 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:14,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 26 [2019-11-15 21:21:14,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:14,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:14,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:14,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:13 [2019-11-15 21:21:14,523 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 15 treesize of output 7 [2019-11-15 21:21:14,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:14,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:14,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:14,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:5 [2019-11-15 21:21:14,551 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2019-11-15 21:21:14,552 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:21:14,619 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2019-11-15 21:21:14,620 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1146239096] [2019-11-15 21:21:14,620 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:21:14,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:21:14,620 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653126921] [2019-11-15 21:21:14,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:21:14,621 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:21:14,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:21:14,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:21:14,621 INFO L87 Difference]: Start difference. First operand 1189 states and 1870 transitions. Second operand 6 states. [2019-11-15 21:21:19,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:19,850 INFO L93 Difference]: Finished difference Result 2782 states and 4303 transitions. [2019-11-15 21:21:19,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:21:19,851 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2019-11-15 21:21:19,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:19,863 INFO L225 Difference]: With dead ends: 2782 [2019-11-15 21:21:19,865 INFO L226 Difference]: Without dead ends: 1770 [2019-11-15 21:21:19,867 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 286 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:21:19,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2019-11-15 21:21:19,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1196. [2019-11-15 21:21:19,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1196 states. [2019-11-15 21:21:19,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1871 transitions. [2019-11-15 21:21:19,929 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1871 transitions. Word has length 147 [2019-11-15 21:21:19,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:19,930 INFO L462 AbstractCegarLoop]: Abstraction has 1196 states and 1871 transitions. [2019-11-15 21:21:19,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:21:19,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1871 transitions. [2019-11-15 21:21:19,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-15 21:21:19,934 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:19,934 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2019-11-15 21:21:20,148 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:21:20,150 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:21:20,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:20,150 INFO L82 PathProgramCache]: Analyzing trace with hash -795592437, now seen corresponding path program 1 times [2019-11-15 21:21:20,151 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:21:20,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [627898287] [2019-11-15 21:21:20,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/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 21:21:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:22,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:21:22,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:22,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:21:22,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:22,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:22,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:22,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-15 21:21:22,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:22,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 21:21:22,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:22,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:22,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:22,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-15 21:21:22,683 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:22,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 21:21:22,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:22,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:22,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:22,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 21:21:22,727 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-15 21:21:22,727 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:21:22,781 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-15 21:21:22,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [627898287] [2019-11-15 21:21:22,782 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:21:22,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 8 [2019-11-15 21:21:22,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692837117] [2019-11-15 21:21:22,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:21:22,783 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:21:22,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:21:22,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:21:22,783 INFO L87 Difference]: Start difference. First operand 1196 states and 1871 transitions. Second operand 8 states. [2019-11-15 21:21:29,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:29,529 INFO L93 Difference]: Finished difference Result 3515 states and 5378 transitions. [2019-11-15 21:21:29,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:21:29,530 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 161 [2019-11-15 21:21:29,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:29,546 INFO L225 Difference]: With dead ends: 3515 [2019-11-15 21:21:29,546 INFO L226 Difference]: Without dead ends: 2326 [2019-11-15 21:21:29,549 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 314 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:21:29,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2326 states. [2019-11-15 21:21:29,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2326 to 1322. [2019-11-15 21:21:29,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2019-11-15 21:21:29,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 2062 transitions. [2019-11-15 21:21:29,631 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 2062 transitions. Word has length 161 [2019-11-15 21:21:29,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:29,632 INFO L462 AbstractCegarLoop]: Abstraction has 1322 states and 2062 transitions. [2019-11-15 21:21:29,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:21:29,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 2062 transitions. [2019-11-15 21:21:29,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-15 21:21:29,640 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:29,640 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2019-11-15 21:21:29,865 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:21:29,865 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:21:29,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:29,866 INFO L82 PathProgramCache]: Analyzing trace with hash 931552525, now seen corresponding path program 1 times [2019-11-15 21:21:29,866 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:21:29,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1303704301] [2019-11-15 21:21:29,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/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 21:21:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:32,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:21:32,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:32,399 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:21:32,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:32,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:32,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:32,409 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-15 21:21:32,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:32,433 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 21:21:32,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:32,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:32,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:32,447 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-15 21:21:32,476 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:32,477 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 21:21:32,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:32,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:32,480 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:32,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 21:21:32,543 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 97 proven. 2 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-11-15 21:21:32,544 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:21:32,647 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-11-15 21:21:32,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1303704301] [2019-11-15 21:21:32,648 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:21:32,648 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-15 21:21:32,648 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574381251] [2019-11-15 21:21:32,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:21:32,649 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:21:32,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:21:32,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:21:32,649 INFO L87 Difference]: Start difference. First operand 1322 states and 2062 transitions. Second operand 4 states. [2019-11-15 21:21:36,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:36,063 INFO L93 Difference]: Finished difference Result 3246 states and 4990 transitions. [2019-11-15 21:21:36,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:21:36,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-11-15 21:21:36,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:36,076 INFO L225 Difference]: With dead ends: 3246 [2019-11-15 21:21:36,076 INFO L226 Difference]: Without dead ends: 1931 [2019-11-15 21:21:36,079 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 313 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:21:36,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2019-11-15 21:21:36,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1466. [2019-11-15 21:21:36,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1466 states. [2019-11-15 21:21:36,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 2289 transitions. [2019-11-15 21:21:36,154 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 2289 transitions. Word has length 161 [2019-11-15 21:21:36,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:36,155 INFO L462 AbstractCegarLoop]: Abstraction has 1466 states and 2289 transitions. [2019-11-15 21:21:36,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:21:36,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2289 transitions. [2019-11-15 21:21:36,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-15 21:21:36,159 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:36,160 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2019-11-15 21:21:36,374 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:21:36,374 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:21:36,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:36,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1191060756, now seen corresponding path program 1 times [2019-11-15 21:21:36,375 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:21:36,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1587977979] [2019-11-15 21:21:36,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/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 21:21:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:38,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:21:38,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:38,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:21:38,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:38,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:38,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:38,876 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-15 21:21:38,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:38,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 21:21:38,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:38,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:38,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:38,917 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-15 21:21:38,942 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:38,942 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 21:21:38,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:38,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:38,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:38,946 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 21:21:38,990 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 99 proven. 1 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-11-15 21:21:38,990 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:21:39,050 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-11-15 21:21:39,050 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1587977979] [2019-11-15 21:21:39,050 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:21:39,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-15 21:21:39,050 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534844901] [2019-11-15 21:21:39,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:21:39,051 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:21:39,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:21:39,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:21:39,052 INFO L87 Difference]: Start difference. First operand 1466 states and 2289 transitions. Second operand 4 states. [2019-11-15 21:21:42,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:42,392 INFO L93 Difference]: Finished difference Result 3369 states and 5177 transitions. [2019-11-15 21:21:42,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:21:42,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-11-15 21:21:42,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:42,405 INFO L225 Difference]: With dead ends: 3369 [2019-11-15 21:21:42,405 INFO L226 Difference]: Without dead ends: 1910 [2019-11-15 21:21:42,408 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 315 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:21:42,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910 states. [2019-11-15 21:21:42,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1910 to 1466. [2019-11-15 21:21:42,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1466 states. [2019-11-15 21:21:42,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 2276 transitions. [2019-11-15 21:21:42,482 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 2276 transitions. Word has length 162 [2019-11-15 21:21:42,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:42,482 INFO L462 AbstractCegarLoop]: Abstraction has 1466 states and 2276 transitions. [2019-11-15 21:21:42,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:21:42,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2276 transitions. [2019-11-15 21:21:42,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-15 21:21:42,488 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:42,488 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:21:42,703 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:21:42,703 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:21:42,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:42,703 INFO L82 PathProgramCache]: Analyzing trace with hash 393615027, now seen corresponding path program 1 times [2019-11-15 21:21:42,704 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:21:42,705 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1813022192] [2019-11-15 21:21:42,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/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 21:21:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:45,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:21:45,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:45,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:21:45,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:45,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:45,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:45,938 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-15 21:21:45,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:45,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 21:21:45,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:45,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:45,971 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:45,971 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-15 21:21:45,992 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:45,993 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 21:21:45,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:46,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:46,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:46,002 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 21:21:46,058 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 210 proven. 3 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-11-15 21:21:46,058 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:21:46,148 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-11-15 21:21:46,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1813022192] [2019-11-15 21:21:46,149 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:21:46,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-15 21:21:46,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828891224] [2019-11-15 21:21:46,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:21:46,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:21:46,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:21:46,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:21:46,152 INFO L87 Difference]: Start difference. First operand 1466 states and 2276 transitions. Second operand 4 states. [2019-11-15 21:21:48,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:48,638 INFO L93 Difference]: Finished difference Result 3558 states and 5445 transitions. [2019-11-15 21:21:48,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:21:48,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-11-15 21:21:48,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:48,650 INFO L225 Difference]: With dead ends: 3558 [2019-11-15 21:21:48,650 INFO L226 Difference]: Without dead ends: 2099 [2019-11-15 21:21:48,653 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 355 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:21:48,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2019-11-15 21:21:48,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 1620. [2019-11-15 21:21:48,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1620 states. [2019-11-15 21:21:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2509 transitions. [2019-11-15 21:21:48,729 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2509 transitions. Word has length 182 [2019-11-15 21:21:48,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:48,730 INFO L462 AbstractCegarLoop]: Abstraction has 1620 states and 2509 transitions. [2019-11-15 21:21:48,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:21:48,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2509 transitions. [2019-11-15 21:21:48,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-15 21:21:48,735 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:48,736 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 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] [2019-11-15 21:21:48,946 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:21:48,946 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:21:48,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:48,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1119344236, now seen corresponding path program 1 times [2019-11-15 21:21:48,947 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:21:48,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1314492342] [2019-11-15 21:21:48,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/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 21:21:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:52,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:21:52,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:52,096 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:21:52,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:52,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:52,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:52,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-15 21:21:52,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:52,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 21:21:52,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:52,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:52,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:52,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-15 21:21:52,162 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:52,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 21:21:52,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:52,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:52,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:52,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 21:21:52,215 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 214 proven. 2 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-11-15 21:21:52,215 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:21:52,271 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-11-15 21:21:52,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1314492342] [2019-11-15 21:21:52,272 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:21:52,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-15 21:21:52,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212212035] [2019-11-15 21:21:52,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:21:52,272 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:21:52,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:21:52,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:21:52,273 INFO L87 Difference]: Start difference. First operand 1620 states and 2509 transitions. Second operand 4 states. [2019-11-15 21:21:54,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:54,917 INFO L93 Difference]: Finished difference Result 3677 states and 5617 transitions. [2019-11-15 21:21:54,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:21:54,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-11-15 21:21:54,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:54,931 INFO L225 Difference]: With dead ends: 3677 [2019-11-15 21:21:54,931 INFO L226 Difference]: Without dead ends: 2064 [2019-11-15 21:21:54,934 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 357 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:21:54,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2019-11-15 21:21:55,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 1620. [2019-11-15 21:21:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1620 states. [2019-11-15 21:21:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2490 transitions. [2019-11-15 21:21:55,010 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2490 transitions. Word has length 183 [2019-11-15 21:21:55,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:55,011 INFO L462 AbstractCegarLoop]: Abstraction has 1620 states and 2490 transitions. [2019-11-15 21:21:55,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:21:55,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2490 transitions. [2019-11-15 21:21:55,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-15 21:21:55,017 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:55,017 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2019-11-15 21:21:55,231 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:21:55,232 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:21:55,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:55,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1770356890, now seen corresponding path program 1 times [2019-11-15 21:21:55,233 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:21:55,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [993821611] [2019-11-15 21:21:55,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fffaa154-98e0-434d-bfa8-934c79c01f4a/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:21:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:59,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-15 21:21:59,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:22:02,820 INFO L235 Elim1Store]: Index analysis took 678 ms [2019-11-15 21:22:02,842 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:22:02,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2019-11-15 21:22:02,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:22:07,079 WARN L191 SmtUtils]: Spent 4.23 s on a formula simplification that was a NOOP. DAG size: 90 [2019-11-15 21:22:07,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:22:07,083 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_208|, |v_#memory_$Pointer$.base_214|], 2=[|v_#memory_$Pointer$.offset_203|, |v_#memory_$Pointer$.base_203|, |v_#memory_$Pointer$.base_202|, |v_#memory_$Pointer$.base_201|, |v_#memory_$Pointer$.offset_201|, |v_#memory_$Pointer$.offset_202|]} [2019-11-15 21:22:07,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:07,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:07,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:07,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:07,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:07,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:08,095 INFO L235 Elim1Store]: Index analysis took 736 ms [2019-11-15 21:22:09,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 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 21:22:09,231 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:22:14,359 WARN L191 SmtUtils]: Spent 5.13 s on a formula simplification that was a NOOP. DAG size: 87 [2019-11-15 21:22:14,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:22:14,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:14,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:14,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:15,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:15,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:15,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:15,800 INFO L235 Elim1Store]: Index analysis took 1131 ms [2019-11-15 21:22:17,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 12 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 21:22:17,859 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:22:22,294 WARN L191 SmtUtils]: Spent 4.43 s on a formula simplification that was a NOOP. DAG size: 84 [2019-11-15 21:22:22,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:22:22,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:22,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:22,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:22,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:22,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:22,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:22,979 INFO L235 Elim1Store]: Index analysis took 503 ms [2019-11-15 21:22:23,528 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2019-11-15 21:22:23,529 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:22:25,671 WARN L191 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 78 [2019-11-15 21:22:25,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:22:25,695 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 21:22:27,473 WARN L191 SmtUtils]: Spent 1.78 s on a formula simplification that was a NOOP. DAG size: 74 [2019-11-15 21:22:27,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:22:27,489 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:22:28,464 WARN L191 SmtUtils]: Spent 974.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-15 21:22:28,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:22:28,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:28,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:28,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:28,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:28,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:28,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:28,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:28,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:28,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:28,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:28,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:28,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:28,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:28,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:28,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:28,627 INFO L235 Elim1Store]: Index analysis took 138 ms [2019-11-15 21:22:28,629 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-11-15 21:22:28,629 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 21:22:29,010 WARN L191 SmtUtils]: Spent 379.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-15 21:22:29,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:22:29,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:29,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:29,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:29,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:29,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:29,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:29,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 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 21:22:29,059 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-15 21:22:29,240 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-15 21:22:29,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:22:29,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:29,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:29,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:29,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:29,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:29,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:29,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 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 21:22:29,265 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-15 21:22:29,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:22:29,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:22:29,351 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 14 variables, input treesize:211, output treesize:91 [2019-11-15 21:22:29,392 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_209|], 12=[|v_#memory_$Pointer$.base_215|]} [2019-11-15 21:22:29,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:29,410 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 29 treesize of output 13 [2019-11-15 21:22:29,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:22:29,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:22:29,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:29,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:29,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:29,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:29,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:29,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:29,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 52 [2019-11-15 21:22:29,508 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:22:29,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:22:29,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:22:29,543 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-11-15 21:22:29,551 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_204|, |v_#memory_$Pointer$.offset_205|, |v_#memory_$Pointer$.base_204|, |v_#memory_$Pointer$.offset_210|], 6=[|v_#memory_$Pointer$.base_205|], 12=[|v_#memory_$Pointer$.base_216|]} [2019-11-15 21:22:29,572 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 21:22:30,211 WARN L191 SmtUtils]: Spent 639.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-15 21:22:30,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:22:30,225 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 21:22:30,529 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-15 21:22:30,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:22:30,539 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 21:22:30,818 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-15 21:22:30,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:22:30,842 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 79 treesize of output 73 [2019-11-15 21:22:30,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:30,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:30,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:30,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:30,917 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 53 treesize of output 41 [2019-11-15 21:22:30,918 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 21:22:30,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:22:30,923 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:22:31,174 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-15 21:22:31,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:22:31,179 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:22:31,394 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-15 21:22:31,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:22:31,599 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:22:31,600 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.downgradeDimensionsIfNecessary(ArrayOccurrenceAnalysis.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:200) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.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 21:22:31,605 INFO L168 Benchmark]: Toolchain (without parser) took 128498.97 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 336.1 MB). Free memory was 948.3 MB in the beginning and 1.2 GB in the end (delta: -281.7 MB). Peak memory consumption was 54.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:22:31,605 INFO L168 Benchmark]: CDTParser took 0.33 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 21:22:31,605 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1120.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:22:31,606 INFO L168 Benchmark]: Boogie Procedure Inliner took 135.39 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:22:31,606 INFO L168 Benchmark]: Boogie Preprocessor took 101.67 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:22:31,606 INFO L168 Benchmark]: RCFGBuilder took 3049.74 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: 86.3 MB). Peak memory consumption was 86.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:22:31,607 INFO L168 Benchmark]: TraceAbstraction took 124084.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -216.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:22:31,609 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.33 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 1120.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 135.39 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 101.67 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3049.74 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: 86.3 MB). Peak memory consumption was 86.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 124084.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -216.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...