./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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_742c9572-99c1-4a1d-b36a-f154e55bb861/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_742c9572-99c1-4a1d-b36a-f154e55bb861/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_742c9572-99c1-4a1d-b36a-f154e55bb861/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_742c9572-99c1-4a1d-b36a-f154e55bb861/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_742c9572-99c1-4a1d-b36a-f154e55bb861/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_742c9572-99c1-4a1d-b36a-f154e55bb861/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 96aededabe895f84f71d6d614ed1af512bf7353b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:45:53,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:45:53,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:45:53,871 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:45:53,872 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:45:53,873 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:45:53,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:45:53,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:45:53,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:45:53,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:45:53,880 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:45:53,881 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:45:53,881 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:45:53,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:45:53,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:45:53,884 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:45:53,884 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:45:53,885 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:45:53,887 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:45:53,889 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:45:53,890 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:45:53,891 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:45:53,892 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:45:53,893 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:45:53,895 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:45:53,895 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:45:53,896 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:45:53,897 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:45:53,897 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:45:53,898 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:45:53,898 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:45:53,899 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:45:53,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:45:53,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:45:53,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:45:53,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:45:53,902 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:45:53,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:45:53,903 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:45:53,904 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:45:53,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:45:53,905 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_742c9572-99c1-4a1d-b36a-f154e55bb861/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-15 23:45:53,918 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:45:53,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:45:53,919 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:45:53,919 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:45:53,920 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:45:53,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:45:53,920 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:45:53,920 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:45:53,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:45:53,921 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:45:53,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:45:53,921 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:45:53,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:45:53,922 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:45:53,922 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-15 23:45:53,922 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:45:53,923 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:45:53,923 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:45:53,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:45:53,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:45:53,924 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:45:53,924 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:45:53,924 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:45:53,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:45:53,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:45:53,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:45:53,925 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:45:53,925 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:45:53,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:45:53,926 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:45:53,926 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_742c9572-99c1-4a1d-b36a-f154e55bb861/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 ! overflow) ) 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 -> 96aededabe895f84f71d6d614ed1af512bf7353b [2019-11-15 23:45:53,952 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:45:53,962 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:45:53,965 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:45:53,967 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:45:53,967 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:45:53,968 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_742c9572-99c1-4a1d-b36a-f154e55bb861/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2019-11-15 23:45:54,025 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_742c9572-99c1-4a1d-b36a-f154e55bb861/bin/uautomizer/data/6f6604d88/25203d21803640cfabe9a8b65a58fa62/FLAGe85950e4a [2019-11-15 23:45:54,435 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:45:54,449 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_742c9572-99c1-4a1d-b36a-f154e55bb861/sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2019-11-15 23:45:54,467 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_742c9572-99c1-4a1d-b36a-f154e55bb861/bin/uautomizer/data/6f6604d88/25203d21803640cfabe9a8b65a58fa62/FLAGe85950e4a [2019-11-15 23:45:54,766 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_742c9572-99c1-4a1d-b36a-f154e55bb861/bin/uautomizer/data/6f6604d88/25203d21803640cfabe9a8b65a58fa62 [2019-11-15 23:45:54,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:45:54,770 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:45:54,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:45:54,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:45:54,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:45:54,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:45:54" (1/1) ... [2019-11-15 23:45:54,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2783558f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:54, skipping insertion in model container [2019-11-15 23:45:54,778 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:45:54" (1/1) ... [2019-11-15 23:45:54,785 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:45:54,836 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:45:55,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:45:55,105 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:45:55,160 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:45:55,172 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:45:55,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:55 WrapperNode [2019-11-15 23:45:55,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:45:55,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:45:55,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:45:55,174 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:45:55,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:55" (1/1) ... [2019-11-15 23:45:55,190 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:55" (1/1) ... [2019-11-15 23:45:55,228 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:45:55,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:45:55,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:45:55,229 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:45:55,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:55" (1/1) ... [2019-11-15 23:45:55,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:55" (1/1) ... [2019-11-15 23:45:55,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:55" (1/1) ... [2019-11-15 23:45:55,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:55" (1/1) ... [2019-11-15 23:45:55,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:55" (1/1) ... [2019-11-15 23:45:55,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:55" (1/1) ... [2019-11-15 23:45:55,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:55" (1/1) ... [2019-11-15 23:45:55,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:45:55,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:45:55,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:45:55,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:45:55,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_742c9572-99c1-4a1d-b36a-f154e55bb861/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:45:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:45:55,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:45:55,447 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:45:56,037 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-15 23:45:56,037 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-15 23:45:56,039 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:45:56,039 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:45:56,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:45:56 BoogieIcfgContainer [2019-11-15 23:45:56,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:45:56,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:45:56,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:45:56,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:45:56,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:45:54" (1/3) ... [2019-11-15 23:45:56,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6105545d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:45:56, skipping insertion in model container [2019-11-15 23:45:56,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:55" (2/3) ... [2019-11-15 23:45:56,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6105545d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:45:56, skipping insertion in model container [2019-11-15 23:45:56,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:45:56" (3/3) ... [2019-11-15 23:45:56,048 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a_alt.BV.c.cil.c [2019-11-15 23:45:56,057 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:45:56,067 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-15 23:45:56,077 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-15 23:45:56,117 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:45:56,118 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:45:56,118 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:45:56,118 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:45:56,118 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:45:56,119 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:45:56,119 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:45:56,119 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:45:56,144 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-11-15 23:45:56,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 23:45:56,154 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:56,155 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:56,157 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:45:56,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:56,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1287811732, now seen corresponding path program 1 times [2019-11-15 23:45:56,171 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:56,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122938175] [2019-11-15 23:45:56,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:56,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:56,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:56,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:45:56,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122938175] [2019-11-15 23:45:56,341 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:56,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:56,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355409146] [2019-11-15 23:45:56,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:56,346 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:56,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:56,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:56,357 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 3 states. [2019-11-15 23:45:56,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:56,615 INFO L93 Difference]: Finished difference Result 323 states and 532 transitions. [2019-11-15 23:45:56,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:56,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-15 23:45:56,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:56,631 INFO L225 Difference]: With dead ends: 323 [2019-11-15 23:45:56,631 INFO L226 Difference]: Without dead ends: 155 [2019-11-15 23:45:56,634 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:56,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-15 23:45:56,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-11-15 23:45:56,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-15 23:45:56,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 230 transitions. [2019-11-15 23:45:56,679 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 230 transitions. Word has length 16 [2019-11-15 23:45:56,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:56,680 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 230 transitions. [2019-11-15 23:45:56,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:56,680 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 230 transitions. [2019-11-15 23:45:56,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 23:45:56,681 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:56,681 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:56,681 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:45:56,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:56,682 INFO L82 PathProgramCache]: Analyzing trace with hash 664085130, now seen corresponding path program 1 times [2019-11-15 23:45:56,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:56,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052236738] [2019-11-15 23:45:56,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:56,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:56,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:56,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:45:56,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052236738] [2019-11-15 23:45:56,748 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:56,749 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:56,749 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108758756] [2019-11-15 23:45:56,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:56,750 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:56,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:56,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:56,751 INFO L87 Difference]: Start difference. First operand 155 states and 230 transitions. Second operand 3 states. [2019-11-15 23:45:56,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:56,918 INFO L93 Difference]: Finished difference Result 313 states and 462 transitions. [2019-11-15 23:45:56,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:56,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-15 23:45:56,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:56,921 INFO L225 Difference]: With dead ends: 313 [2019-11-15 23:45:56,921 INFO L226 Difference]: Without dead ends: 165 [2019-11-15 23:45:56,922 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:56,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-15 23:45:56,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 156. [2019-11-15 23:45:56,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-15 23:45:56,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 231 transitions. [2019-11-15 23:45:56,946 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 231 transitions. Word has length 17 [2019-11-15 23:45:56,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:56,946 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 231 transitions. [2019-11-15 23:45:56,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:56,947 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 231 transitions. [2019-11-15 23:45:56,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 23:45:56,948 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:56,948 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:56,949 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:45:56,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:56,951 INFO L82 PathProgramCache]: Analyzing trace with hash 37329238, now seen corresponding path program 1 times [2019-11-15 23:45:56,951 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:56,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086916626] [2019-11-15 23:45:56,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:56,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:56,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:57,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:45:57,029 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086916626] [2019-11-15 23:45:57,029 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:57,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:57,030 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247524309] [2019-11-15 23:45:57,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:57,030 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:57,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:57,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:57,031 INFO L87 Difference]: Start difference. First operand 156 states and 231 transitions. Second operand 3 states. [2019-11-15 23:45:57,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:57,207 INFO L93 Difference]: Finished difference Result 315 states and 464 transitions. [2019-11-15 23:45:57,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:57,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-15 23:45:57,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:57,210 INFO L225 Difference]: With dead ends: 315 [2019-11-15 23:45:57,210 INFO L226 Difference]: Without dead ends: 166 [2019-11-15 23:45:57,211 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:57,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-15 23:45:57,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 157. [2019-11-15 23:45:57,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-15 23:45:57,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 232 transitions. [2019-11-15 23:45:57,233 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 232 transitions. Word has length 18 [2019-11-15 23:45:57,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:57,233 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 232 transitions. [2019-11-15 23:45:57,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:57,233 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 232 transitions. [2019-11-15 23:45:57,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:45:57,235 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:57,235 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:57,235 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:45:57,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:57,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1635395343, now seen corresponding path program 1 times [2019-11-15 23:45:57,236 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:57,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723204730] [2019-11-15 23:45:57,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:57,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:57,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:57,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:45:57,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723204730] [2019-11-15 23:45:57,292 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:57,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:57,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058406636] [2019-11-15 23:45:57,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:57,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:57,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:57,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:57,294 INFO L87 Difference]: Start difference. First operand 157 states and 232 transitions. Second operand 3 states. [2019-11-15 23:45:57,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:57,455 INFO L93 Difference]: Finished difference Result 317 states and 466 transitions. [2019-11-15 23:45:57,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:57,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-15 23:45:57,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:57,458 INFO L225 Difference]: With dead ends: 317 [2019-11-15 23:45:57,458 INFO L226 Difference]: Without dead ends: 167 [2019-11-15 23:45:57,459 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:57,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-15 23:45:57,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 158. [2019-11-15 23:45:57,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-15 23:45:57,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 233 transitions. [2019-11-15 23:45:57,471 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 233 transitions. Word has length 19 [2019-11-15 23:45:57,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:57,472 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 233 transitions. [2019-11-15 23:45:57,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:57,472 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 233 transitions. [2019-11-15 23:45:57,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 23:45:57,473 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:57,473 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:57,473 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:45:57,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:57,474 INFO L82 PathProgramCache]: Analyzing trace with hash -811500677, now seen corresponding path program 1 times [2019-11-15 23:45:57,474 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:57,474 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777945169] [2019-11-15 23:45:57,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:57,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:57,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:57,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:45:57,519 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777945169] [2019-11-15 23:45:57,519 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:57,519 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:57,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594243528] [2019-11-15 23:45:57,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:57,520 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:57,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:57,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:57,521 INFO L87 Difference]: Start difference. First operand 158 states and 233 transitions. Second operand 3 states. [2019-11-15 23:45:57,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:57,688 INFO L93 Difference]: Finished difference Result 319 states and 468 transitions. [2019-11-15 23:45:57,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:57,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-15 23:45:57,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:57,690 INFO L225 Difference]: With dead ends: 319 [2019-11-15 23:45:57,691 INFO L226 Difference]: Without dead ends: 168 [2019-11-15 23:45:57,691 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:57,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-15 23:45:57,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 159. [2019-11-15 23:45:57,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-15 23:45:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 234 transitions. [2019-11-15 23:45:57,702 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 234 transitions. Word has length 20 [2019-11-15 23:45:57,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:57,702 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 234 transitions. [2019-11-15 23:45:57,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:57,703 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 234 transitions. [2019-11-15 23:45:57,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 23:45:57,705 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:57,705 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:57,705 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:45:57,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:57,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1579118521, now seen corresponding path program 1 times [2019-11-15 23:45:57,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:57,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195592033] [2019-11-15 23:45:57,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:57,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:57,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:57,725 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 23:45:57,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2110827372] [2019-11-15 23:45:57,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_742c9572-99c1-4a1d-b36a-f154e55bb861/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 23:45:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:57,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:45:57,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:45:57,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:45:57,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195592033] [2019-11-15 23:45:57,851 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 23:45:57,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110827372] [2019-11-15 23:45:57,851 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:57,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:57,853 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157669602] [2019-11-15 23:45:57,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:57,856 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:57,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:57,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:57,857 INFO L87 Difference]: Start difference. First operand 159 states and 234 transitions. Second operand 3 states. [2019-11-15 23:45:57,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:57,946 INFO L93 Difference]: Finished difference Result 455 states and 672 transitions. [2019-11-15 23:45:57,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:57,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-15 23:45:57,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:57,949 INFO L225 Difference]: With dead ends: 455 [2019-11-15 23:45:57,950 INFO L226 Difference]: Without dead ends: 303 [2019-11-15 23:45:57,950 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:57,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-11-15 23:45:57,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2019-11-15 23:45:57,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-11-15 23:45:57,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 446 transitions. [2019-11-15 23:45:57,984 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 446 transitions. Word has length 39 [2019-11-15 23:45:57,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:57,985 INFO L462 AbstractCegarLoop]: Abstraction has 299 states and 446 transitions. [2019-11-15 23:45:57,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:57,985 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 446 transitions. [2019-11-15 23:45:57,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 23:45:57,994 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:57,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, 1, 1, 1, 1, 1] [2019-11-15 23:45:58,198 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:45:58,206 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:45:58,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:58,206 INFO L82 PathProgramCache]: Analyzing trace with hash 643824433, now seen corresponding path program 1 times [2019-11-15 23:45:58,206 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:58,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169042299] [2019-11-15 23:45:58,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:58,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:58,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:58,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:45:58,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169042299] [2019-11-15 23:45:58,260 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:58,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:58,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619294201] [2019-11-15 23:45:58,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:58,261 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:58,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:58,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:58,262 INFO L87 Difference]: Start difference. First operand 299 states and 446 transitions. Second operand 3 states. [2019-11-15 23:45:58,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:58,451 INFO L93 Difference]: Finished difference Result 653 states and 987 transitions. [2019-11-15 23:45:58,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:58,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-15 23:45:58,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:58,455 INFO L225 Difference]: With dead ends: 653 [2019-11-15 23:45:58,455 INFO L226 Difference]: Without dead ends: 361 [2019-11-15 23:45:58,456 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:58,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-15 23:45:58,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2019-11-15 23:45:58,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-15 23:45:58,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 550 transitions. [2019-11-15 23:45:58,480 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 550 transitions. Word has length 44 [2019-11-15 23:45:58,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:58,482 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 550 transitions. [2019-11-15 23:45:58,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:58,482 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 550 transitions. [2019-11-15 23:45:58,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 23:45:58,486 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:58,486 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:58,487 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:45:58,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:58,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1369957728, now seen corresponding path program 1 times [2019-11-15 23:45:58,487 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:58,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734142944] [2019-11-15 23:45:58,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:58,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:58,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:58,515 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 23:45:58,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1566695118] [2019-11-15 23:45:58,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_742c9572-99c1-4a1d-b36a-f154e55bb861/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 23:45:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:58,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:45:58,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:45:58,598 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:45:58,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734142944] [2019-11-15 23:45:58,598 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 23:45:58,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566695118] [2019-11-15 23:45:58,599 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:58,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:58,599 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954025162] [2019-11-15 23:45:58,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:58,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:58,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:58,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:58,600 INFO L87 Difference]: Start difference. First operand 361 states and 550 transitions. Second operand 3 states. [2019-11-15 23:45:58,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:58,651 INFO L93 Difference]: Finished difference Result 719 states and 1092 transitions. [2019-11-15 23:45:58,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:58,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-15 23:45:58,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:58,656 INFO L225 Difference]: With dead ends: 719 [2019-11-15 23:45:58,656 INFO L226 Difference]: Without dead ends: 536 [2019-11-15 23:45:58,657 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:58,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-11-15 23:45:58,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 532. [2019-11-15 23:45:58,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-11-15 23:45:58,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 815 transitions. [2019-11-15 23:45:58,683 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 815 transitions. Word has length 55 [2019-11-15 23:45:58,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:58,685 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 815 transitions. [2019-11-15 23:45:58,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:58,685 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 815 transitions. [2019-11-15 23:45:58,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 23:45:58,687 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:58,687 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:58,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:45:58,892 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:45:58,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:58,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1405602907, now seen corresponding path program 1 times [2019-11-15 23:45:58,892 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:58,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130917536] [2019-11-15 23:45:58,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:58,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:58,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:58,946 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:45:58,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130917536] [2019-11-15 23:45:58,946 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:58,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:58,947 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713802365] [2019-11-15 23:45:58,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:58,947 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:58,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:58,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:58,948 INFO L87 Difference]: Start difference. First operand 532 states and 815 transitions. Second operand 3 states. [2019-11-15 23:45:59,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:59,118 INFO L93 Difference]: Finished difference Result 1111 states and 1694 transitions. [2019-11-15 23:45:59,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:59,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-15 23:45:59,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:59,124 INFO L225 Difference]: With dead ends: 1111 [2019-11-15 23:45:59,124 INFO L226 Difference]: Without dead ends: 586 [2019-11-15 23:45:59,125 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:59,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-15 23:45:59,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 580. [2019-11-15 23:45:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-11-15 23:45:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 878 transitions. [2019-11-15 23:45:59,148 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 878 transitions. Word has length 56 [2019-11-15 23:45:59,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:59,148 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 878 transitions. [2019-11-15 23:45:59,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:59,148 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 878 transitions. [2019-11-15 23:45:59,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 23:45:59,149 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:59,150 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, 1, 1, 1] [2019-11-15 23:45:59,150 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:45:59,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:59,150 INFO L82 PathProgramCache]: Analyzing trace with hash -2147424561, now seen corresponding path program 1 times [2019-11-15 23:45:59,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:59,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822937771] [2019-11-15 23:45:59,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:59,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:59,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:59,175 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:45:59,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822937771] [2019-11-15 23:45:59,176 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:59,176 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:59,176 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221365781] [2019-11-15 23:45:59,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:59,177 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:59,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:59,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:59,177 INFO L87 Difference]: Start difference. First operand 580 states and 878 transitions. Second operand 3 states. [2019-11-15 23:45:59,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:59,337 INFO L93 Difference]: Finished difference Result 1162 states and 1757 transitions. [2019-11-15 23:45:59,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:59,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-15 23:45:59,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:59,341 INFO L225 Difference]: With dead ends: 1162 [2019-11-15 23:45:59,341 INFO L226 Difference]: Without dead ends: 589 [2019-11-15 23:45:59,342 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:59,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-11-15 23:45:59,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 583. [2019-11-15 23:45:59,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-11-15 23:45:59,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 878 transitions. [2019-11-15 23:45:59,365 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 878 transitions. Word has length 57 [2019-11-15 23:45:59,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:59,365 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 878 transitions. [2019-11-15 23:45:59,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:59,365 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 878 transitions. [2019-11-15 23:45:59,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 23:45:59,366 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:59,367 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:59,367 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:45:59,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:59,367 INFO L82 PathProgramCache]: Analyzing trace with hash -216125576, now seen corresponding path program 1 times [2019-11-15 23:45:59,367 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:59,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655285272] [2019-11-15 23:45:59,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:59,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:59,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:45:59,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655285272] [2019-11-15 23:45:59,398 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:59,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:59,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555188134] [2019-11-15 23:45:59,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:59,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:59,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:59,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:59,399 INFO L87 Difference]: Start difference. First operand 583 states and 878 transitions. Second operand 3 states. [2019-11-15 23:45:59,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:59,563 INFO L93 Difference]: Finished difference Result 1291 states and 1970 transitions. [2019-11-15 23:45:59,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:59,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-11-15 23:45:59,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:59,568 INFO L225 Difference]: With dead ends: 1291 [2019-11-15 23:45:59,568 INFO L226 Difference]: Without dead ends: 715 [2019-11-15 23:45:59,569 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:59,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-11-15 23:45:59,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 709. [2019-11-15 23:45:59,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2019-11-15 23:45:59,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1091 transitions. [2019-11-15 23:45:59,596 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1091 transitions. Word has length 70 [2019-11-15 23:45:59,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:59,596 INFO L462 AbstractCegarLoop]: Abstraction has 709 states and 1091 transitions. [2019-11-15 23:45:59,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:59,596 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1091 transitions. [2019-11-15 23:45:59,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 23:45:59,598 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:59,598 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:59,598 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:45:59,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:59,599 INFO L82 PathProgramCache]: Analyzing trace with hash 380295080, now seen corresponding path program 1 times [2019-11-15 23:45:59,599 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:59,599 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581570175] [2019-11-15 23:45:59,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:59,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:59,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:59,645 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:45:59,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581570175] [2019-11-15 23:45:59,648 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:59,648 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:59,649 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501669139] [2019-11-15 23:45:59,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:59,649 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:59,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:59,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:59,650 INFO L87 Difference]: Start difference. First operand 709 states and 1091 transitions. Second operand 3 states. [2019-11-15 23:45:59,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:59,846 INFO L93 Difference]: Finished difference Result 1513 states and 2336 transitions. [2019-11-15 23:45:59,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:59,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-15 23:45:59,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:59,851 INFO L225 Difference]: With dead ends: 1513 [2019-11-15 23:45:59,852 INFO L226 Difference]: Without dead ends: 811 [2019-11-15 23:45:59,853 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:59,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-11-15 23:45:59,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 790. [2019-11-15 23:45:59,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-15 23:45:59,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1211 transitions. [2019-11-15 23:45:59,881 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1211 transitions. Word has length 71 [2019-11-15 23:45:59,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:59,881 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1211 transitions. [2019-11-15 23:45:59,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:59,881 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1211 transitions. [2019-11-15 23:45:59,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 23:45:59,883 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:59,883 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:59,883 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:45:59,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:59,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1769518732, now seen corresponding path program 1 times [2019-11-15 23:45:59,884 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:59,884 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996768888] [2019-11-15 23:45:59,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:59,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:59,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:59,923 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:45:59,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996768888] [2019-11-15 23:45:59,924 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:59,924 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:59,924 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763145182] [2019-11-15 23:45:59,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:59,924 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:59,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:59,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:59,925 INFO L87 Difference]: Start difference. First operand 790 states and 1211 transitions. Second operand 3 states. [2019-11-15 23:46:00,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:00,124 INFO L93 Difference]: Finished difference Result 1582 states and 2423 transitions. [2019-11-15 23:46:00,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:00,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-15 23:46:00,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:00,130 INFO L225 Difference]: With dead ends: 1582 [2019-11-15 23:46:00,130 INFO L226 Difference]: Without dead ends: 799 [2019-11-15 23:46:00,131 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:00,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-11-15 23:46:00,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 793. [2019-11-15 23:46:00,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-11-15 23:46:00,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1211 transitions. [2019-11-15 23:46:00,165 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1211 transitions. Word has length 71 [2019-11-15 23:46:00,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:00,166 INFO L462 AbstractCegarLoop]: Abstraction has 793 states and 1211 transitions. [2019-11-15 23:46:00,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:00,166 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1211 transitions. [2019-11-15 23:46:00,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 23:46:00,173 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:00,173 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:00,173 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:46:00,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:00,174 INFO L82 PathProgramCache]: Analyzing trace with hash -953703820, now seen corresponding path program 1 times [2019-11-15 23:46:00,174 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:00,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166019694] [2019-11-15 23:46:00,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:00,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:00,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:00,213 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:46:00,213 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166019694] [2019-11-15 23:46:00,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:00,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:46:00,214 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546289560] [2019-11-15 23:46:00,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:46:00,215 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:00,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:00,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:00,215 INFO L87 Difference]: Start difference. First operand 793 states and 1211 transitions. Second operand 3 states. [2019-11-15 23:46:00,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:00,424 INFO L93 Difference]: Finished difference Result 1600 states and 2447 transitions. [2019-11-15 23:46:00,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:00,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-15 23:46:00,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:00,429 INFO L225 Difference]: With dead ends: 1600 [2019-11-15 23:46:00,429 INFO L226 Difference]: Without dead ends: 814 [2019-11-15 23:46:00,431 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:00,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2019-11-15 23:46:00,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 793. [2019-11-15 23:46:00,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-11-15 23:46:00,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1202 transitions. [2019-11-15 23:46:00,462 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1202 transitions. Word has length 72 [2019-11-15 23:46:00,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:00,462 INFO L462 AbstractCegarLoop]: Abstraction has 793 states and 1202 transitions. [2019-11-15 23:46:00,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:00,463 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1202 transitions. [2019-11-15 23:46:00,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 23:46:00,464 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:00,464 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:00,465 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:46:00,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:00,465 INFO L82 PathProgramCache]: Analyzing trace with hash -816065300, now seen corresponding path program 1 times [2019-11-15 23:46:00,466 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:00,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909718191] [2019-11-15 23:46:00,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:00,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:00,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:00,477 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 23:46:00,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1914525871] [2019-11-15 23:46:00,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_742c9572-99c1-4a1d-b36a-f154e55bb861/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 23:46:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:00,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:46:00,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:46:00,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909718191] [2019-11-15 23:46:00,590 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 23:46:00,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914525871] [2019-11-15 23:46:00,590 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:00,590 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:00,591 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933205986] [2019-11-15 23:46:00,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:46:00,591 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:00,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:00,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:00,592 INFO L87 Difference]: Start difference. First operand 793 states and 1202 transitions. Second operand 3 states. [2019-11-15 23:46:00,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:00,660 INFO L93 Difference]: Finished difference Result 1583 states and 2396 transitions. [2019-11-15 23:46:00,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:00,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-11-15 23:46:00,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:00,667 INFO L225 Difference]: With dead ends: 1583 [2019-11-15 23:46:00,667 INFO L226 Difference]: Without dead ends: 1055 [2019-11-15 23:46:00,668 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:00,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2019-11-15 23:46:00,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1051. [2019-11-15 23:46:00,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2019-11-15 23:46:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1597 transitions. [2019-11-15 23:46:00,709 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1597 transitions. Word has length 76 [2019-11-15 23:46:00,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:00,709 INFO L462 AbstractCegarLoop]: Abstraction has 1051 states and 1597 transitions. [2019-11-15 23:46:00,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:00,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1597 transitions. [2019-11-15 23:46:00,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-15 23:46:00,711 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:00,712 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:00,916 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:46:00,916 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:46:00,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:00,917 INFO L82 PathProgramCache]: Analyzing trace with hash -174298828, now seen corresponding path program 1 times [2019-11-15 23:46:00,917 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:00,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966321440] [2019-11-15 23:46:00,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:00,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:00,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:00,950 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:46:00,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966321440] [2019-11-15 23:46:00,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:00,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:46:00,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193297404] [2019-11-15 23:46:00,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:46:00,952 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:00,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:00,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:00,952 INFO L87 Difference]: Start difference. First operand 1051 states and 1597 transitions. Second operand 3 states. [2019-11-15 23:46:01,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:01,179 INFO L93 Difference]: Finished difference Result 2279 states and 3475 transitions. [2019-11-15 23:46:01,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:01,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-15 23:46:01,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:01,187 INFO L225 Difference]: With dead ends: 2279 [2019-11-15 23:46:01,187 INFO L226 Difference]: Without dead ends: 1235 [2019-11-15 23:46:01,189 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:01,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-11-15 23:46:01,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1223. [2019-11-15 23:46:01,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-11-15 23:46:01,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1873 transitions. [2019-11-15 23:46:01,245 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1873 transitions. Word has length 86 [2019-11-15 23:46:01,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:01,246 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 1873 transitions. [2019-11-15 23:46:01,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:01,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1873 transitions. [2019-11-15 23:46:01,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 23:46:01,248 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:01,249 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:01,249 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:46:01,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:01,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1676680243, now seen corresponding path program 1 times [2019-11-15 23:46:01,250 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:01,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712187295] [2019-11-15 23:46:01,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:01,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:01,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:01,298 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:46:01,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712187295] [2019-11-15 23:46:01,298 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:01,298 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:46:01,299 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661649672] [2019-11-15 23:46:01,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:46:01,299 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:01,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:01,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:01,300 INFO L87 Difference]: Start difference. First operand 1223 states and 1873 transitions. Second operand 3 states. [2019-11-15 23:46:01,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:01,563 INFO L93 Difference]: Finished difference Result 2499 states and 3839 transitions. [2019-11-15 23:46:01,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:01,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-11-15 23:46:01,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:01,571 INFO L225 Difference]: With dead ends: 2499 [2019-11-15 23:46:01,571 INFO L226 Difference]: Without dead ends: 1275 [2019-11-15 23:46:01,573 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:01,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2019-11-15 23:46:01,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1263. [2019-11-15 23:46:01,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1263 states. [2019-11-15 23:46:01,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1949 transitions. [2019-11-15 23:46:01,622 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1949 transitions. Word has length 87 [2019-11-15 23:46:01,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:01,622 INFO L462 AbstractCegarLoop]: Abstraction has 1263 states and 1949 transitions. [2019-11-15 23:46:01,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:01,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1949 transitions. [2019-11-15 23:46:01,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 23:46:01,625 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:01,625 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:01,626 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:46:01,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:01,626 INFO L82 PathProgramCache]: Analyzing trace with hash 538835484, now seen corresponding path program 1 times [2019-11-15 23:46:01,627 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:01,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890551529] [2019-11-15 23:46:01,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:01,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:01,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:01,673 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-15 23:46:01,673 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890551529] [2019-11-15 23:46:01,674 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:01,674 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:46:01,674 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227921776] [2019-11-15 23:46:01,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:46:01,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:01,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:01,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:01,675 INFO L87 Difference]: Start difference. First operand 1263 states and 1949 transitions. Second operand 3 states. [2019-11-15 23:46:01,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:01,875 INFO L93 Difference]: Finished difference Result 2667 states and 4123 transitions. [2019-11-15 23:46:01,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:01,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-15 23:46:01,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:01,883 INFO L225 Difference]: With dead ends: 2667 [2019-11-15 23:46:01,884 INFO L226 Difference]: Without dead ends: 1411 [2019-11-15 23:46:01,886 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:01,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2019-11-15 23:46:01,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1363. [2019-11-15 23:46:01,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-15 23:46:01,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2085 transitions. [2019-11-15 23:46:01,938 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2085 transitions. Word has length 97 [2019-11-15 23:46:01,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:01,938 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 2085 transitions. [2019-11-15 23:46:01,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:01,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2085 transitions. [2019-11-15 23:46:01,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 23:46:01,941 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:01,941 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:01,941 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:46:01,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:01,942 INFO L82 PathProgramCache]: Analyzing trace with hash 704331080, now seen corresponding path program 1 times [2019-11-15 23:46:01,942 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:01,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125796952] [2019-11-15 23:46:01,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:01,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:01,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:01,975 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-15 23:46:01,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125796952] [2019-11-15 23:46:01,975 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:01,976 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:46:01,976 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541633224] [2019-11-15 23:46:01,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:46:01,977 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:01,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:01,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:01,978 INFO L87 Difference]: Start difference. First operand 1363 states and 2085 transitions. Second operand 3 states. [2019-11-15 23:46:02,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:02,185 INFO L93 Difference]: Finished difference Result 2767 states and 4239 transitions. [2019-11-15 23:46:02,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:02,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-15 23:46:02,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:02,195 INFO L225 Difference]: With dead ends: 2767 [2019-11-15 23:46:02,195 INFO L226 Difference]: Without dead ends: 1411 [2019-11-15 23:46:02,197 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:02,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2019-11-15 23:46:02,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1363. [2019-11-15 23:46:02,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-15 23:46:02,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2065 transitions. [2019-11-15 23:46:02,254 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2065 transitions. Word has length 98 [2019-11-15 23:46:02,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:02,254 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 2065 transitions. [2019-11-15 23:46:02,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:02,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2065 transitions. [2019-11-15 23:46:02,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-15 23:46:02,257 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:02,258 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:02,258 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:46:02,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:02,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1454055914, now seen corresponding path program 1 times [2019-11-15 23:46:02,259 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:02,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382108773] [2019-11-15 23:46:02,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:02,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:02,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:02,278 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 23:46:02,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [540194713] [2019-11-15 23:46:02,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_742c9572-99c1-4a1d-b36a-f154e55bb861/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 23:46:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:02,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:46:02,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:02,391 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-15 23:46:02,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382108773] [2019-11-15 23:46:02,392 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 23:46:02,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540194713] [2019-11-15 23:46:02,392 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:02,392 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:02,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088586339] [2019-11-15 23:46:02,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:46:02,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:02,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:02,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:02,394 INFO L87 Difference]: Start difference. First operand 1363 states and 2065 transitions. Second operand 3 states. [2019-11-15 23:46:02,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:02,641 INFO L93 Difference]: Finished difference Result 2755 states and 4163 transitions. [2019-11-15 23:46:02,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:02,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-11-15 23:46:02,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:02,649 INFO L225 Difference]: With dead ends: 2755 [2019-11-15 23:46:02,650 INFO L226 Difference]: Without dead ends: 1399 [2019-11-15 23:46:02,652 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:02,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2019-11-15 23:46:02,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1363. [2019-11-15 23:46:02,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-15 23:46:02,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1993 transitions. [2019-11-15 23:46:02,744 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1993 transitions. Word has length 116 [2019-11-15 23:46:02,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:02,745 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 1993 transitions. [2019-11-15 23:46:02,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:02,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1993 transitions. [2019-11-15 23:46:02,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-15 23:46:02,748 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:02,748 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 23:46:02,952 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:46:02,953 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:46:02,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:02,953 INFO L82 PathProgramCache]: Analyzing trace with hash 2083865546, now seen corresponding path program 1 times [2019-11-15 23:46:02,953 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:02,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167709083] [2019-11-15 23:46:02,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:02,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:02,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-15 23:46:02,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167709083] [2019-11-15 23:46:02,983 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:02,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:46:02,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439101661] [2019-11-15 23:46:02,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:46:02,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:02,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:02,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:02,985 INFO L87 Difference]: Start difference. First operand 1363 states and 1993 transitions. Second operand 3 states. [2019-11-15 23:46:03,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:03,185 INFO L93 Difference]: Finished difference Result 2827 states and 4135 transitions. [2019-11-15 23:46:03,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:03,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-11-15 23:46:03,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:03,194 INFO L225 Difference]: With dead ends: 2827 [2019-11-15 23:46:03,194 INFO L226 Difference]: Without dead ends: 1471 [2019-11-15 23:46:03,196 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:03,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2019-11-15 23:46:03,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1459. [2019-11-15 23:46:03,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2019-11-15 23:46:03,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2117 transitions. [2019-11-15 23:46:03,253 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2117 transitions. Word has length 117 [2019-11-15 23:46:03,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:03,253 INFO L462 AbstractCegarLoop]: Abstraction has 1459 states and 2117 transitions. [2019-11-15 23:46:03,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:03,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2117 transitions. [2019-11-15 23:46:03,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-15 23:46:03,256 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:03,257 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 23:46:03,257 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:46:03,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:03,258 INFO L82 PathProgramCache]: Analyzing trace with hash -63631274, now seen corresponding path program 1 times [2019-11-15 23:46:03,259 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:03,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537221928] [2019-11-15 23:46:03,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:03,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:03,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:03,295 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-15 23:46:03,295 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537221928] [2019-11-15 23:46:03,295 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:03,296 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:46:03,296 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660207523] [2019-11-15 23:46:03,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:46:03,296 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:03,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:03,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:03,297 INFO L87 Difference]: Start difference. First operand 1459 states and 2117 transitions. Second operand 3 states. [2019-11-15 23:46:03,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:03,493 INFO L93 Difference]: Finished difference Result 2923 states and 4239 transitions. [2019-11-15 23:46:03,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:03,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-11-15 23:46:03,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:03,502 INFO L225 Difference]: With dead ends: 2923 [2019-11-15 23:46:03,503 INFO L226 Difference]: Without dead ends: 1471 [2019-11-15 23:46:03,505 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:03,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2019-11-15 23:46:03,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1459. [2019-11-15 23:46:03,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2019-11-15 23:46:03,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2097 transitions. [2019-11-15 23:46:03,565 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2097 transitions. Word has length 118 [2019-11-15 23:46:03,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:03,565 INFO L462 AbstractCegarLoop]: Abstraction has 1459 states and 2097 transitions. [2019-11-15 23:46:03,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:03,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2097 transitions. [2019-11-15 23:46:03,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-15 23:46:03,568 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:03,569 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:03,569 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:46:03,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:03,569 INFO L82 PathProgramCache]: Analyzing trace with hash 365233416, now seen corresponding path program 1 times [2019-11-15 23:46:03,570 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:03,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597857032] [2019-11-15 23:46:03,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:03,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:03,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:03,606 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-15 23:46:03,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597857032] [2019-11-15 23:46:03,606 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:03,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:46:03,607 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893250951] [2019-11-15 23:46:03,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:46:03,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:03,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:03,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:03,608 INFO L87 Difference]: Start difference. First operand 1459 states and 2097 transitions. Second operand 3 states. [2019-11-15 23:46:03,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:03,868 INFO L93 Difference]: Finished difference Result 3091 states and 4445 transitions. [2019-11-15 23:46:03,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:03,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-11-15 23:46:03,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:03,878 INFO L225 Difference]: With dead ends: 3091 [2019-11-15 23:46:03,879 INFO L226 Difference]: Without dead ends: 1639 [2019-11-15 23:46:03,881 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:03,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2019-11-15 23:46:03,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1623. [2019-11-15 23:46:03,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2019-11-15 23:46:03,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2337 transitions. [2019-11-15 23:46:03,947 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2337 transitions. Word has length 126 [2019-11-15 23:46:03,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:03,947 INFO L462 AbstractCegarLoop]: Abstraction has 1623 states and 2337 transitions. [2019-11-15 23:46:03,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:03,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2337 transitions. [2019-11-15 23:46:03,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-15 23:46:03,951 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:03,951 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:03,951 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:46:03,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:03,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1493527041, now seen corresponding path program 1 times [2019-11-15 23:46:03,952 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:03,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963815782] [2019-11-15 23:46:03,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:03,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:03,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:03,990 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-15 23:46:03,991 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963815782] [2019-11-15 23:46:03,991 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:03,991 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:46:03,991 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869744205] [2019-11-15 23:46:03,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:46:03,992 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:03,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:03,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:03,993 INFO L87 Difference]: Start difference. First operand 1623 states and 2337 transitions. Second operand 3 states. [2019-11-15 23:46:04,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:04,264 INFO L93 Difference]: Finished difference Result 3255 states and 4681 transitions. [2019-11-15 23:46:04,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:04,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-15 23:46:04,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:04,275 INFO L225 Difference]: With dead ends: 3255 [2019-11-15 23:46:04,276 INFO L226 Difference]: Without dead ends: 1631 [2019-11-15 23:46:04,279 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:04,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-11-15 23:46:04,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1615. [2019-11-15 23:46:04,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1615 states. [2019-11-15 23:46:04,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2321 transitions. [2019-11-15 23:46:04,376 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2321 transitions. Word has length 127 [2019-11-15 23:46:04,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:04,376 INFO L462 AbstractCegarLoop]: Abstraction has 1615 states and 2321 transitions. [2019-11-15 23:46:04,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:04,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2321 transitions. [2019-11-15 23:46:04,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-15 23:46:04,380 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:04,380 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 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 23:46:04,381 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:46:04,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:04,381 INFO L82 PathProgramCache]: Analyzing trace with hash 704603328, now seen corresponding path program 1 times [2019-11-15 23:46:04,381 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:04,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689320642] [2019-11-15 23:46:04,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:04,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:04,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:04,419 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-15 23:46:04,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689320642] [2019-11-15 23:46:04,420 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:04,420 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:46:04,420 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119260948] [2019-11-15 23:46:04,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:46:04,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:04,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:04,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:04,422 INFO L87 Difference]: Start difference. First operand 1615 states and 2321 transitions. Second operand 3 states. [2019-11-15 23:46:04,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:04,645 INFO L93 Difference]: Finished difference Result 3323 states and 4778 transitions. [2019-11-15 23:46:04,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:04,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-11-15 23:46:04,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:04,656 INFO L225 Difference]: With dead ends: 3323 [2019-11-15 23:46:04,656 INFO L226 Difference]: Without dead ends: 1715 [2019-11-15 23:46:04,659 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:04,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2019-11-15 23:46:04,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1699. [2019-11-15 23:46:04,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-11-15 23:46:04,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2417 transitions. [2019-11-15 23:46:04,722 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2417 transitions. Word has length 138 [2019-11-15 23:46:04,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:04,722 INFO L462 AbstractCegarLoop]: Abstraction has 1699 states and 2417 transitions. [2019-11-15 23:46:04,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:04,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2417 transitions. [2019-11-15 23:46:04,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-15 23:46:04,726 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:04,726 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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 23:46:04,727 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:46:04,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:04,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1658127444, now seen corresponding path program 1 times [2019-11-15 23:46:04,728 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:04,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820727885] [2019-11-15 23:46:04,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:04,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:04,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:04,764 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-15 23:46:04,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820727885] [2019-11-15 23:46:04,764 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:04,764 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:46:04,765 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918147440] [2019-11-15 23:46:04,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:46:04,766 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:04,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:04,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:04,766 INFO L87 Difference]: Start difference. First operand 1699 states and 2417 transitions. Second operand 3 states. [2019-11-15 23:46:04,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:04,962 INFO L93 Difference]: Finished difference Result 3407 states and 4846 transitions. [2019-11-15 23:46:04,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:04,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-11-15 23:46:04,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:04,972 INFO L225 Difference]: With dead ends: 3407 [2019-11-15 23:46:04,973 INFO L226 Difference]: Without dead ends: 1715 [2019-11-15 23:46:04,975 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:04,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2019-11-15 23:46:05,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1699. [2019-11-15 23:46:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-11-15 23:46:05,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2389 transitions. [2019-11-15 23:46:05,036 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2389 transitions. Word has length 139 [2019-11-15 23:46:05,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:05,036 INFO L462 AbstractCegarLoop]: Abstraction has 1699 states and 2389 transitions. [2019-11-15 23:46:05,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:05,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2389 transitions. [2019-11-15 23:46:05,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-15 23:46:05,041 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:05,041 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:05,042 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:46:05,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:05,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1163594683, now seen corresponding path program 1 times [2019-11-15 23:46:05,042 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:05,042 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699815895] [2019-11-15 23:46:05,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:05,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:05,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2019-11-15 23:46:05,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699815895] [2019-11-15 23:46:05,085 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:05,085 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:46:05,085 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872871570] [2019-11-15 23:46:05,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:46:05,086 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:05,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:05,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:05,087 INFO L87 Difference]: Start difference. First operand 1699 states and 2389 transitions. Second operand 3 states. [2019-11-15 23:46:05,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:05,151 INFO L93 Difference]: Finished difference Result 3373 states and 4735 transitions. [2019-11-15 23:46:05,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:05,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-15 23:46:05,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:05,169 INFO L225 Difference]: With dead ends: 3373 [2019-11-15 23:46:05,174 INFO L226 Difference]: Without dead ends: 1681 [2019-11-15 23:46:05,177 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:05,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2019-11-15 23:46:05,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1677. [2019-11-15 23:46:05,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1677 states. [2019-11-15 23:46:05,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2356 transitions. [2019-11-15 23:46:05,235 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2356 transitions. Word has length 154 [2019-11-15 23:46:05,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:05,236 INFO L462 AbstractCegarLoop]: Abstraction has 1677 states and 2356 transitions. [2019-11-15 23:46:05,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:05,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2356 transitions. [2019-11-15 23:46:05,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-15 23:46:05,239 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:05,240 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:05,240 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:46:05,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:05,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1358544773, now seen corresponding path program 1 times [2019-11-15 23:46:05,241 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:05,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906751962] [2019-11-15 23:46:05,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:05,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:05,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:05,305 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-15 23:46:05,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906751962] [2019-11-15 23:46:05,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552498832] [2019-11-15 23:46:05,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_742c9572-99c1-4a1d-b36a-f154e55bb861/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 23:46:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:05,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:46:05,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:05,475 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-15 23:46:05,475 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:46:05,475 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 23:46:05,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319155041] [2019-11-15 23:46:05,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:46:05,476 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:05,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:46:05,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:46:05,477 INFO L87 Difference]: Start difference. First operand 1677 states and 2356 transitions. Second operand 4 states. [2019-11-15 23:46:05,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:05,974 INFO L93 Difference]: Finished difference Result 5291 states and 7422 transitions. [2019-11-15 23:46:05,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:46:05,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-15 23:46:05,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:05,985 INFO L225 Difference]: With dead ends: 5291 [2019-11-15 23:46:05,985 INFO L226 Difference]: Without dead ends: 3521 [2019-11-15 23:46:05,988 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 156 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 23:46:05,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3521 states. [2019-11-15 23:46:06,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3521 to 2065. [2019-11-15 23:46:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2065 states. [2019-11-15 23:46:06,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 2065 states and 2916 transitions. [2019-11-15 23:46:06,067 INFO L78 Accepts]: Start accepts. Automaton has 2065 states and 2916 transitions. Word has length 154 [2019-11-15 23:46:06,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:06,068 INFO L462 AbstractCegarLoop]: Abstraction has 2065 states and 2916 transitions. [2019-11-15 23:46:06,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:46:06,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 2916 transitions. [2019-11-15 23:46:06,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-15 23:46:06,072 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:06,073 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:06,284 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:46:06,284 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:46:06,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:06,285 INFO L82 PathProgramCache]: Analyzing trace with hash 782353573, now seen corresponding path program 1 times [2019-11-15 23:46:06,285 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:06,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195870257] [2019-11-15 23:46:06,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:06,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:06,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-15 23:46:06,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195870257] [2019-11-15 23:46:06,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368004438] [2019-11-15 23:46:06,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_742c9572-99c1-4a1d-b36a-f154e55bb861/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 23:46:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:06,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:46:06,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:06,497 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-15 23:46:06,499 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:46:06,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 23:46:06,503 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140297062] [2019-11-15 23:46:06,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:46:06,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:06,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:46:06,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:46:06,504 INFO L87 Difference]: Start difference. First operand 2065 states and 2916 transitions. Second operand 4 states. [2019-11-15 23:46:06,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:06,975 INFO L93 Difference]: Finished difference Result 5632 states and 7889 transitions. [2019-11-15 23:46:06,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:46:06,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-15 23:46:06,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:06,984 INFO L225 Difference]: With dead ends: 5632 [2019-11-15 23:46:06,984 INFO L226 Difference]: Without dead ends: 3574 [2019-11-15 23:46:06,988 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 158 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 23:46:06,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3574 states. [2019-11-15 23:46:07,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3574 to 2573. [2019-11-15 23:46:07,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2573 states. [2019-11-15 23:46:07,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2573 states to 2573 states and 3491 transitions. [2019-11-15 23:46:07,077 INFO L78 Accepts]: Start accepts. Automaton has 2573 states and 3491 transitions. Word has length 156 [2019-11-15 23:46:07,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:07,078 INFO L462 AbstractCegarLoop]: Abstraction has 2573 states and 3491 transitions. [2019-11-15 23:46:07,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:46:07,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2573 states and 3491 transitions. [2019-11-15 23:46:07,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-15 23:46:07,084 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:07,084 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:07,289 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:46:07,289 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:46:07,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:07,290 INFO L82 PathProgramCache]: Analyzing trace with hash -571340489, now seen corresponding path program 1 times [2019-11-15 23:46:07,290 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:07,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30797446] [2019-11-15 23:46:07,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:07,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:07,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:07,378 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-15 23:46:07,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30797446] [2019-11-15 23:46:07,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238617744] [2019-11-15 23:46:07,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_742c9572-99c1-4a1d-b36a-f154e55bb861/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 23:46:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:07,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:46:07,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:07,509 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-15 23:46:07,510 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:46:07,510 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 23:46:07,510 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541006469] [2019-11-15 23:46:07,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:46:07,511 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:07,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:46:07,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:46:07,512 INFO L87 Difference]: Start difference. First operand 2573 states and 3491 transitions. Second operand 4 states. [2019-11-15 23:46:08,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:08,003 INFO L93 Difference]: Finished difference Result 6269 states and 8443 transitions. [2019-11-15 23:46:08,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:46:08,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-15 23:46:08,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:08,011 INFO L225 Difference]: With dead ends: 6269 [2019-11-15 23:46:08,011 INFO L226 Difference]: Without dead ends: 3674 [2019-11-15 23:46:08,015 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 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 23:46:08,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2019-11-15 23:46:08,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 2279. [2019-11-15 23:46:08,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2279 states. [2019-11-15 23:46:08,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 3070 transitions. [2019-11-15 23:46:08,099 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 3070 transitions. Word has length 163 [2019-11-15 23:46:08,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:08,100 INFO L462 AbstractCegarLoop]: Abstraction has 2279 states and 3070 transitions. [2019-11-15 23:46:08,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:46:08,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3070 transitions. [2019-11-15 23:46:08,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-15 23:46:08,105 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:08,105 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:08,317 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:46:08,318 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:46:08,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:08,318 INFO L82 PathProgramCache]: Analyzing trace with hash -2030054557, now seen corresponding path program 1 times [2019-11-15 23:46:08,319 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:08,319 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461183757] [2019-11-15 23:46:08,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:08,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:08,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:08,395 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-15 23:46:08,395 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461183757] [2019-11-15 23:46:08,396 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:08,396 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:08,396 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272401791] [2019-11-15 23:46:08,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:46:08,397 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:08,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:08,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:08,397 INFO L87 Difference]: Start difference. First operand 2279 states and 3070 transitions. Second operand 3 states. [2019-11-15 23:46:08,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:08,490 INFO L93 Difference]: Finished difference Result 5493 states and 7329 transitions. [2019-11-15 23:46:08,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:08,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-11-15 23:46:08,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:08,498 INFO L225 Difference]: With dead ends: 5493 [2019-11-15 23:46:08,498 INFO L226 Difference]: Without dead ends: 3221 [2019-11-15 23:46:08,502 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:08,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3221 states. [2019-11-15 23:46:08,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3221 to 3217. [2019-11-15 23:46:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3217 states. [2019-11-15 23:46:08,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 4257 transitions. [2019-11-15 23:46:08,604 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 4257 transitions. Word has length 165 [2019-11-15 23:46:08,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:08,605 INFO L462 AbstractCegarLoop]: Abstraction has 3217 states and 4257 transitions. [2019-11-15 23:46:08,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:08,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 4257 transitions. [2019-11-15 23:46:08,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-15 23:46:08,611 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:08,612 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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 23:46:08,619 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:46:08,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:08,620 INFO L82 PathProgramCache]: Analyzing trace with hash -36905074, now seen corresponding path program 1 times [2019-11-15 23:46:08,620 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:08,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110974740] [2019-11-15 23:46:08,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:08,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:08,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:08,633 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 23:46:08,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1673314808] [2019-11-15 23:46:08,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_742c9572-99c1-4a1d-b36a-f154e55bb861/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 23:46:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:08,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:46:08,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:08,766 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-15 23:46:08,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110974740] [2019-11-15 23:46:08,767 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 23:46:08,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673314808] [2019-11-15 23:46:08,767 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:08,767 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:08,767 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86097809] [2019-11-15 23:46:08,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:46:08,768 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:08,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:46:08,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:46:08,769 INFO L87 Difference]: Start difference. First operand 3217 states and 4257 transitions. Second operand 4 states. [2019-11-15 23:46:09,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:09,169 INFO L93 Difference]: Finished difference Result 5057 states and 6580 transitions. [2019-11-15 23:46:09,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:46:09,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-11-15 23:46:09,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:09,177 INFO L225 Difference]: With dead ends: 5057 [2019-11-15 23:46:09,177 INFO L226 Difference]: Without dead ends: 4092 [2019-11-15 23:46:09,181 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 183 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 23:46:09,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4092 states. [2019-11-15 23:46:09,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4092 to 3522. [2019-11-15 23:46:09,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3522 states. [2019-11-15 23:46:09,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 3522 states and 4633 transitions. [2019-11-15 23:46:09,339 INFO L78 Accepts]: Start accepts. Automaton has 3522 states and 4633 transitions. Word has length 186 [2019-11-15 23:46:09,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:09,339 INFO L462 AbstractCegarLoop]: Abstraction has 3522 states and 4633 transitions. [2019-11-15 23:46:09,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:46:09,340 INFO L276 IsEmpty]: Start isEmpty. Operand 3522 states and 4633 transitions. [2019-11-15 23:46:09,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-15 23:46:09,346 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:09,346 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:09,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:46:09,553 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:46:09,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:09,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1106021424, now seen corresponding path program 1 times [2019-11-15 23:46:09,554 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:09,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594987708] [2019-11-15 23:46:09,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:09,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:09,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:09,570 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 23:46:09,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [71125400] [2019-11-15 23:46:09,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_742c9572-99c1-4a1d-b36a-f154e55bb861/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 23:46:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:09,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:46:09,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:09,737 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-15 23:46:09,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594987708] [2019-11-15 23:46:09,737 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 23:46:09,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71125400] [2019-11-15 23:46:09,738 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:09,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:46:09,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697594771] [2019-11-15 23:46:09,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:46:09,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:09,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:46:09,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:46:09,740 INFO L87 Difference]: Start difference. First operand 3522 states and 4633 transitions. Second operand 5 states. [2019-11-15 23:46:10,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:10,111 INFO L93 Difference]: Finished difference Result 5415 states and 7085 transitions. [2019-11-15 23:46:10,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:46:10,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 188 [2019-11-15 23:46:10,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:10,122 INFO L225 Difference]: With dead ends: 5415 [2019-11-15 23:46:10,122 INFO L226 Difference]: Without dead ends: 5414 [2019-11-15 23:46:10,124 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:46:10,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5414 states. [2019-11-15 23:46:10,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5414 to 4841. [2019-11-15 23:46:10,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4841 states. [2019-11-15 23:46:10,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4841 states to 4841 states and 6383 transitions. [2019-11-15 23:46:10,279 INFO L78 Accepts]: Start accepts. Automaton has 4841 states and 6383 transitions. Word has length 188 [2019-11-15 23:46:10,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:10,279 INFO L462 AbstractCegarLoop]: Abstraction has 4841 states and 6383 transitions. [2019-11-15 23:46:10,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:46:10,280 INFO L276 IsEmpty]: Start isEmpty. Operand 4841 states and 6383 transitions. [2019-11-15 23:46:10,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-15 23:46:10,285 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:10,287 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:10,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:46:10,499 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:46:10,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:10,499 INFO L82 PathProgramCache]: Analyzing trace with hash 73074738, now seen corresponding path program 1 times [2019-11-15 23:46:10,500 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:10,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464374916] [2019-11-15 23:46:10,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:10,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:10,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:10,515 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 23:46:10,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1748773691] [2019-11-15 23:46:10,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_742c9572-99c1-4a1d-b36a-f154e55bb861/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 23:46:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:10,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:46:10,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:10,765 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 13 [2019-11-15 23:46:10,807 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-15 23:46:10,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464374916] [2019-11-15 23:46:10,807 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 23:46:10,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748773691] [2019-11-15 23:46:10,808 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:10,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:46:10,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404877000] [2019-11-15 23:46:10,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:46:10,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:10,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:46:10,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:46:10,809 INFO L87 Difference]: Start difference. First operand 4841 states and 6383 transitions. Second operand 5 states. [2019-11-15 23:46:11,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:11,363 INFO L93 Difference]: Finished difference Result 9086 states and 11995 transitions. [2019-11-15 23:46:11,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:46:11,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-11-15 23:46:11,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:11,373 INFO L225 Difference]: With dead ends: 9086 [2019-11-15 23:46:11,373 INFO L226 Difference]: Without dead ends: 4944 [2019-11-15 23:46:11,379 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:46:11,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4944 states. [2019-11-15 23:46:11,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4944 to 4935. [2019-11-15 23:46:11,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4935 states. [2019-11-15 23:46:11,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4935 states to 4935 states and 6457 transitions. [2019-11-15 23:46:11,606 INFO L78 Accepts]: Start accepts. Automaton has 4935 states and 6457 transitions. Word has length 189 [2019-11-15 23:46:11,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:11,606 INFO L462 AbstractCegarLoop]: Abstraction has 4935 states and 6457 transitions. [2019-11-15 23:46:11,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:46:11,607 INFO L276 IsEmpty]: Start isEmpty. Operand 4935 states and 6457 transitions. [2019-11-15 23:46:11,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-11-15 23:46:11,614 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:11,615 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:11,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:46:11,828 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:46:11,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:11,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1864895527, now seen corresponding path program 1 times [2019-11-15 23:46:11,828 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:11,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941019962] [2019-11-15 23:46:11,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:11,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:11,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:11,843 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 23:46:11,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1847967246] [2019-11-15 23:46:11,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_742c9572-99c1-4a1d-b36a-f154e55bb861/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 23:46:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:12,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:46:12,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-11-15 23:46:12,044 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941019962] [2019-11-15 23:46:12,044 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 23:46:12,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847967246] [2019-11-15 23:46:12,045 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:12,045 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:12,045 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508453473] [2019-11-15 23:46:12,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:46:12,046 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:12,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:12,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:12,047 INFO L87 Difference]: Start difference. First operand 4935 states and 6457 transitions. Second operand 3 states. [2019-11-15 23:46:12,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:12,320 INFO L93 Difference]: Finished difference Result 9835 states and 12868 transitions. [2019-11-15 23:46:12,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:12,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-11-15 23:46:12,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:12,328 INFO L225 Difference]: With dead ends: 9835 [2019-11-15 23:46:12,328 INFO L226 Difference]: Without dead ends: 3433 [2019-11-15 23:46:12,336 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:12,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2019-11-15 23:46:12,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 3427. [2019-11-15 23:46:12,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3427 states. [2019-11-15 23:46:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3427 states to 3427 states and 4448 transitions. [2019-11-15 23:46:12,447 INFO L78 Accepts]: Start accepts. Automaton has 3427 states and 4448 transitions. Word has length 196 [2019-11-15 23:46:12,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:12,448 INFO L462 AbstractCegarLoop]: Abstraction has 3427 states and 4448 transitions. [2019-11-15 23:46:12,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:12,448 INFO L276 IsEmpty]: Start isEmpty. Operand 3427 states and 4448 transitions. [2019-11-15 23:46:12,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-15 23:46:12,452 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:12,453 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:12,657 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:46:12,657 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:46:12,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:12,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1327391442, now seen corresponding path program 1 times [2019-11-15 23:46:12,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:12,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752513166] [2019-11-15 23:46:12,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:12,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:12,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:12,718 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-15 23:46:12,719 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752513166] [2019-11-15 23:46:12,719 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:12,719 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:46:12,719 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372411205] [2019-11-15 23:46:12,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:46:12,720 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:12,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:12,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:12,721 INFO L87 Difference]: Start difference. First operand 3427 states and 4448 transitions. Second operand 3 states. [2019-11-15 23:46:12,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:12,963 INFO L93 Difference]: Finished difference Result 6506 states and 8421 transitions. [2019-11-15 23:46:12,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:12,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-11-15 23:46:12,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:12,968 INFO L225 Difference]: With dead ends: 6506 [2019-11-15 23:46:12,968 INFO L226 Difference]: Without dead ends: 2978 [2019-11-15 23:46:12,973 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:12,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-11-15 23:46:13,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2936. [2019-11-15 23:46:13,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2936 states. [2019-11-15 23:46:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 3773 transitions. [2019-11-15 23:46:13,059 INFO L78 Accepts]: Start accepts. Automaton has 2936 states and 3773 transitions. Word has length 197 [2019-11-15 23:46:13,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:13,059 INFO L462 AbstractCegarLoop]: Abstraction has 2936 states and 3773 transitions. [2019-11-15 23:46:13,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:13,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 3773 transitions. [2019-11-15 23:46:13,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-11-15 23:46:13,065 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:13,065 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:13,065 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:46:13,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:13,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1162887835, now seen corresponding path program 1 times [2019-11-15 23:46:13,066 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:13,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498446684] [2019-11-15 23:46:13,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:13,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:13,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1163 backedges. 699 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2019-11-15 23:46:13,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498446684] [2019-11-15 23:46:13,183 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:13,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:13,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525750782] [2019-11-15 23:46:13,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:46:13,184 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:13,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:13,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:13,185 INFO L87 Difference]: Start difference. First operand 2936 states and 3773 transitions. Second operand 3 states. [2019-11-15 23:46:13,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:13,399 INFO L93 Difference]: Finished difference Result 6138 states and 7862 transitions. [2019-11-15 23:46:13,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:13,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-11-15 23:46:13,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:13,404 INFO L225 Difference]: With dead ends: 6138 [2019-11-15 23:46:13,405 INFO L226 Difference]: Without dead ends: 3224 [2019-11-15 23:46:13,408 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:13,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3224 states. [2019-11-15 23:46:13,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3224 to 3208. [2019-11-15 23:46:13,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3208 states. [2019-11-15 23:46:13,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 4085 transitions. [2019-11-15 23:46:13,538 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 4085 transitions. Word has length 335 [2019-11-15 23:46:13,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:13,538 INFO L462 AbstractCegarLoop]: Abstraction has 3208 states and 4085 transitions. [2019-11-15 23:46:13,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:13,538 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 4085 transitions. [2019-11-15 23:46:13,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-11-15 23:46:13,544 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:13,544 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:13,545 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:46:13,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:13,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1926092110, now seen corresponding path program 1 times [2019-11-15 23:46:13,545 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:13,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224369848] [2019-11-15 23:46:13,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:13,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:13,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:13,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1423 backedges. 823 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-11-15 23:46:13,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224369848] [2019-11-15 23:46:13,680 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:13,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:13,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797950471] [2019-11-15 23:46:13,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:46:13,681 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:13,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:13,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:13,682 INFO L87 Difference]: Start difference. First operand 3208 states and 4085 transitions. Second operand 3 states. [2019-11-15 23:46:13,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:13,905 INFO L93 Difference]: Finished difference Result 6443 states and 8197 transitions. [2019-11-15 23:46:13,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:13,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 366 [2019-11-15 23:46:13,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:13,910 INFO L225 Difference]: With dead ends: 6443 [2019-11-15 23:46:13,911 INFO L226 Difference]: Without dead ends: 3257 [2019-11-15 23:46:13,914 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:13,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3257 states. [2019-11-15 23:46:13,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3257 to 3030. [2019-11-15 23:46:13,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3030 states. [2019-11-15 23:46:14,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3851 transitions. [2019-11-15 23:46:14,004 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3851 transitions. Word has length 366 [2019-11-15 23:46:14,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:14,005 INFO L462 AbstractCegarLoop]: Abstraction has 3030 states and 3851 transitions. [2019-11-15 23:46:14,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:46:14,005 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3851 transitions. [2019-11-15 23:46:14,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-11-15 23:46:14,013 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:14,013 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:14,013 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:46:14,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:14,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1476749664, now seen corresponding path program 1 times [2019-11-15 23:46:14,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:14,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931095758] [2019-11-15 23:46:14,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:14,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:14,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:14,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1718 backedges. 353 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-11-15 23:46:14,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931095758] [2019-11-15 23:46:14,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195415162] [2019-11-15 23:46:14,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_742c9572-99c1-4a1d-b36a-f154e55bb861/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 23:46:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:14,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:46:14,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:14,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1718 backedges. 353 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-11-15 23:46:14,507 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:46:14,508 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 23:46:14,508 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732898054] [2019-11-15 23:46:14,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:46:14,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:14,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:46:14,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:46:14,509 INFO L87 Difference]: Start difference. First operand 3030 states and 3851 transitions. Second operand 4 states. [2019-11-15 23:46:14,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:14,693 INFO L93 Difference]: Finished difference Result 4189 states and 5327 transitions. [2019-11-15 23:46:14,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:46:14,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 399 [2019-11-15 23:46:14,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:14,694 INFO L225 Difference]: With dead ends: 4189 [2019-11-15 23:46:14,694 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:46:14,697 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 401 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 23:46:14,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:46:14,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:46:14,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:46:14,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:46:14,698 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 399 [2019-11-15 23:46:14,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:14,698 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:46:14,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:46:14,698 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:46:14,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:46:14,898 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:46:14,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:46:15,147 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 116 [2019-11-15 23:46:16,440 WARN L191 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 435 DAG size of output: 270 [2019-11-15 23:46:17,631 WARN L191 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 436 DAG size of output: 271 [2019-11-15 23:46:18,171 WARN L191 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 60 [2019-11-15 23:46:18,429 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2019-11-15 23:46:18,708 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 49 [2019-11-15 23:46:18,836 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-15 23:46:21,011 WARN L191 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 233 DAG size of output: 83 [2019-11-15 23:46:21,150 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-15 23:46:21,277 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-15 23:46:21,718 WARN L191 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 44 [2019-11-15 23:46:22,074 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 17 [2019-11-15 23:46:22,207 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-15 23:46:22,375 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 17 [2019-11-15 23:46:22,505 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-15 23:46:22,743 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 49 [2019-11-15 23:46:22,913 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 17 [2019-11-15 23:46:23,280 WARN L191 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 55 [2019-11-15 23:46:25,455 WARN L191 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 234 DAG size of output: 83 [2019-11-15 23:46:25,592 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 9 [2019-11-15 23:46:25,801 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 50 [2019-11-15 23:46:26,205 WARN L191 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 38 [2019-11-15 23:46:26,207 INFO L443 ceAbstractionStarter]: For program point L630(lines 630 634) no Hoare annotation was computed. [2019-11-15 23:46:26,207 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 405) no Hoare annotation was computed. [2019-11-15 23:46:26,207 INFO L443 ceAbstractionStarter]: For program point L201(lines 201 592) no Hoare annotation was computed. [2019-11-15 23:46:26,207 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 603) no Hoare annotation was computed. [2019-11-15 23:46:26,207 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 614) no Hoare annotation was computed. [2019-11-15 23:46:26,207 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 625) no Hoare annotation was computed. [2019-11-15 23:46:26,207 INFO L443 ceAbstractionStarter]: For program point L466(lines 466 470) no Hoare annotation was computed. [2019-11-15 23:46:26,208 INFO L439 ceAbstractionStarter]: At program point L202(lines 198 593) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) [2019-11-15 23:46:26,208 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 625) the Hoare annotation is: false [2019-11-15 23:46:26,208 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 502) no Hoare annotation was computed. [2019-11-15 23:46:26,208 INFO L443 ceAbstractionStarter]: For program point L501(lines 501 505) no Hoare annotation was computed. [2019-11-15 23:46:26,208 INFO L443 ceAbstractionStarter]: For program point L501-2(lines 209 587) no Hoare annotation was computed. [2019-11-15 23:46:26,208 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 242) no Hoare annotation was computed. [2019-11-15 23:46:26,208 INFO L443 ceAbstractionStarter]: For program point L204(lines 204 591) no Hoare annotation was computed. [2019-11-15 23:46:26,208 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 602) no Hoare annotation was computed. [2019-11-15 23:46:26,208 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 613) no Hoare annotation was computed. [2019-11-15 23:46:26,208 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 624) no Hoare annotation was computed. [2019-11-15 23:46:26,208 INFO L443 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-11-15 23:46:26,209 INFO L443 ceAbstractionStarter]: For program point L502-1(line 502) no Hoare annotation was computed. [2019-11-15 23:46:26,209 INFO L443 ceAbstractionStarter]: For program point L502-2(line 502) no Hoare annotation was computed. [2019-11-15 23:46:26,209 INFO L443 ceAbstractionStarter]: For program point L502-3(line 502) no Hoare annotation was computed. [2019-11-15 23:46:26,209 INFO L439 ceAbstractionStarter]: At program point L205(lines 204 591) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-15 23:46:26,209 INFO L439 ceAbstractionStarter]: At program point L172(lines 168 603) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) [2019-11-15 23:46:26,209 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 614) the Hoare annotation is: (let ((.cse0 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))))) (or (and .cse0 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))))) [2019-11-15 23:46:26,209 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-11-15 23:46:26,209 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-11-15 23:46:26,209 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-11-15 23:46:26,209 INFO L443 ceAbstractionStarter]: For program point L306-2(lines 209 587) no Hoare annotation was computed. [2019-11-15 23:46:26,210 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 601) no Hoare annotation was computed. [2019-11-15 23:46:26,210 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 612) no Hoare annotation was computed. [2019-11-15 23:46:26,210 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 623) no Hoare annotation was computed. [2019-11-15 23:46:26,210 INFO L443 ceAbstractionStarter]: For program point L571(lines 571 581) no Hoare annotation was computed. [2019-11-15 23:46:26,210 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 581) no Hoare annotation was computed. [2019-11-15 23:46:26,210 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 439 451) no Hoare annotation was computed. [2019-11-15 23:46:26,210 INFO L439 ceAbstractionStarter]: At program point L208(lines 207 590) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-15 23:46:26,210 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-11-15 23:46:26,210 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 502) no Hoare annotation was computed. [2019-11-15 23:46:26,210 INFO L443 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-11-15 23:46:26,210 INFO L439 ceAbstractionStarter]: At program point L407(lines 398 418) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-15 23:46:26,210 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-11-15 23:46:26,211 INFO L443 ceAbstractionStarter]: For program point L341-2(lines 209 587) no Hoare annotation was computed. [2019-11-15 23:46:26,211 INFO L446 ceAbstractionStarter]: At program point L672(lines 64 674) the Hoare annotation is: true [2019-11-15 23:46:26,211 INFO L443 ceAbstractionStarter]: For program point L639(lines 639 645) no Hoare annotation was computed. [2019-11-15 23:46:26,211 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 502) no Hoare annotation was computed. [2019-11-15 23:46:26,211 INFO L443 ceAbstractionStarter]: For program point L540(lines 540 545) no Hoare annotation was computed. [2019-11-15 23:46:26,211 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 600) no Hoare annotation was computed. [2019-11-15 23:46:26,211 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 611) no Hoare annotation was computed. [2019-11-15 23:46:26,211 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 622) no Hoare annotation was computed. [2019-11-15 23:46:26,211 INFO L446 ceAbstractionStarter]: At program point L673(lines 9 675) the Hoare annotation is: true [2019-11-15 23:46:26,211 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 578) no Hoare annotation was computed. [2019-11-15 23:46:26,211 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 264) no Hoare annotation was computed. [2019-11-15 23:46:26,211 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 447) no Hoare annotation was computed. [2019-11-15 23:46:26,211 INFO L439 ceAbstractionStarter]: At program point L178(lines 174 601) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse2 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse1 .cse2) (and .cse0 .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-15 23:46:26,212 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 612) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-15 23:46:26,212 INFO L443 ceAbstractionStarter]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-11-15 23:46:26,212 INFO L439 ceAbstractionStarter]: At program point L212(lines 105 624) the Hoare annotation is: false [2019-11-15 23:46:26,212 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 599) no Hoare annotation was computed. [2019-11-15 23:46:26,212 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 610) no Hoare annotation was computed. [2019-11-15 23:46:26,212 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 621) no Hoare annotation was computed. [2019-11-15 23:46:26,212 INFO L443 ceAbstractionStarter]: For program point L511(lines 511 515) no Hoare annotation was computed. [2019-11-15 23:46:26,212 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-11-15 23:46:26,212 INFO L443 ceAbstractionStarter]: For program point L511-2(lines 511 515) no Hoare annotation was computed. [2019-11-15 23:46:26,212 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 502) no Hoare annotation was computed. [2019-11-15 23:46:26,212 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-11-15 23:46:26,212 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 64 674) no Hoare annotation was computed. [2019-11-15 23:46:26,212 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 598) no Hoare annotation was computed. [2019-11-15 23:46:26,213 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 609) no Hoare annotation was computed. [2019-11-15 23:46:26,213 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 620) no Hoare annotation was computed. [2019-11-15 23:46:26,213 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-11-15 23:46:26,213 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 262) no Hoare annotation was computed. [2019-11-15 23:46:26,213 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 380) no Hoare annotation was computed. [2019-11-15 23:46:26,213 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 320) no Hoare annotation was computed. [2019-11-15 23:46:26,213 INFO L443 ceAbstractionStarter]: For program point L316-2(lines 316 320) no Hoare annotation was computed. [2019-11-15 23:46:26,213 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-11-15 23:46:26,213 INFO L439 ceAbstractionStarter]: At program point L184(lines 180 599) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse2 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse1 .cse2) (and .cse0 .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-15 23:46:26,213 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 610) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-15 23:46:26,213 INFO L443 ceAbstractionStarter]: For program point L217-2(lines 209 587) no Hoare annotation was computed. [2019-11-15 23:46:26,214 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:46:26,214 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 597) no Hoare annotation was computed. [2019-11-15 23:46:26,214 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 608) no Hoare annotation was computed. [2019-11-15 23:46:26,214 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 619) no Hoare annotation was computed. [2019-11-15 23:46:26,214 INFO L443 ceAbstractionStarter]: For program point L550(lines 550 554) no Hoare annotation was computed. [2019-11-15 23:46:26,214 INFO L443 ceAbstractionStarter]: For program point L352(lines 352 379) no Hoare annotation was computed. [2019-11-15 23:46:26,214 INFO L443 ceAbstractionStarter]: For program point L352-1(lines 352 379) no Hoare annotation was computed. [2019-11-15 23:46:26,214 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 620) the Hoare annotation is: false [2019-11-15 23:46:26,214 INFO L439 ceAbstractionStarter]: At program point L551(lines 64 674) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-15 23:46:26,214 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 376) no Hoare annotation was computed. [2019-11-15 23:46:26,214 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 266) no Hoare annotation was computed. [2019-11-15 23:46:26,214 INFO L443 ceAbstractionStarter]: For program point L255(lines 255 260) no Hoare annotation was computed. [2019-11-15 23:46:26,214 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 596) no Hoare annotation was computed. [2019-11-15 23:46:26,214 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 607) no Hoare annotation was computed. [2019-11-15 23:46:26,215 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 618) no Hoare annotation was computed. [2019-11-15 23:46:26,215 INFO L446 ceAbstractionStarter]: At program point L685(lines 676 687) the Hoare annotation is: true [2019-11-15 23:46:26,215 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 419) no Hoare annotation was computed. [2019-11-15 23:46:26,215 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 293) no Hoare annotation was computed. [2019-11-15 23:46:26,215 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:46:26,215 INFO L443 ceAbstractionStarter]: For program point L289-2(lines 209 587) no Hoare annotation was computed. [2019-11-15 23:46:26,215 INFO L439 ceAbstractionStarter]: At program point L190(lines 186 597) the Hoare annotation is: (let ((.cse1 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)))) (.cse0 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) (= ULTIMATE.start_ssl3_accept_~s__state~0 8640) .cse0) (and .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (and .cse1 .cse0))) [2019-11-15 23:46:26,215 INFO L439 ceAbstractionStarter]: At program point L157(lines 153 608) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-15 23:46:26,215 INFO L439 ceAbstractionStarter]: At program point L124(lines 123 618) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-15 23:46:26,216 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 526) no Hoare annotation was computed. [2019-11-15 23:46:26,216 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-11-15 23:46:26,216 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 375) no Hoare annotation was computed. [2019-11-15 23:46:26,216 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 264) no Hoare annotation was computed. [2019-11-15 23:46:26,216 INFO L439 ceAbstractionStarter]: At program point L588(lines 99 656) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse7 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse21 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse4 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse5) (and .cse6 .cse7 .cse1 .cse2 .cse5 .cse8) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse1 .cse5 .cse20)) (and .cse2 (and .cse17 .cse1 .cse5)) (and .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~s__state~0 8640) .cse8) (and .cse0 .cse9 .cse13 .cse14 .cse16 .cse1 .cse11 .cse17 .cse19 .cse21 .cse5 .cse20 .cse8) (and (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse10 .cse12 .cse15 .cse18) .cse6) (and .cse0 .cse3 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) .cse21 .cse4))) [2019-11-15 23:46:26,216 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 559) no Hoare annotation was computed. [2019-11-15 23:46:26,216 INFO L443 ceAbstractionStarter]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-11-15 23:46:26,216 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-11-15 23:46:26,216 INFO L443 ceAbstractionStarter]: For program point L357-2(lines 356 373) no Hoare annotation was computed. [2019-11-15 23:46:26,217 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 595) no Hoare annotation was computed. [2019-11-15 23:46:26,217 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 606) no Hoare annotation was computed. [2019-11-15 23:46:26,217 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 617) no Hoare annotation was computed. [2019-11-15 23:46:26,217 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-11-15 23:46:26,217 INFO L443 ceAbstractionStarter]: For program point L325-1(lines 325 334) no Hoare annotation was computed. [2019-11-15 23:46:26,217 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:46:26,217 INFO L446 ceAbstractionStarter]: At program point L657(lines 98 658) the Hoare annotation is: true [2019-11-15 23:46:26,220 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 594) no Hoare annotation was computed. [2019-11-15 23:46:26,220 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 605) no Hoare annotation was computed. [2019-11-15 23:46:26,221 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 616) no Hoare annotation was computed. [2019-11-15 23:46:26,221 INFO L443 ceAbstractionStarter]: For program point L262(line 262) no Hoare annotation was computed. [2019-11-15 23:46:26,221 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 246) no Hoare annotation was computed. [2019-11-15 23:46:26,221 INFO L443 ceAbstractionStarter]: For program point L262-1(line 262) no Hoare annotation was computed. [2019-11-15 23:46:26,221 INFO L439 ceAbstractionStarter]: At program point L196(lines 192 595) the Hoare annotation is: (let ((.cse5 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse7 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (and (and .cse0 .cse1 .cse2 .cse3 .cse4) .cse5)) (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse6 .cse0 .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse4))) [2019-11-15 23:46:26,222 INFO L439 ceAbstractionStarter]: At program point L163(lines 159 606) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-15 23:46:26,222 INFO L443 ceAbstractionStarter]: For program point L229-2(lines 209 587) no Hoare annotation was computed. [2019-11-15 23:46:26,222 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 654) no Hoare annotation was computed. [2019-11-15 23:46:26,222 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-11-15 23:46:26,222 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 262) no Hoare annotation was computed. [2019-11-15 23:46:26,222 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 651) no Hoare annotation was computed. [2019-11-15 23:46:26,222 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 565) no Hoare annotation was computed. [2019-11-15 23:46:26,222 INFO L443 ceAbstractionStarter]: For program point L528(lines 528 532) no Hoare annotation was computed. [2019-11-15 23:46:26,222 INFO L443 ceAbstractionStarter]: For program point L561-2(lines 561 565) no Hoare annotation was computed. [2019-11-15 23:46:26,223 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-11-15 23:46:26,223 INFO L443 ceAbstractionStarter]: For program point L528-2(lines 209 587) no Hoare annotation was computed. [2019-11-15 23:46:26,223 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-11-15 23:46:26,223 INFO L439 ceAbstractionStarter]: At program point L363(lines 346 381) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-15 23:46:26,223 INFO L443 ceAbstractionStarter]: For program point L264(line 264) no Hoare annotation was computed. [2019-11-15 23:46:26,223 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-11-15 23:46:26,223 INFO L443 ceAbstractionStarter]: For program point L264-1(line 264) no Hoare annotation was computed. [2019-11-15 23:46:26,224 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 593) no Hoare annotation was computed. [2019-11-15 23:46:26,224 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 604) no Hoare annotation was computed. [2019-11-15 23:46:26,224 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 615) no Hoare annotation was computed. [2019-11-15 23:46:26,224 INFO L439 ceAbstractionStarter]: At program point L99-2(lines 99 656) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse7 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse21 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse4 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse5) (and .cse6 .cse7 .cse1 .cse2 .cse5 .cse8) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse1 .cse5 .cse20)) (and .cse2 (and .cse17 .cse1 .cse5)) (and .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~s__state~0 8640) .cse8) (and .cse0 .cse9 .cse13 .cse14 .cse16 .cse1 .cse11 .cse17 .cse19 .cse21 .cse5 .cse20 .cse8) (and (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse10 .cse12 .cse15 .cse18) .cse6) (and .cse0 .cse3 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) .cse21 .cse4))) [2019-11-15 23:46:26,224 INFO L443 ceAbstractionStarter]: For program point L661(lines 661 665) no Hoare annotation was computed. [2019-11-15 23:46:26,225 INFO L443 ceAbstractionStarter]: For program point L628(lines 628 637) no Hoare annotation was computed. [2019-11-15 23:46:26,225 INFO L443 ceAbstractionStarter]: For program point L661-2(lines 661 665) no Hoare annotation was computed. [2019-11-15 23:46:26,225 INFO L443 ceAbstractionStarter]: For program point L628-2(lines 627 649) no Hoare annotation was computed. [2019-11-15 23:46:26,225 INFO L439 ceAbstractionStarter]: At program point L397(lines 388 419) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-15 23:46:26,225 INFO L439 ceAbstractionStarter]: At program point L166(lines 165 604) the Hoare annotation is: (let ((.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse2) (and .cse3 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse0 .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse3 .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse2))) [2019-11-15 23:46:26,226 INFO L439 ceAbstractionStarter]: At program point L133(lines 126 617) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2019-11-15 23:46:26,226 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-15 23:46:26,226 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-11-15 23:46:26,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:46:26 BoogieIcfgContainer [2019-11-15 23:46:26,262 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:46:26,263 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:46:26,263 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:46:26,263 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:46:26,264 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:45:56" (3/4) ... [2019-11-15 23:46:26,267 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:46:26,287 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 23:46:26,288 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:46:26,398 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_742c9572-99c1-4a1d-b36a-f154e55bb861/bin/uautomizer/witness.graphml [2019-11-15 23:46:26,399 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:46:26,400 INFO L168 Benchmark]: Toolchain (without parser) took 31630.65 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 1.0 GB). Free memory was 944.7 MB in the beginning and 1.6 GB in the end (delta: -622.4 MB). Peak memory consumption was 381.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:46:26,400 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:46:26,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -168.6 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:46:26,401 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.58 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 23:46:26,401 INFO L168 Benchmark]: Boogie Preprocessor took 42.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:46:26,402 INFO L168 Benchmark]: RCFGBuilder took 768.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: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:46:26,402 INFO L168 Benchmark]: TraceAbstraction took 30221.32 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 878.7 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -522.8 MB). Peak memory consumption was 919.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:46:26,402 INFO L168 Benchmark]: Witness Printer took 135.90 ms. Allocated memory is still 2.0 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:46:26,404 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 402.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -168.6 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.58 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 42.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 768.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: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30221.32 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 878.7 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -522.8 MB). Peak memory consumption was 919.8 MB. Max. memory is 11.5 GB. * Witness Printer took 135.90 ms. Allocated memory is still 2.0 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 502]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 502]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 502]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 262]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 262]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 502]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 676]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 2 && !(s__state == 8192)) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8195)) || (((((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195)) && !(0 == s__hit))) || ((((blastFlag <= 3 && !(s__state == 8192)) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8195)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((blastFlag <= 2 && !(s__state == 8192)) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8195)) || ((((blastFlag <= 3 && !(s__state == 8192)) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8195))) || (((((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195)) && !(0 == s__hit))) || (!(s__state == 8576) && ((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8195)) && !(s__state == 8480))) || (s__state <= 8448 && (!(s__state == 8448) && !(s__state == 8192)) && !(s__state == 8195))) || (((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && s__state == 8640) && !(0 == s__hit))) || ((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8192)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((8672 <= s__state && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 16384)) && blastFlag <= 3)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__state) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && s__state == 8640) && !(0 == s__hit)) || (((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 16384)) && !(s__state == 8576))) || (((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 16384)) && !(0 == s__hit)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && 8672 <= s__state) && !(s__state == 16384)) && !(s__state == 24576)) && !(s__state == 12292) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && !(s__state == 8576)) && s__state <= 8640) && 8576 <= s__state) || (((blastFlag <= 2 && s__state <= 8640) && 8576 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && !(s__state == 8576)) && s__state <= 8640) && 8576 <= s__state) || (((blastFlag <= 2 && s__state <= 8640) && 8576 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(s__state == 8576)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((blastFlag <= 2 && !(s__state == 8192)) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8195)) || ((((blastFlag <= 3 && !(s__state == 8192)) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8195))) || (((((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195)) && !(0 == s__hit))) || (!(s__state == 8576) && ((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8195)) && !(s__state == 8480))) || (s__state <= 8448 && (!(s__state == 8448) && !(s__state == 8192)) && !(s__state == 8195))) || (((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && s__state == 8640) && !(0 == s__hit))) || ((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8192)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((8672 <= s__state && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 16384)) && blastFlag <= 3)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__state) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 8576 <= s__state) && s__state <= 8640 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && ((((!(s__state == 8672) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 16384)) && !(0 == s__hit)) && 8640 <= s__state) || (((((((blastFlag <= 2 && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 16384)) && !(0 == s__hit))) || (((((((blastFlag <= 2 && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 16384)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 152 locations, 8 error locations. Result: SAFE, OverallTime: 30.1s, OverallIterations: 39, TraceHistogramMax: 14, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.3s, HoareTripleCheckerStatistics: 6928 SDtfs, 5885 SDslu, 3640 SDs, 0 SdLazy, 4372 SolverSat, 1144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1986 GetRequests, 1934 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4935occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 39 MinimizatonAttempts, 5661 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 264 NumberOfFragments, 1652 HoareAnnotationTreeSize, 29 FomulaSimplifications, 333708 FormulaSimplificationTreeSizeReduction, 2.8s HoareSimplificationTime, 29 FomulaSimplificationsInter, 71654 FormulaSimplificationTreeSizeReductionInter, 8.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 5670 NumberOfCodeBlocks, 5670 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 5627 ConstructedInterpolants, 0 QuantifiedInterpolants, 1665978 SizeOfPredicates, 13 NumberOfNonLiveVariables, 3554 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 43 InterpolantComputations, 35 PerfectInterpolantSequences, 10843/10891 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...