./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_3a.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_db68ee40-b0bf-4af4-9751-03dc1e6dd7a4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_db68ee40-b0bf-4af4-9751-03dc1e6dd7a4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_db68ee40-b0bf-4af4-9751-03dc1e6dd7a4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_db68ee40-b0bf-4af4-9751-03dc1e6dd7a4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_db68ee40-b0bf-4af4-9751-03dc1e6dd7a4/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_db68ee40-b0bf-4af4-9751-03dc1e6dd7a4/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 3c83e1c64d2af1ac92027e4b29fb95a984369de1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 21:33:20,733 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:33:20,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:33:20,747 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:33:20,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:33:20,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:33:20,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:33:20,752 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:33:20,754 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:33:20,759 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:33:20,760 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:33:20,761 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:33:20,761 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:33:20,762 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:33:20,763 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:33:20,764 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:33:20,765 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:33:20,766 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:33:20,768 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:33:20,770 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:33:20,771 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:33:20,773 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:33:20,774 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:33:20,774 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:33:20,777 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:33:20,777 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:33:20,778 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:33:20,779 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:33:20,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:33:20,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:33:20,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:33:20,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:33:20,781 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:33:20,782 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:33:20,783 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:33:20,783 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:33:20,784 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:33:20,784 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:33:20,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:33:20,787 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:33:20,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:33:20,788 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_db68ee40-b0bf-4af4-9751-03dc1e6dd7a4/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-15 21:33:20,801 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:33:20,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:33:20,804 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:33:20,805 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:33:20,807 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:33:20,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:33:20,809 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:33:20,809 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:33:20,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:33:20,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:33:20,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:33:20,811 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:33:20,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:33:20,812 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:33:20,812 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-15 21:33:20,812 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:33:20,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:33:20,812 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:33:20,813 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:33:20,813 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:33:20,813 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:33:20,813 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:33:20,813 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:33:20,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:33:20,814 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:33:20,815 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:33:20,815 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:33:20,815 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:33:20,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:33:20,815 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:33:20,816 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_db68ee40-b0bf-4af4-9751-03dc1e6dd7a4/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 -> 3c83e1c64d2af1ac92027e4b29fb95a984369de1 [2019-11-15 21:33:20,857 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:33:20,867 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:33:20,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:33:20,871 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:33:20,872 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:33:20,872 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_db68ee40-b0bf-4af4-9751-03dc1e6dd7a4/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c [2019-11-15 21:33:20,930 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_db68ee40-b0bf-4af4-9751-03dc1e6dd7a4/bin/uautomizer/data/c3ed1ad46/d06b4b7dd5ec4beea0e98340005d0d9d/FLAGcb8d799d3 [2019-11-15 21:33:21,404 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:33:21,415 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_db68ee40-b0bf-4af4-9751-03dc1e6dd7a4/sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c [2019-11-15 21:33:21,425 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_db68ee40-b0bf-4af4-9751-03dc1e6dd7a4/bin/uautomizer/data/c3ed1ad46/d06b4b7dd5ec4beea0e98340005d0d9d/FLAGcb8d799d3 [2019-11-15 21:33:21,438 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_db68ee40-b0bf-4af4-9751-03dc1e6dd7a4/bin/uautomizer/data/c3ed1ad46/d06b4b7dd5ec4beea0e98340005d0d9d [2019-11-15 21:33:21,441 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:33:21,443 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:33:21,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:33:21,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:33:21,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:33:21,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:33:21" (1/1) ... [2019-11-15 21:33:21,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c6a536c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:33:21, skipping insertion in model container [2019-11-15 21:33:21,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:33:21" (1/1) ... [2019-11-15 21:33:21,461 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:33:21,522 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:33:21,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:33:21,910 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:33:21,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:33:21,989 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:33:21,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:33:21 WrapperNode [2019-11-15 21:33:21,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:33:21,990 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:33:21,991 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:33:21,991 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:33:22,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:33:21" (1/1) ... [2019-11-15 21:33:22,010 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:33:21" (1/1) ... [2019-11-15 21:33:22,051 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:33:22,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:33:22,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:33:22,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:33:22,064 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:33:21" (1/1) ... [2019-11-15 21:33:22,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:33:21" (1/1) ... [2019-11-15 21:33:22,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:33:21" (1/1) ... [2019-11-15 21:33:22,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:33:21" (1/1) ... [2019-11-15 21:33:22,081 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:33:21" (1/1) ... [2019-11-15 21:33:22,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:33:21" (1/1) ... [2019-11-15 21:33:22,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:33:21" (1/1) ... [2019-11-15 21:33:22,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:33:22,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:33:22,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:33:22,106 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:33:22,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:33:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db68ee40-b0bf-4af4-9751-03dc1e6dd7a4/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:33:22,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:33:22,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:33:22,293 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:33:22,902 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-15 21:33:22,902 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-15 21:33:22,903 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:33:22,904 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 21:33:22,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:33:22 BoogieIcfgContainer [2019-11-15 21:33:22,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:33:22,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:33:22,906 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:33:22,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:33:22,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:33:21" (1/3) ... [2019-11-15 21:33:22,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b80d6e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:33:22, skipping insertion in model container [2019-11-15 21:33:22,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:33:21" (2/3) ... [2019-11-15 21:33:22,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b80d6e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:33:22, skipping insertion in model container [2019-11-15 21:33:22,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:33:22" (3/3) ... [2019-11-15 21:33:22,913 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a.BV.c.cil.c [2019-11-15 21:33:22,922 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:33:22,930 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-15 21:33:22,940 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-15 21:33:22,969 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:33:22,969 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:33:22,969 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:33:22,969 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:33:22,970 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:33:22,970 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:33:22,970 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:33:22,970 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:33:22,991 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-11-15 21:33:22,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 21:33:22,998 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:22,999 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:33:23,001 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:23,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:23,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1287811732, now seen corresponding path program 1 times [2019-11-15 21:33:23,015 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:23,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724347874] [2019-11-15 21:33:23,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:23,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:23,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:23,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:33:23,179 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724347874] [2019-11-15 21:33:23,179 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:23,179 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:33:23,180 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540871851] [2019-11-15 21:33:23,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:23,184 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:23,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:23,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:23,198 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 3 states. [2019-11-15 21:33:23,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:23,452 INFO L93 Difference]: Finished difference Result 323 states and 532 transitions. [2019-11-15 21:33:23,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:23,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-15 21:33:23,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:23,466 INFO L225 Difference]: With dead ends: 323 [2019-11-15 21:33:23,466 INFO L226 Difference]: Without dead ends: 155 [2019-11-15 21:33:23,470 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 21:33:23,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-15 21:33:23,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-11-15 21:33:23,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-15 21:33:23,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 230 transitions. [2019-11-15 21:33:23,515 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 230 transitions. Word has length 16 [2019-11-15 21:33:23,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:23,515 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 230 transitions. [2019-11-15 21:33:23,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:23,515 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 230 transitions. [2019-11-15 21:33:23,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 21:33:23,516 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:23,516 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 21:33:23,517 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:23,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:23,517 INFO L82 PathProgramCache]: Analyzing trace with hash 664085130, now seen corresponding path program 1 times [2019-11-15 21:33:23,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:23,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578437738] [2019-11-15 21:33:23,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:23,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:23,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:23,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:33:23,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578437738] [2019-11-15 21:33:23,565 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:23,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:33:23,565 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799190407] [2019-11-15 21:33:23,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:23,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:23,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:23,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:23,568 INFO L87 Difference]: Start difference. First operand 155 states and 230 transitions. Second operand 3 states. [2019-11-15 21:33:23,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:23,736 INFO L93 Difference]: Finished difference Result 313 states and 462 transitions. [2019-11-15 21:33:23,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:23,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-15 21:33:23,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:23,739 INFO L225 Difference]: With dead ends: 313 [2019-11-15 21:33:23,739 INFO L226 Difference]: Without dead ends: 165 [2019-11-15 21:33:23,740 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 21:33:23,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-15 21:33:23,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 156. [2019-11-15 21:33:23,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-15 21:33:23,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 231 transitions. [2019-11-15 21:33:23,763 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 231 transitions. Word has length 17 [2019-11-15 21:33:23,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:23,763 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 231 transitions. [2019-11-15 21:33:23,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:23,764 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 231 transitions. [2019-11-15 21:33:23,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 21:33:23,765 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:23,765 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 21:33:23,766 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:23,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:23,767 INFO L82 PathProgramCache]: Analyzing trace with hash 37329238, now seen corresponding path program 1 times [2019-11-15 21:33:23,767 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:23,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391135513] [2019-11-15 21:33:23,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:23,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:23,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:23,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:33:23,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391135513] [2019-11-15 21:33:23,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:23,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:33:23,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284273767] [2019-11-15 21:33:23,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:23,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:23,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:23,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:23,848 INFO L87 Difference]: Start difference. First operand 156 states and 231 transitions. Second operand 3 states. [2019-11-15 21:33:24,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:24,020 INFO L93 Difference]: Finished difference Result 315 states and 464 transitions. [2019-11-15 21:33:24,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:24,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-15 21:33:24,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:24,023 INFO L225 Difference]: With dead ends: 315 [2019-11-15 21:33:24,024 INFO L226 Difference]: Without dead ends: 166 [2019-11-15 21:33:24,025 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 21:33:24,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-15 21:33:24,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 157. [2019-11-15 21:33:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-15 21:33:24,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 232 transitions. [2019-11-15 21:33:24,053 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 232 transitions. Word has length 18 [2019-11-15 21:33:24,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:24,054 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 232 transitions. [2019-11-15 21:33:24,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:24,054 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 232 transitions. [2019-11-15 21:33:24,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 21:33:24,055 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:24,056 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 21:33:24,056 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:24,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:24,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1635395343, now seen corresponding path program 1 times [2019-11-15 21:33:24,057 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:24,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933323614] [2019-11-15 21:33:24,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:24,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:24,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:24,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:33:24,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933323614] [2019-11-15 21:33:24,120 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:24,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:33:24,121 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409862434] [2019-11-15 21:33:24,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:24,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:24,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:24,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:24,122 INFO L87 Difference]: Start difference. First operand 157 states and 232 transitions. Second operand 3 states. [2019-11-15 21:33:24,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:24,295 INFO L93 Difference]: Finished difference Result 317 states and 466 transitions. [2019-11-15 21:33:24,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:24,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-15 21:33:24,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:24,297 INFO L225 Difference]: With dead ends: 317 [2019-11-15 21:33:24,297 INFO L226 Difference]: Without dead ends: 167 [2019-11-15 21:33:24,299 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 21:33:24,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-15 21:33:24,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 158. [2019-11-15 21:33:24,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-15 21:33:24,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 233 transitions. [2019-11-15 21:33:24,311 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 233 transitions. Word has length 19 [2019-11-15 21:33:24,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:24,312 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 233 transitions. [2019-11-15 21:33:24,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 233 transitions. [2019-11-15 21:33:24,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 21:33:24,313 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:24,313 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 21:33:24,314 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:24,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:24,314 INFO L82 PathProgramCache]: Analyzing trace with hash -811500677, now seen corresponding path program 1 times [2019-11-15 21:33:24,315 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:24,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506678120] [2019-11-15 21:33:24,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:24,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:24,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:24,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:33:24,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506678120] [2019-11-15 21:33:24,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:24,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:33:24,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314196807] [2019-11-15 21:33:24,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:24,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:24,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:24,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:24,376 INFO L87 Difference]: Start difference. First operand 158 states and 233 transitions. Second operand 3 states. [2019-11-15 21:33:24,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:24,550 INFO L93 Difference]: Finished difference Result 319 states and 468 transitions. [2019-11-15 21:33:24,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:24,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-15 21:33:24,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:24,552 INFO L225 Difference]: With dead ends: 319 [2019-11-15 21:33:24,552 INFO L226 Difference]: Without dead ends: 168 [2019-11-15 21:33:24,553 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 21:33:24,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-15 21:33:24,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 159. [2019-11-15 21:33:24,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-15 21:33:24,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 234 transitions. [2019-11-15 21:33:24,568 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 234 transitions. Word has length 20 [2019-11-15 21:33:24,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:24,568 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 234 transitions. [2019-11-15 21:33:24,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:24,569 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 234 transitions. [2019-11-15 21:33:24,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 21:33:24,573 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:24,574 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 21:33:24,574 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:24,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:24,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1579118521, now seen corresponding path program 1 times [2019-11-15 21:33:24,574 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:24,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182325101] [2019-11-15 21:33:24,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:24,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:24,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:24,589 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 21:33:24,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1355664407] [2019-11-15 21:33:24,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db68ee40-b0bf-4af4-9751-03dc1e6dd7a4/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:24,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:33:24,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:33:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:33:24,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182325101] [2019-11-15 21:33:24,717 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 21:33:24,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355664407] [2019-11-15 21:33:24,718 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:24,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:33:24,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793793871] [2019-11-15 21:33:24,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:24,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:24,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:24,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:24,719 INFO L87 Difference]: Start difference. First operand 159 states and 234 transitions. Second operand 3 states. [2019-11-15 21:33:24,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:24,774 INFO L93 Difference]: Finished difference Result 455 states and 672 transitions. [2019-11-15 21:33:24,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:24,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-15 21:33:24,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:24,777 INFO L225 Difference]: With dead ends: 455 [2019-11-15 21:33:24,777 INFO L226 Difference]: Without dead ends: 303 [2019-11-15 21:33:24,778 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 21:33:24,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-11-15 21:33:24,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2019-11-15 21:33:24,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-11-15 21:33:24,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 446 transitions. [2019-11-15 21:33:24,802 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 446 transitions. Word has length 39 [2019-11-15 21:33:24,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:24,802 INFO L462 AbstractCegarLoop]: Abstraction has 299 states and 446 transitions. [2019-11-15 21:33:24,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:24,803 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 446 transitions. [2019-11-15 21:33:24,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 21:33:24,808 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:24,809 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 21:33:25,013 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:25,013 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:25,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:25,013 INFO L82 PathProgramCache]: Analyzing trace with hash 643824433, now seen corresponding path program 1 times [2019-11-15 21:33:25,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:25,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494023650] [2019-11-15 21:33:25,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:25,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:25,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:25,074 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 21:33:25,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494023650] [2019-11-15 21:33:25,075 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:25,075 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:33:25,076 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380620745] [2019-11-15 21:33:25,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:25,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:25,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:25,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:25,077 INFO L87 Difference]: Start difference. First operand 299 states and 446 transitions. Second operand 3 states. [2019-11-15 21:33:25,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:25,255 INFO L93 Difference]: Finished difference Result 653 states and 987 transitions. [2019-11-15 21:33:25,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:25,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-15 21:33:25,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:25,258 INFO L225 Difference]: With dead ends: 653 [2019-11-15 21:33:25,258 INFO L226 Difference]: Without dead ends: 361 [2019-11-15 21:33:25,259 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 21:33:25,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-15 21:33:25,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2019-11-15 21:33:25,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-15 21:33:25,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 550 transitions. [2019-11-15 21:33:25,280 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 550 transitions. Word has length 44 [2019-11-15 21:33:25,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:25,282 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 550 transitions. [2019-11-15 21:33:25,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:25,282 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 550 transitions. [2019-11-15 21:33:25,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 21:33:25,287 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:25,288 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 21:33:25,288 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:25,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:25,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1369957728, now seen corresponding path program 1 times [2019-11-15 21:33:25,289 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:25,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883221566] [2019-11-15 21:33:25,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:25,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:25,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:25,313 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 21:33:25,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1611069395] [2019-11-15 21:33:25,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db68ee40-b0bf-4af4-9751-03dc1e6dd7a4/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:25,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:33:25,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:33:25,395 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 21:33:25,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883221566] [2019-11-15 21:33:25,396 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 21:33:25,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611069395] [2019-11-15 21:33:25,397 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:25,397 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:33:25,397 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939393421] [2019-11-15 21:33:25,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:25,398 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:25,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:25,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:25,398 INFO L87 Difference]: Start difference. First operand 361 states and 550 transitions. Second operand 3 states. [2019-11-15 21:33:25,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:25,445 INFO L93 Difference]: Finished difference Result 719 states and 1092 transitions. [2019-11-15 21:33:25,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:25,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-15 21:33:25,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:25,449 INFO L225 Difference]: With dead ends: 719 [2019-11-15 21:33:25,449 INFO L226 Difference]: Without dead ends: 536 [2019-11-15 21:33:25,450 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 21:33:25,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-11-15 21:33:25,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 532. [2019-11-15 21:33:25,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-11-15 21:33:25,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 815 transitions. [2019-11-15 21:33:25,472 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 815 transitions. Word has length 55 [2019-11-15 21:33:25,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:25,472 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 815 transitions. [2019-11-15 21:33:25,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:25,473 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 815 transitions. [2019-11-15 21:33:25,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 21:33:25,475 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:25,475 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 21:33:25,678 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:25,679 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:25,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:25,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1405602907, now seen corresponding path program 1 times [2019-11-15 21:33:25,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:25,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001064511] [2019-11-15 21:33:25,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:25,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:25,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:25,741 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 21:33:25,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001064511] [2019-11-15 21:33:25,742 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:25,742 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:33:25,742 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301241582] [2019-11-15 21:33:25,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:25,743 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:25,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:25,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:25,743 INFO L87 Difference]: Start difference. First operand 532 states and 815 transitions. Second operand 3 states. [2019-11-15 21:33:25,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:25,907 INFO L93 Difference]: Finished difference Result 1111 states and 1694 transitions. [2019-11-15 21:33:25,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:25,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-15 21:33:25,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:25,912 INFO L225 Difference]: With dead ends: 1111 [2019-11-15 21:33:25,912 INFO L226 Difference]: Without dead ends: 586 [2019-11-15 21:33:25,913 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 21:33:25,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-15 21:33:25,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 580. [2019-11-15 21:33:25,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-11-15 21:33:25,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 878 transitions. [2019-11-15 21:33:25,936 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 878 transitions. Word has length 56 [2019-11-15 21:33:25,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:25,936 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 878 transitions. [2019-11-15 21:33:25,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:25,936 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 878 transitions. [2019-11-15 21:33:25,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 21:33:25,938 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:25,938 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 21:33:25,938 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:25,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:25,939 INFO L82 PathProgramCache]: Analyzing trace with hash -2147424561, now seen corresponding path program 1 times [2019-11-15 21:33:25,939 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:25,939 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940460890] [2019-11-15 21:33:25,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:25,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:25,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:25,966 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 21:33:25,967 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940460890] [2019-11-15 21:33:25,967 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:25,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:33:25,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416738808] [2019-11-15 21:33:25,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:25,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:25,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:25,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:25,968 INFO L87 Difference]: Start difference. First operand 580 states and 878 transitions. Second operand 3 states. [2019-11-15 21:33:26,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:26,116 INFO L93 Difference]: Finished difference Result 1162 states and 1757 transitions. [2019-11-15 21:33:26,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:26,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-15 21:33:26,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:26,120 INFO L225 Difference]: With dead ends: 1162 [2019-11-15 21:33:26,120 INFO L226 Difference]: Without dead ends: 589 [2019-11-15 21:33:26,121 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 21:33:26,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-11-15 21:33:26,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 583. [2019-11-15 21:33:26,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-11-15 21:33:26,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 878 transitions. [2019-11-15 21:33:26,144 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 878 transitions. Word has length 57 [2019-11-15 21:33:26,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:26,144 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 878 transitions. [2019-11-15 21:33:26,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:26,144 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 878 transitions. [2019-11-15 21:33:26,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 21:33:26,146 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:26,146 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 21:33:26,147 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:26,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:26,147 INFO L82 PathProgramCache]: Analyzing trace with hash -216125576, now seen corresponding path program 1 times [2019-11-15 21:33:26,147 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:26,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96575213] [2019-11-15 21:33:26,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:26,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:26,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:26,200 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 21:33:26,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96575213] [2019-11-15 21:33:26,201 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:26,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:33:26,201 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783810122] [2019-11-15 21:33:26,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:26,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:26,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:26,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:26,202 INFO L87 Difference]: Start difference. First operand 583 states and 878 transitions. Second operand 3 states. [2019-11-15 21:33:26,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:26,399 INFO L93 Difference]: Finished difference Result 1291 states and 1970 transitions. [2019-11-15 21:33:26,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:26,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-11-15 21:33:26,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:26,404 INFO L225 Difference]: With dead ends: 1291 [2019-11-15 21:33:26,404 INFO L226 Difference]: Without dead ends: 715 [2019-11-15 21:33:26,405 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 21:33:26,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-11-15 21:33:26,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 709. [2019-11-15 21:33:26,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2019-11-15 21:33:26,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1091 transitions. [2019-11-15 21:33:26,433 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1091 transitions. Word has length 70 [2019-11-15 21:33:26,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:26,434 INFO L462 AbstractCegarLoop]: Abstraction has 709 states and 1091 transitions. [2019-11-15 21:33:26,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:26,434 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1091 transitions. [2019-11-15 21:33:26,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 21:33:26,436 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:26,436 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 21:33:26,437 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:26,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:26,437 INFO L82 PathProgramCache]: Analyzing trace with hash 380295080, now seen corresponding path program 1 times [2019-11-15 21:33:26,437 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:26,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542800570] [2019-11-15 21:33:26,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:26,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:26,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:26,487 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 21:33:26,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542800570] [2019-11-15 21:33:26,489 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:26,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:33:26,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920032871] [2019-11-15 21:33:26,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:26,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:26,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:26,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:26,490 INFO L87 Difference]: Start difference. First operand 709 states and 1091 transitions. Second operand 3 states. [2019-11-15 21:33:26,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:26,700 INFO L93 Difference]: Finished difference Result 1513 states and 2336 transitions. [2019-11-15 21:33:26,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:26,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-15 21:33:26,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:26,706 INFO L225 Difference]: With dead ends: 1513 [2019-11-15 21:33:26,707 INFO L226 Difference]: Without dead ends: 811 [2019-11-15 21:33:26,709 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 21:33:26,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-11-15 21:33:26,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 790. [2019-11-15 21:33:26,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-15 21:33:26,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1211 transitions. [2019-11-15 21:33:26,739 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1211 transitions. Word has length 71 [2019-11-15 21:33:26,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:26,740 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1211 transitions. [2019-11-15 21:33:26,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:26,740 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1211 transitions. [2019-11-15 21:33:26,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 21:33:26,742 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:26,742 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 21:33:26,742 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:26,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:26,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1769518732, now seen corresponding path program 1 times [2019-11-15 21:33:26,743 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:26,743 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246186984] [2019-11-15 21:33:26,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:26,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:26,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:26,781 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 21:33:26,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246186984] [2019-11-15 21:33:26,782 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:26,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:33:26,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80695576] [2019-11-15 21:33:26,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:26,783 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:26,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:26,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:26,784 INFO L87 Difference]: Start difference. First operand 790 states and 1211 transitions. Second operand 3 states. [2019-11-15 21:33:26,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:26,976 INFO L93 Difference]: Finished difference Result 1582 states and 2423 transitions. [2019-11-15 21:33:26,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:26,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-15 21:33:26,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:26,981 INFO L225 Difference]: With dead ends: 1582 [2019-11-15 21:33:26,982 INFO L226 Difference]: Without dead ends: 799 [2019-11-15 21:33:26,983 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 21:33:26,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-11-15 21:33:27,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 793. [2019-11-15 21:33:27,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-11-15 21:33:27,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1211 transitions. [2019-11-15 21:33:27,018 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1211 transitions. Word has length 71 [2019-11-15 21:33:27,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:27,019 INFO L462 AbstractCegarLoop]: Abstraction has 793 states and 1211 transitions. [2019-11-15 21:33:27,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:27,019 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1211 transitions. [2019-11-15 21:33:27,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 21:33:27,026 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:27,026 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 21:33:27,026 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:27,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:27,027 INFO L82 PathProgramCache]: Analyzing trace with hash -953703820, now seen corresponding path program 1 times [2019-11-15 21:33:27,027 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:27,027 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517709449] [2019-11-15 21:33:27,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:27,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:27,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:27,061 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 21:33:27,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517709449] [2019-11-15 21:33:27,061 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:27,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:33:27,062 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671917773] [2019-11-15 21:33:27,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:27,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:27,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:27,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:27,063 INFO L87 Difference]: Start difference. First operand 793 states and 1211 transitions. Second operand 3 states. [2019-11-15 21:33:27,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:27,251 INFO L93 Difference]: Finished difference Result 1600 states and 2447 transitions. [2019-11-15 21:33:27,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:27,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-15 21:33:27,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:27,256 INFO L225 Difference]: With dead ends: 1600 [2019-11-15 21:33:27,256 INFO L226 Difference]: Without dead ends: 814 [2019-11-15 21:33:27,258 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 21:33:27,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2019-11-15 21:33:27,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 793. [2019-11-15 21:33:27,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-11-15 21:33:27,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1202 transitions. [2019-11-15 21:33:27,290 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1202 transitions. Word has length 72 [2019-11-15 21:33:27,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:27,290 INFO L462 AbstractCegarLoop]: Abstraction has 793 states and 1202 transitions. [2019-11-15 21:33:27,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:27,290 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1202 transitions. [2019-11-15 21:33:27,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 21:33:27,292 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:27,292 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 21:33:27,292 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:27,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:27,292 INFO L82 PathProgramCache]: Analyzing trace with hash -816065300, now seen corresponding path program 1 times [2019-11-15 21:33:27,293 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:27,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590797420] [2019-11-15 21:33:27,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:27,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:27,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:27,302 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 21:33:27,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [970680339] [2019-11-15 21:33:27,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db68ee40-b0bf-4af4-9751-03dc1e6dd7a4/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:27,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:33:27,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:33:27,394 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 21:33:27,395 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590797420] [2019-11-15 21:33:27,395 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 21:33:27,395 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970680339] [2019-11-15 21:33:27,395 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:27,395 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:33:27,396 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143703632] [2019-11-15 21:33:27,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:27,396 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:27,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:27,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:27,397 INFO L87 Difference]: Start difference. First operand 793 states and 1202 transitions. Second operand 3 states. [2019-11-15 21:33:27,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:27,454 INFO L93 Difference]: Finished difference Result 1583 states and 2396 transitions. [2019-11-15 21:33:27,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:27,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-11-15 21:33:27,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:27,461 INFO L225 Difference]: With dead ends: 1583 [2019-11-15 21:33:27,461 INFO L226 Difference]: Without dead ends: 1055 [2019-11-15 21:33:27,464 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 21:33:27,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2019-11-15 21:33:27,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1051. [2019-11-15 21:33:27,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2019-11-15 21:33:27,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1597 transitions. [2019-11-15 21:33:27,506 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1597 transitions. Word has length 76 [2019-11-15 21:33:27,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:27,507 INFO L462 AbstractCegarLoop]: Abstraction has 1051 states and 1597 transitions. [2019-11-15 21:33:27,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:27,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1597 transitions. [2019-11-15 21:33:27,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-15 21:33:27,509 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:27,509 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 21:33:27,723 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:27,724 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:27,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:27,724 INFO L82 PathProgramCache]: Analyzing trace with hash -174298828, now seen corresponding path program 1 times [2019-11-15 21:33:27,724 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:27,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332928663] [2019-11-15 21:33:27,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:27,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:27,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:27,759 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 21:33:27,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332928663] [2019-11-15 21:33:27,760 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:27,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:33:27,760 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169111288] [2019-11-15 21:33:27,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:27,761 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:27,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:27,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:27,761 INFO L87 Difference]: Start difference. First operand 1051 states and 1597 transitions. Second operand 3 states. [2019-11-15 21:33:27,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:27,966 INFO L93 Difference]: Finished difference Result 2279 states and 3475 transitions. [2019-11-15 21:33:27,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:27,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-15 21:33:27,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:27,974 INFO L225 Difference]: With dead ends: 2279 [2019-11-15 21:33:27,974 INFO L226 Difference]: Without dead ends: 1235 [2019-11-15 21:33:27,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 21:33:27,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-11-15 21:33:28,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1223. [2019-11-15 21:33:28,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-11-15 21:33:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1873 transitions. [2019-11-15 21:33:28,021 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1873 transitions. Word has length 86 [2019-11-15 21:33:28,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:28,022 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 1873 transitions. [2019-11-15 21:33:28,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:28,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1873 transitions. [2019-11-15 21:33:28,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 21:33:28,024 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:28,024 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 21:33:28,025 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:28,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:28,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1676680243, now seen corresponding path program 1 times [2019-11-15 21:33:28,025 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:28,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412536191] [2019-11-15 21:33:28,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:28,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:28,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:28,076 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 21:33:28,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412536191] [2019-11-15 21:33:28,077 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:28,077 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:33:28,077 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099835067] [2019-11-15 21:33:28,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:28,078 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:28,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:28,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:28,079 INFO L87 Difference]: Start difference. First operand 1223 states and 1873 transitions. Second operand 3 states. [2019-11-15 21:33:28,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:28,323 INFO L93 Difference]: Finished difference Result 2499 states and 3839 transitions. [2019-11-15 21:33:28,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:28,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-11-15 21:33:28,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:28,332 INFO L225 Difference]: With dead ends: 2499 [2019-11-15 21:33:28,332 INFO L226 Difference]: Without dead ends: 1275 [2019-11-15 21:33:28,336 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 21:33:28,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2019-11-15 21:33:28,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1263. [2019-11-15 21:33:28,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1263 states. [2019-11-15 21:33:28,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1949 transitions. [2019-11-15 21:33:28,377 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1949 transitions. Word has length 87 [2019-11-15 21:33:28,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:28,377 INFO L462 AbstractCegarLoop]: Abstraction has 1263 states and 1949 transitions. [2019-11-15 21:33:28,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:28,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1949 transitions. [2019-11-15 21:33:28,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 21:33:28,380 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:28,380 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 21:33:28,380 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:28,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:28,381 INFO L82 PathProgramCache]: Analyzing trace with hash 538835484, now seen corresponding path program 1 times [2019-11-15 21:33:28,381 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:28,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546215417] [2019-11-15 21:33:28,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:28,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:28,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:28,427 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 21:33:28,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546215417] [2019-11-15 21:33:28,428 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:28,428 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:33:28,428 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190866261] [2019-11-15 21:33:28,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:28,429 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:28,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:28,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:28,429 INFO L87 Difference]: Start difference. First operand 1263 states and 1949 transitions. Second operand 3 states. [2019-11-15 21:33:28,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:28,598 INFO L93 Difference]: Finished difference Result 2667 states and 4123 transitions. [2019-11-15 21:33:28,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:28,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-15 21:33:28,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:28,607 INFO L225 Difference]: With dead ends: 2667 [2019-11-15 21:33:28,607 INFO L226 Difference]: Without dead ends: 1411 [2019-11-15 21:33:28,609 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 21:33:28,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2019-11-15 21:33:28,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1363. [2019-11-15 21:33:28,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-15 21:33:28,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2085 transitions. [2019-11-15 21:33:28,657 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2085 transitions. Word has length 97 [2019-11-15 21:33:28,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:28,657 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 2085 transitions. [2019-11-15 21:33:28,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:28,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2085 transitions. [2019-11-15 21:33:28,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 21:33:28,659 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:28,659 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 21:33:28,660 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:28,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:28,660 INFO L82 PathProgramCache]: Analyzing trace with hash 704331080, now seen corresponding path program 1 times [2019-11-15 21:33:28,660 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:28,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887304188] [2019-11-15 21:33:28,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:28,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:28,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:28,694 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 21:33:28,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887304188] [2019-11-15 21:33:28,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:28,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:33:28,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5461253] [2019-11-15 21:33:28,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:28,696 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:28,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:28,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:28,696 INFO L87 Difference]: Start difference. First operand 1363 states and 2085 transitions. Second operand 3 states. [2019-11-15 21:33:28,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:28,869 INFO L93 Difference]: Finished difference Result 2767 states and 4239 transitions. [2019-11-15 21:33:28,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:28,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-15 21:33:28,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:28,877 INFO L225 Difference]: With dead ends: 2767 [2019-11-15 21:33:28,878 INFO L226 Difference]: Without dead ends: 1411 [2019-11-15 21:33:28,879 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 21:33:28,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2019-11-15 21:33:28,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1363. [2019-11-15 21:33:28,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-15 21:33:28,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2065 transitions. [2019-11-15 21:33:28,929 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2065 transitions. Word has length 98 [2019-11-15 21:33:28,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:28,929 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 2065 transitions. [2019-11-15 21:33:28,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:28,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2065 transitions. [2019-11-15 21:33:28,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-15 21:33:28,934 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:28,934 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 21:33:28,935 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:28,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:28,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1454055914, now seen corresponding path program 1 times [2019-11-15 21:33:28,935 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:28,939 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278283250] [2019-11-15 21:33:28,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:28,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:28,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:28,951 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 21:33:28,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1841818539] [2019-11-15 21:33:28,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db68ee40-b0bf-4af4-9751-03dc1e6dd7a4/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:29,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:33:29,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:33:29,071 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 21:33:29,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278283250] [2019-11-15 21:33:29,071 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 21:33:29,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841818539] [2019-11-15 21:33:29,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:29,072 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:33:29,072 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426446793] [2019-11-15 21:33:29,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:29,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:29,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:29,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:29,073 INFO L87 Difference]: Start difference. First operand 1363 states and 2065 transitions. Second operand 3 states. [2019-11-15 21:33:29,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:29,280 INFO L93 Difference]: Finished difference Result 2755 states and 4163 transitions. [2019-11-15 21:33:29,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:29,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-11-15 21:33:29,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:29,288 INFO L225 Difference]: With dead ends: 2755 [2019-11-15 21:33:29,288 INFO L226 Difference]: Without dead ends: 1399 [2019-11-15 21:33:29,290 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 21:33:29,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2019-11-15 21:33:29,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1363. [2019-11-15 21:33:29,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-15 21:33:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1993 transitions. [2019-11-15 21:33:29,363 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1993 transitions. Word has length 116 [2019-11-15 21:33:29,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:29,363 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 1993 transitions. [2019-11-15 21:33:29,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:29,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1993 transitions. [2019-11-15 21:33:29,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-15 21:33:29,366 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:29,366 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 21:33:29,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:29,570 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:29,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:29,570 INFO L82 PathProgramCache]: Analyzing trace with hash 2083865546, now seen corresponding path program 1 times [2019-11-15 21:33:29,570 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:29,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059121227] [2019-11-15 21:33:29,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:29,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:29,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:29,600 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 21:33:29,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059121227] [2019-11-15 21:33:29,601 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:29,601 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:33:29,601 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013893717] [2019-11-15 21:33:29,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:29,602 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:29,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:29,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:29,602 INFO L87 Difference]: Start difference. First operand 1363 states and 1993 transitions. Second operand 3 states. [2019-11-15 21:33:29,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:29,776 INFO L93 Difference]: Finished difference Result 2827 states and 4135 transitions. [2019-11-15 21:33:29,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:29,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-11-15 21:33:29,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:29,785 INFO L225 Difference]: With dead ends: 2827 [2019-11-15 21:33:29,785 INFO L226 Difference]: Without dead ends: 1471 [2019-11-15 21:33:29,787 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 21:33:29,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2019-11-15 21:33:29,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1459. [2019-11-15 21:33:29,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2019-11-15 21:33:29,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2117 transitions. [2019-11-15 21:33:29,838 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2117 transitions. Word has length 117 [2019-11-15 21:33:29,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:29,838 INFO L462 AbstractCegarLoop]: Abstraction has 1459 states and 2117 transitions. [2019-11-15 21:33:29,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:29,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2117 transitions. [2019-11-15 21:33:29,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-15 21:33:29,841 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:29,841 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 21:33:29,841 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:29,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:29,842 INFO L82 PathProgramCache]: Analyzing trace with hash -63631274, now seen corresponding path program 1 times [2019-11-15 21:33:29,842 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:29,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104345089] [2019-11-15 21:33:29,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:29,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:29,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:29,872 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 21:33:29,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104345089] [2019-11-15 21:33:29,872 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:29,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:33:29,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312196236] [2019-11-15 21:33:29,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:29,873 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:29,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:29,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:29,874 INFO L87 Difference]: Start difference. First operand 1459 states and 2117 transitions. Second operand 3 states. [2019-11-15 21:33:30,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:30,055 INFO L93 Difference]: Finished difference Result 2923 states and 4239 transitions. [2019-11-15 21:33:30,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:30,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-11-15 21:33:30,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:30,064 INFO L225 Difference]: With dead ends: 2923 [2019-11-15 21:33:30,064 INFO L226 Difference]: Without dead ends: 1471 [2019-11-15 21:33:30,066 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 21:33:30,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2019-11-15 21:33:30,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1459. [2019-11-15 21:33:30,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2019-11-15 21:33:30,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2097 transitions. [2019-11-15 21:33:30,120 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2097 transitions. Word has length 118 [2019-11-15 21:33:30,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:30,121 INFO L462 AbstractCegarLoop]: Abstraction has 1459 states and 2097 transitions. [2019-11-15 21:33:30,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:30,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2097 transitions. [2019-11-15 21:33:30,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-15 21:33:30,123 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:30,124 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 21:33:30,124 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:30,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:30,124 INFO L82 PathProgramCache]: Analyzing trace with hash 365233416, now seen corresponding path program 1 times [2019-11-15 21:33:30,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:30,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645046037] [2019-11-15 21:33:30,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:30,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:30,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:30,163 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 21:33:30,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645046037] [2019-11-15 21:33:30,164 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:30,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:33:30,164 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890960747] [2019-11-15 21:33:30,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:30,165 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:30,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:30,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:30,165 INFO L87 Difference]: Start difference. First operand 1459 states and 2097 transitions. Second operand 3 states. [2019-11-15 21:33:30,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:30,373 INFO L93 Difference]: Finished difference Result 3091 states and 4445 transitions. [2019-11-15 21:33:30,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:30,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-11-15 21:33:30,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:30,384 INFO L225 Difference]: With dead ends: 3091 [2019-11-15 21:33:30,384 INFO L226 Difference]: Without dead ends: 1639 [2019-11-15 21:33:30,386 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 21:33:30,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2019-11-15 21:33:30,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1623. [2019-11-15 21:33:30,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2019-11-15 21:33:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2337 transitions. [2019-11-15 21:33:30,446 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2337 transitions. Word has length 126 [2019-11-15 21:33:30,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:30,447 INFO L462 AbstractCegarLoop]: Abstraction has 1623 states and 2337 transitions. [2019-11-15 21:33:30,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:30,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2337 transitions. [2019-11-15 21:33:30,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-15 21:33:30,450 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:30,450 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 21:33:30,450 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:30,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:30,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1493527041, now seen corresponding path program 1 times [2019-11-15 21:33:30,451 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:30,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623653000] [2019-11-15 21:33:30,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:30,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:30,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:30,489 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 21:33:30,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623653000] [2019-11-15 21:33:30,489 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:30,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:33:30,490 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814087213] [2019-11-15 21:33:30,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:30,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:30,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:30,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:30,491 INFO L87 Difference]: Start difference. First operand 1623 states and 2337 transitions. Second operand 3 states. [2019-11-15 21:33:30,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:30,715 INFO L93 Difference]: Finished difference Result 3255 states and 4681 transitions. [2019-11-15 21:33:30,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:30,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-15 21:33:30,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:30,725 INFO L225 Difference]: With dead ends: 3255 [2019-11-15 21:33:30,726 INFO L226 Difference]: Without dead ends: 1631 [2019-11-15 21:33:30,728 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 21:33:30,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-11-15 21:33:30,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1615. [2019-11-15 21:33:30,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1615 states. [2019-11-15 21:33:30,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2321 transitions. [2019-11-15 21:33:30,823 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2321 transitions. Word has length 127 [2019-11-15 21:33:30,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:30,823 INFO L462 AbstractCegarLoop]: Abstraction has 1615 states and 2321 transitions. [2019-11-15 21:33:30,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:30,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2321 transitions. [2019-11-15 21:33:30,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-15 21:33:30,826 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:30,826 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 21:33:30,827 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:30,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:30,827 INFO L82 PathProgramCache]: Analyzing trace with hash 704603328, now seen corresponding path program 1 times [2019-11-15 21:33:30,827 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:30,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871486178] [2019-11-15 21:33:30,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:30,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:30,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:30,862 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 21:33:30,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871486178] [2019-11-15 21:33:30,862 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:30,862 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:33:30,863 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462899533] [2019-11-15 21:33:30,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:30,863 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:30,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:30,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:30,864 INFO L87 Difference]: Start difference. First operand 1615 states and 2321 transitions. Second operand 3 states. [2019-11-15 21:33:31,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:31,049 INFO L93 Difference]: Finished difference Result 3323 states and 4778 transitions. [2019-11-15 21:33:31,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:31,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-11-15 21:33:31,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:31,059 INFO L225 Difference]: With dead ends: 3323 [2019-11-15 21:33:31,059 INFO L226 Difference]: Without dead ends: 1715 [2019-11-15 21:33:31,061 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 21:33:31,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2019-11-15 21:33:31,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1699. [2019-11-15 21:33:31,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-11-15 21:33:31,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2417 transitions. [2019-11-15 21:33:31,122 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2417 transitions. Word has length 138 [2019-11-15 21:33:31,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:31,122 INFO L462 AbstractCegarLoop]: Abstraction has 1699 states and 2417 transitions. [2019-11-15 21:33:31,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:31,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2417 transitions. [2019-11-15 21:33:31,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-15 21:33:31,125 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:31,126 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 21:33:31,126 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:31,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:31,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1658127444, now seen corresponding path program 1 times [2019-11-15 21:33:31,127 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:31,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880873785] [2019-11-15 21:33:31,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:31,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:31,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:31,166 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 21:33:31,166 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880873785] [2019-11-15 21:33:31,166 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:31,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:33:31,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204742379] [2019-11-15 21:33:31,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:31,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:31,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:31,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:31,169 INFO L87 Difference]: Start difference. First operand 1699 states and 2417 transitions. Second operand 3 states. [2019-11-15 21:33:31,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:31,373 INFO L93 Difference]: Finished difference Result 3407 states and 4846 transitions. [2019-11-15 21:33:31,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:31,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-11-15 21:33:31,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:31,384 INFO L225 Difference]: With dead ends: 3407 [2019-11-15 21:33:31,384 INFO L226 Difference]: Without dead ends: 1715 [2019-11-15 21:33:31,387 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 21:33:31,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2019-11-15 21:33:31,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1699. [2019-11-15 21:33:31,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-11-15 21:33:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2389 transitions. [2019-11-15 21:33:31,449 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2389 transitions. Word has length 139 [2019-11-15 21:33:31,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:31,450 INFO L462 AbstractCegarLoop]: Abstraction has 1699 states and 2389 transitions. [2019-11-15 21:33:31,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:31,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2389 transitions. [2019-11-15 21:33:31,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-15 21:33:31,453 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:31,454 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 21:33:31,454 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:31,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:31,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1163594683, now seen corresponding path program 1 times [2019-11-15 21:33:31,455 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:31,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049403214] [2019-11-15 21:33:31,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:31,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:31,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:31,503 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 21:33:31,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049403214] [2019-11-15 21:33:31,503 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:31,504 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:33:31,504 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506822569] [2019-11-15 21:33:31,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:31,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:31,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:31,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:31,505 INFO L87 Difference]: Start difference. First operand 1699 states and 2389 transitions. Second operand 3 states. [2019-11-15 21:33:31,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:31,577 INFO L93 Difference]: Finished difference Result 3373 states and 4735 transitions. [2019-11-15 21:33:31,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:31,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-15 21:33:31,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:31,600 INFO L225 Difference]: With dead ends: 3373 [2019-11-15 21:33:31,601 INFO L226 Difference]: Without dead ends: 1681 [2019-11-15 21:33:31,603 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 21:33:31,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2019-11-15 21:33:31,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1677. [2019-11-15 21:33:31,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1677 states. [2019-11-15 21:33:31,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2356 transitions. [2019-11-15 21:33:31,666 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2356 transitions. Word has length 154 [2019-11-15 21:33:31,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:31,666 INFO L462 AbstractCegarLoop]: Abstraction has 1677 states and 2356 transitions. [2019-11-15 21:33:31,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:31,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2356 transitions. [2019-11-15 21:33:31,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-15 21:33:31,670 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:31,670 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 21:33:31,671 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:31,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:31,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1358544773, now seen corresponding path program 1 times [2019-11-15 21:33:31,671 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:31,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804297112] [2019-11-15 21:33:31,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:31,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:31,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:31,726 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 21:33:31,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804297112] [2019-11-15 21:33:31,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837208344] [2019-11-15 21:33:31,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db68ee40-b0bf-4af4-9751-03dc1e6dd7a4/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:31,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:33:31,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:33:31,866 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 21:33:31,867 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:33:31,867 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 21:33:31,867 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377400198] [2019-11-15 21:33:31,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:33:31,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:31,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:33:31,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:33:31,868 INFO L87 Difference]: Start difference. First operand 1677 states and 2356 transitions. Second operand 4 states. [2019-11-15 21:33:32,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:32,332 INFO L93 Difference]: Finished difference Result 5291 states and 7422 transitions. [2019-11-15 21:33:32,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:33:32,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-15 21:33:32,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:32,340 INFO L225 Difference]: With dead ends: 5291 [2019-11-15 21:33:32,340 INFO L226 Difference]: Without dead ends: 3521 [2019-11-15 21:33:32,343 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 21:33:32,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3521 states. [2019-11-15 21:33:32,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3521 to 2065. [2019-11-15 21:33:32,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2065 states. [2019-11-15 21:33:32,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 2065 states and 2916 transitions. [2019-11-15 21:33:32,420 INFO L78 Accepts]: Start accepts. Automaton has 2065 states and 2916 transitions. Word has length 154 [2019-11-15 21:33:32,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:32,420 INFO L462 AbstractCegarLoop]: Abstraction has 2065 states and 2916 transitions. [2019-11-15 21:33:32,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:33:32,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 2916 transitions. [2019-11-15 21:33:32,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-15 21:33:32,424 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:32,424 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 21:33:32,628 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:32,628 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:32,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:32,628 INFO L82 PathProgramCache]: Analyzing trace with hash 782353573, now seen corresponding path program 1 times [2019-11-15 21:33:32,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:32,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384133999] [2019-11-15 21:33:32,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:32,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:32,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:32,683 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 21:33:32,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384133999] [2019-11-15 21:33:32,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554550592] [2019-11-15 21:33:32,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db68ee40-b0bf-4af4-9751-03dc1e6dd7a4/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:32,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:33:32,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:33:32,791 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 21:33:32,792 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:33:32,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 21:33:32,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715729609] [2019-11-15 21:33:32,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:33:32,793 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:32,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:33:32,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:33:32,793 INFO L87 Difference]: Start difference. First operand 2065 states and 2916 transitions. Second operand 4 states. [2019-11-15 21:33:33,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:33,224 INFO L93 Difference]: Finished difference Result 5632 states and 7889 transitions. [2019-11-15 21:33:33,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:33:33,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-15 21:33:33,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:33,232 INFO L225 Difference]: With dead ends: 5632 [2019-11-15 21:33:33,232 INFO L226 Difference]: Without dead ends: 3574 [2019-11-15 21:33:33,235 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 21:33:33,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3574 states. [2019-11-15 21:33:33,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3574 to 2575. [2019-11-15 21:33:33,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2575 states. [2019-11-15 21:33:33,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2575 states to 2575 states and 3493 transitions. [2019-11-15 21:33:33,325 INFO L78 Accepts]: Start accepts. Automaton has 2575 states and 3493 transitions. Word has length 156 [2019-11-15 21:33:33,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:33,326 INFO L462 AbstractCegarLoop]: Abstraction has 2575 states and 3493 transitions. [2019-11-15 21:33:33,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:33:33,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2575 states and 3493 transitions. [2019-11-15 21:33:33,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-15 21:33:33,331 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:33,332 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 21:33:33,536 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:33,537 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:33,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:33,537 INFO L82 PathProgramCache]: Analyzing trace with hash -571340489, now seen corresponding path program 1 times [2019-11-15 21:33:33,537 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:33,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298245597] [2019-11-15 21:33:33,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:33,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:33,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:33,641 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 21:33:33,642 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298245597] [2019-11-15 21:33:33,642 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143779174] [2019-11-15 21:33:33,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db68ee40-b0bf-4af4-9751-03dc1e6dd7a4/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:33,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:33:33,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:33:33,794 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 21:33:33,795 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:33:33,795 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 21:33:33,795 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697101536] [2019-11-15 21:33:33,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:33:33,796 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:33,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:33:33,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:33:33,797 INFO L87 Difference]: Start difference. First operand 2575 states and 3493 transitions. Second operand 4 states. [2019-11-15 21:33:34,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:34,199 INFO L93 Difference]: Finished difference Result 5967 states and 8033 transitions. [2019-11-15 21:33:34,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:33:34,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-15 21:33:34,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:34,206 INFO L225 Difference]: With dead ends: 5967 [2019-11-15 21:33:34,206 INFO L226 Difference]: Without dead ends: 3371 [2019-11-15 21:33:34,210 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 21:33:34,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states. [2019-11-15 21:33:34,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 2281. [2019-11-15 21:33:34,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2019-11-15 21:33:34,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 3072 transitions. [2019-11-15 21:33:34,289 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 3072 transitions. Word has length 163 [2019-11-15 21:33:34,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:34,289 INFO L462 AbstractCegarLoop]: Abstraction has 2281 states and 3072 transitions. [2019-11-15 21:33:34,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:33:34,290 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 3072 transitions. [2019-11-15 21:33:34,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-15 21:33:34,294 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:34,294 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 21:33:34,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:34,503 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:34,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:34,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2030054557, now seen corresponding path program 1 times [2019-11-15 21:33:34,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:34,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791295784] [2019-11-15 21:33:34,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:34,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:34,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:34,569 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 21:33:34,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791295784] [2019-11-15 21:33:34,569 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:34,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:33:34,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18639050] [2019-11-15 21:33:34,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:34,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:34,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:34,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:34,571 INFO L87 Difference]: Start difference. First operand 2281 states and 3072 transitions. Second operand 3 states. [2019-11-15 21:33:34,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:34,658 INFO L93 Difference]: Finished difference Result 5499 states and 7335 transitions. [2019-11-15 21:33:34,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:34,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-11-15 21:33:34,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:34,664 INFO L225 Difference]: With dead ends: 5499 [2019-11-15 21:33:34,664 INFO L226 Difference]: Without dead ends: 3225 [2019-11-15 21:33:34,668 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:34,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3225 states. [2019-11-15 21:33:34,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3225 to 3221. [2019-11-15 21:33:34,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3221 states. [2019-11-15 21:33:34,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3221 states to 3221 states and 4261 transitions. [2019-11-15 21:33:34,767 INFO L78 Accepts]: Start accepts. Automaton has 3221 states and 4261 transitions. Word has length 165 [2019-11-15 21:33:34,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:34,767 INFO L462 AbstractCegarLoop]: Abstraction has 3221 states and 4261 transitions. [2019-11-15 21:33:34,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:34,768 INFO L276 IsEmpty]: Start isEmpty. Operand 3221 states and 4261 transitions. [2019-11-15 21:33:34,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-15 21:33:34,773 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:34,773 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 21:33:34,777 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:34,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:34,778 INFO L82 PathProgramCache]: Analyzing trace with hash -36905074, now seen corresponding path program 1 times [2019-11-15 21:33:34,778 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:34,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957339122] [2019-11-15 21:33:34,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:34,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:34,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:34,793 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 21:33:34,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1047461320] [2019-11-15 21:33:34,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db68ee40-b0bf-4af4-9751-03dc1e6dd7a4/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:34,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:33:34,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:33:34,927 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 21:33:34,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957339122] [2019-11-15 21:33:34,927 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 21:33:34,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047461320] [2019-11-15 21:33:34,928 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:34,928 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:33:34,928 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199685750] [2019-11-15 21:33:34,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:33:34,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:34,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:33:34,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:33:34,930 INFO L87 Difference]: Start difference. First operand 3221 states and 4261 transitions. Second operand 4 states. [2019-11-15 21:33:35,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:35,229 INFO L93 Difference]: Finished difference Result 4906 states and 6379 transitions. [2019-11-15 21:33:35,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:33:35,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-11-15 21:33:35,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:35,241 INFO L225 Difference]: With dead ends: 4906 [2019-11-15 21:33:35,241 INFO L226 Difference]: Without dead ends: 4096 [2019-11-15 21:33:35,242 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 21:33:35,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4096 states. [2019-11-15 21:33:35,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4096 to 3918. [2019-11-15 21:33:35,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3918 states. [2019-11-15 21:33:35,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3918 states to 3918 states and 5142 transitions. [2019-11-15 21:33:35,362 INFO L78 Accepts]: Start accepts. Automaton has 3918 states and 5142 transitions. Word has length 186 [2019-11-15 21:33:35,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:35,363 INFO L462 AbstractCegarLoop]: Abstraction has 3918 states and 5142 transitions. [2019-11-15 21:33:35,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:33:35,363 INFO L276 IsEmpty]: Start isEmpty. Operand 3918 states and 5142 transitions. [2019-11-15 21:33:35,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-15 21:33:35,369 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:35,369 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 21:33:35,573 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:35,573 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:35,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:35,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1106021424, now seen corresponding path program 1 times [2019-11-15 21:33:35,574 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:35,574 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109611840] [2019-11-15 21:33:35,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:35,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:35,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:35,591 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 21:33:35,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1380329941] [2019-11-15 21:33:35,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db68ee40-b0bf-4af4-9751-03dc1e6dd7a4/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:35,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:33:35,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:33:35,767 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 21:33:35,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109611840] [2019-11-15 21:33:35,768 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 21:33:35,768 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380329941] [2019-11-15 21:33:35,768 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:35,768 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:33:35,768 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423320931] [2019-11-15 21:33:35,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:33:35,769 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:35,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:33:35,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:33:35,771 INFO L87 Difference]: Start difference. First operand 3918 states and 5142 transitions. Second operand 5 states. [2019-11-15 21:33:36,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:36,197 INFO L93 Difference]: Finished difference Result 5803 states and 7575 transitions. [2019-11-15 21:33:36,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:33:36,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 188 [2019-11-15 21:33:36,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:36,207 INFO L225 Difference]: With dead ends: 5803 [2019-11-15 21:33:36,207 INFO L226 Difference]: Without dead ends: 5802 [2019-11-15 21:33:36,209 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 21:33:36,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5802 states. [2019-11-15 21:33:36,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5802 to 5243. [2019-11-15 21:33:36,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5243 states. [2019-11-15 21:33:36,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5243 states to 5243 states and 6898 transitions. [2019-11-15 21:33:36,371 INFO L78 Accepts]: Start accepts. Automaton has 5243 states and 6898 transitions. Word has length 188 [2019-11-15 21:33:36,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:36,371 INFO L462 AbstractCegarLoop]: Abstraction has 5243 states and 6898 transitions. [2019-11-15 21:33:36,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:33:36,371 INFO L276 IsEmpty]: Start isEmpty. Operand 5243 states and 6898 transitions. [2019-11-15 21:33:36,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-15 21:33:36,377 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:36,378 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 21:33:36,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:36,583 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:36,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:36,583 INFO L82 PathProgramCache]: Analyzing trace with hash 73074738, now seen corresponding path program 1 times [2019-11-15 21:33:36,584 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:36,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674968390] [2019-11-15 21:33:36,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:36,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:36,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:36,596 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 21:33:36,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1141778402] [2019-11-15 21:33:36,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db68ee40-b0bf-4af4-9751-03dc1e6dd7a4/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:36,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:33:36,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:33:36,846 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 20 [2019-11-15 21:33:36,887 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 21:33:36,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674968390] [2019-11-15 21:33:36,887 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 21:33:36,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141778402] [2019-11-15 21:33:36,888 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:36,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:33:36,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304884151] [2019-11-15 21:33:36,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:33:36,889 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:36,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:33:36,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:33:36,889 INFO L87 Difference]: Start difference. First operand 5243 states and 6898 transitions. Second operand 4 states. [2019-11-15 21:33:37,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:37,382 INFO L93 Difference]: Finished difference Result 9754 states and 12848 transitions. [2019-11-15 21:33:37,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:33:37,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-11-15 21:33:37,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:37,390 INFO L225 Difference]: With dead ends: 9754 [2019-11-15 21:33:37,390 INFO L226 Difference]: Without dead ends: 5296 [2019-11-15 21:33:37,394 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:33:37,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5296 states. [2019-11-15 21:33:37,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5296 to 5242. [2019-11-15 21:33:37,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5242 states. [2019-11-15 21:33:37,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5242 states to 5242 states and 6881 transitions. [2019-11-15 21:33:37,618 INFO L78 Accepts]: Start accepts. Automaton has 5242 states and 6881 transitions. Word has length 189 [2019-11-15 21:33:37,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:37,619 INFO L462 AbstractCegarLoop]: Abstraction has 5242 states and 6881 transitions. [2019-11-15 21:33:37,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:33:37,619 INFO L276 IsEmpty]: Start isEmpty. Operand 5242 states and 6881 transitions. [2019-11-15 21:33:37,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-11-15 21:33:37,626 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:37,626 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 21:33:37,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:37,831 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:37,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:37,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1864895527, now seen corresponding path program 1 times [2019-11-15 21:33:37,831 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:37,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212152443] [2019-11-15 21:33:37,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:37,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:37,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:37,843 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 21:33:37,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1385185830] [2019-11-15 21:33:37,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db68ee40-b0bf-4af4-9751-03dc1e6dd7a4/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:37,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:33:37,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:33:37,975 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 21:33:37,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212152443] [2019-11-15 21:33:37,975 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 21:33:37,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385185830] [2019-11-15 21:33:37,976 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:37,976 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:33:37,976 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187167725] [2019-11-15 21:33:37,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:37,977 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:37,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:37,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:37,977 INFO L87 Difference]: Start difference. First operand 5242 states and 6881 transitions. Second operand 3 states. [2019-11-15 21:33:38,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:38,231 INFO L93 Difference]: Finished difference Result 10421 states and 13665 transitions. [2019-11-15 21:33:38,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:38,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-11-15 21:33:38,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:38,238 INFO L225 Difference]: With dead ends: 10421 [2019-11-15 21:33:38,238 INFO L226 Difference]: Without dead ends: 3596 [2019-11-15 21:33:38,245 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 21:33:38,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3596 states. [2019-11-15 21:33:38,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3596 to 3587. [2019-11-15 21:33:38,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3587 states. [2019-11-15 21:33:38,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3587 states to 3587 states and 4675 transitions. [2019-11-15 21:33:38,351 INFO L78 Accepts]: Start accepts. Automaton has 3587 states and 4675 transitions. Word has length 196 [2019-11-15 21:33:38,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:38,352 INFO L462 AbstractCegarLoop]: Abstraction has 3587 states and 4675 transitions. [2019-11-15 21:33:38,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:38,352 INFO L276 IsEmpty]: Start isEmpty. Operand 3587 states and 4675 transitions. [2019-11-15 21:33:38,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-15 21:33:38,356 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:38,357 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 21:33:38,560 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:38,561 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:38,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:38,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1327391442, now seen corresponding path program 1 times [2019-11-15 21:33:38,561 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:38,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156274565] [2019-11-15 21:33:38,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:38,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:38,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:38,616 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 21:33:38,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156274565] [2019-11-15 21:33:38,617 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:38,617 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:33:38,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831422537] [2019-11-15 21:33:38,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:38,618 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:38,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:38,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:38,620 INFO L87 Difference]: Start difference. First operand 3587 states and 4675 transitions. Second operand 3 states. [2019-11-15 21:33:38,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:38,839 INFO L93 Difference]: Finished difference Result 6826 states and 8875 transitions. [2019-11-15 21:33:38,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:38,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-11-15 21:33:38,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:38,844 INFO L225 Difference]: With dead ends: 6826 [2019-11-15 21:33:38,844 INFO L226 Difference]: Without dead ends: 3114 [2019-11-15 21:33:38,848 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 21:33:38,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2019-11-15 21:33:38,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 3072. [2019-11-15 21:33:38,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3072 states. [2019-11-15 21:33:38,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 3966 transitions. [2019-11-15 21:33:38,982 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 3966 transitions. Word has length 197 [2019-11-15 21:33:38,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:38,982 INFO L462 AbstractCegarLoop]: Abstraction has 3072 states and 3966 transitions. [2019-11-15 21:33:38,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:38,982 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 3966 transitions. [2019-11-15 21:33:38,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-11-15 21:33:38,988 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:38,988 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 21:33:38,988 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:38,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:38,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1162887835, now seen corresponding path program 1 times [2019-11-15 21:33:38,989 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:38,989 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008064047] [2019-11-15 21:33:38,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:38,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:38,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:39,105 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 21:33:39,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008064047] [2019-11-15 21:33:39,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:39,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:33:39,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373641192] [2019-11-15 21:33:39,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:39,107 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:39,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:39,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:39,107 INFO L87 Difference]: Start difference. First operand 3072 states and 3966 transitions. Second operand 3 states. [2019-11-15 21:33:39,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:39,306 INFO L93 Difference]: Finished difference Result 6482 states and 8334 transitions. [2019-11-15 21:33:39,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:39,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-11-15 21:33:39,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:39,311 INFO L225 Difference]: With dead ends: 6482 [2019-11-15 21:33:39,312 INFO L226 Difference]: Without dead ends: 3432 [2019-11-15 21:33:39,315 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:39,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2019-11-15 21:33:39,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 3412. [2019-11-15 21:33:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3412 states. [2019-11-15 21:33:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3412 states to 3412 states and 4356 transitions. [2019-11-15 21:33:39,408 INFO L78 Accepts]: Start accepts. Automaton has 3412 states and 4356 transitions. Word has length 335 [2019-11-15 21:33:39,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:39,409 INFO L462 AbstractCegarLoop]: Abstraction has 3412 states and 4356 transitions. [2019-11-15 21:33:39,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:39,409 INFO L276 IsEmpty]: Start isEmpty. Operand 3412 states and 4356 transitions. [2019-11-15 21:33:39,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-11-15 21:33:39,414 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:39,415 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 21:33:39,415 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:39,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:39,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1926092110, now seen corresponding path program 1 times [2019-11-15 21:33:39,416 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:39,416 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075510933] [2019-11-15 21:33:39,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:39,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:39,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:39,549 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 21:33:39,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075510933] [2019-11-15 21:33:39,550 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:39,550 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:33:39,550 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356250107] [2019-11-15 21:33:39,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:33:39,551 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:39,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:33:39,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:39,552 INFO L87 Difference]: Start difference. First operand 3412 states and 4356 transitions. Second operand 3 states. [2019-11-15 21:33:39,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:39,775 INFO L93 Difference]: Finished difference Result 7182 states and 9154 transitions. [2019-11-15 21:33:39,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:33:39,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 366 [2019-11-15 21:33:39,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:39,788 INFO L225 Difference]: With dead ends: 7182 [2019-11-15 21:33:39,789 INFO L226 Difference]: Without dead ends: 3792 [2019-11-15 21:33:39,792 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:33:39,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3792 states. [2019-11-15 21:33:39,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3792 to 3772. [2019-11-15 21:33:39,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3772 states. [2019-11-15 21:33:39,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3772 states to 3772 states and 4766 transitions. [2019-11-15 21:33:39,906 INFO L78 Accepts]: Start accepts. Automaton has 3772 states and 4766 transitions. Word has length 366 [2019-11-15 21:33:39,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:39,907 INFO L462 AbstractCegarLoop]: Abstraction has 3772 states and 4766 transitions. [2019-11-15 21:33:39,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:33:39,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3772 states and 4766 transitions. [2019-11-15 21:33:39,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-11-15 21:33:39,916 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:39,917 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 21:33:39,917 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 21:33:39,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:39,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1476749664, now seen corresponding path program 1 times [2019-11-15 21:33:39,918 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:39,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328113739] [2019-11-15 21:33:39,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:39,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:39,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:40,143 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 21:33:40,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328113739] [2019-11-15 21:33:40,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368328846] [2019-11-15 21:33:40,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db68ee40-b0bf-4af4-9751-03dc1e6dd7a4/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:40,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:33:40,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:33:40,332 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 21:33:40,333 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:33:40,333 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 21:33:40,333 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032868088] [2019-11-15 21:33:40,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:33:40,334 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:40,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:33:40,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:33:40,334 INFO L87 Difference]: Start difference. First operand 3772 states and 4766 transitions. Second operand 4 states. [2019-11-15 21:33:40,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:40,528 INFO L93 Difference]: Finished difference Result 4931 states and 6242 transitions. [2019-11-15 21:33:40,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:33:40,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 399 [2019-11-15 21:33:40,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:40,529 INFO L225 Difference]: With dead ends: 4931 [2019-11-15 21:33:40,529 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 21:33:40,532 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 21:33:40,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 21:33:40,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 21:33:40,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 21:33:40,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 21:33:40,533 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 399 [2019-11-15 21:33:40,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:40,533 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:33:40,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:33:40,534 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:33:40,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 21:33:40,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:40,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 21:33:41,215 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 127 [2019-11-15 21:33:41,336 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 135 [2019-11-15 21:33:41,567 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 96 [2019-11-15 21:33:42,451 WARN L191 SmtUtils]: Spent 828.00 ms on a formula simplification. DAG size of input: 407 DAG size of output: 228 [2019-11-15 21:33:43,250 WARN L191 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 408 DAG size of output: 229 [2019-11-15 21:33:43,798 WARN L191 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 60 [2019-11-15 21:33:44,106 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2019-11-15 21:33:44,346 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 57 [2019-11-15 21:33:44,468 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-15 21:33:44,602 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-15 21:33:44,725 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-15 21:33:45,095 WARN L191 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 44 [2019-11-15 21:33:45,440 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 17 [2019-11-15 21:33:45,563 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-15 21:33:45,717 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 17 [2019-11-15 21:33:45,838 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-15 21:33:46,062 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 49 [2019-11-15 21:33:46,221 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 17 [2019-11-15 21:33:47,872 WARN L191 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 195 DAG size of output: 98 [2019-11-15 21:33:48,203 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 55 [2019-11-15 21:33:49,858 WARN L191 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 196 DAG size of output: 98 [2019-11-15 21:33:49,967 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 9 [2019-11-15 21:33:50,157 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 50 [2019-11-15 21:33:50,597 WARN L191 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 39 [2019-11-15 21:33:50,598 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 405) no Hoare annotation was computed. [2019-11-15 21:33:50,598 INFO L443 ceAbstractionStarter]: For program point L201(lines 201 591) no Hoare annotation was computed. [2019-11-15 21:33:50,599 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 602) no Hoare annotation was computed. [2019-11-15 21:33:50,599 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 613) no Hoare annotation was computed. [2019-11-15 21:33:50,599 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 624) no Hoare annotation was computed. [2019-11-15 21:33:50,599 INFO L443 ceAbstractionStarter]: For program point L466(lines 466 470) no Hoare annotation was computed. [2019-11-15 21:33:50,599 INFO L439 ceAbstractionStarter]: At program point L202(lines 198 592) 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 21:33:50,599 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 624) the Hoare annotation is: false [2019-11-15 21:33:50,600 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 504) no Hoare annotation was computed. [2019-11-15 21:33:50,600 INFO L443 ceAbstractionStarter]: For program point L500-2(lines 209 586) no Hoare annotation was computed. [2019-11-15 21:33:50,600 INFO L443 ceAbstractionStarter]: For program point L501(line 501) no Hoare annotation was computed. [2019-11-15 21:33:50,600 INFO L443 ceAbstractionStarter]: For program point L501-1(line 501) no Hoare annotation was computed. [2019-11-15 21:33:50,601 INFO L443 ceAbstractionStarter]: For program point L501-2(line 501) no Hoare annotation was computed. [2019-11-15 21:33:50,601 INFO L443 ceAbstractionStarter]: For program point L501-3(line 501) no Hoare annotation was computed. [2019-11-15 21:33:50,601 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 242) no Hoare annotation was computed. [2019-11-15 21:33:50,601 INFO L443 ceAbstractionStarter]: For program point L204(lines 204 590) no Hoare annotation was computed. [2019-11-15 21:33:50,601 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 601) no Hoare annotation was computed. [2019-11-15 21:33:50,602 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 612) no Hoare annotation was computed. [2019-11-15 21:33:50,602 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 623) no Hoare annotation was computed. [2019-11-15 21:33:50,602 INFO L439 ceAbstractionStarter]: At program point L205(lines 204 590) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-15 21:33:50,602 INFO L439 ceAbstractionStarter]: At program point L172(lines 168 602) 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 21:33:50,602 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 613) 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 21:33:50,602 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-11-15 21:33:50,603 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-11-15 21:33:50,603 INFO L443 ceAbstractionStarter]: For program point L570(lines 570 580) no Hoare annotation was computed. [2019-11-15 21:33:50,603 INFO L443 ceAbstractionStarter]: For program point L570-1(lines 570 580) no Hoare annotation was computed. [2019-11-15 21:33:50,603 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-11-15 21:33:50,603 INFO L443 ceAbstractionStarter]: For program point L306-2(lines 209 586) no Hoare annotation was computed. [2019-11-15 21:33:50,603 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 600) no Hoare annotation was computed. [2019-11-15 21:33:50,603 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 611) no Hoare annotation was computed. [2019-11-15 21:33:50,603 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 622) no Hoare annotation was computed. [2019-11-15 21:33:50,603 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 439 451) no Hoare annotation was computed. [2019-11-15 21:33:50,604 INFO L439 ceAbstractionStarter]: At program point L208(lines 207 589) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-15 21:33:50,604 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-11-15 21:33:50,604 INFO L443 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-11-15 21:33:50,604 INFO L446 ceAbstractionStarter]: At program point L671(lines 64 673) the Hoare annotation is: true [2019-11-15 21:33:50,604 INFO L443 ceAbstractionStarter]: For program point L638(lines 638 644) no Hoare annotation was computed. [2019-11-15 21:33:50,604 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 544) no Hoare annotation was computed. [2019-11-15 21:33:50,604 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 21:33:50,604 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-11-15 21:33:50,604 INFO L443 ceAbstractionStarter]: For program point L341-2(lines 209 586) no Hoare annotation was computed. [2019-11-15 21:33:50,604 INFO L446 ceAbstractionStarter]: At program point L672(lines 9 674) the Hoare annotation is: true [2019-11-15 21:33:50,604 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 577) no Hoare annotation was computed. [2019-11-15 21:33:50,605 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 599) no Hoare annotation was computed. [2019-11-15 21:33:50,605 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 610) no Hoare annotation was computed. [2019-11-15 21:33:50,605 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 621) no Hoare annotation was computed. [2019-11-15 21:33:50,605 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 447) no Hoare annotation was computed. [2019-11-15 21:33:50,605 INFO L439 ceAbstractionStarter]: At program point L178(lines 174 600) 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 21:33:50,605 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 611) 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 21:33:50,605 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 501) no Hoare annotation was computed. [2019-11-15 21:33:50,605 INFO L443 ceAbstractionStarter]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-11-15 21:33:50,605 INFO L439 ceAbstractionStarter]: At program point L212(lines 105 623) the Hoare annotation is: false [2019-11-15 21:33:50,605 INFO L443 ceAbstractionStarter]: For program point L510(lines 510 514) no Hoare annotation was computed. [2019-11-15 21:33:50,605 INFO L443 ceAbstractionStarter]: For program point L510-2(lines 510 514) no Hoare annotation was computed. [2019-11-15 21:33:50,605 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 598) no Hoare annotation was computed. [2019-11-15 21:33:50,606 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 609) no Hoare annotation was computed. [2019-11-15 21:33:50,606 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 620) no Hoare annotation was computed. [2019-11-15 21:33:50,606 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-11-15 21:33:50,606 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 501) no Hoare annotation was computed. [2019-11-15 21:33:50,606 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-11-15 21:33:50,606 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 64 673) no Hoare annotation was computed. [2019-11-15 21:33:50,606 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 597) no Hoare annotation was computed. [2019-11-15 21:33:50,606 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 608) no Hoare annotation was computed. [2019-11-15 21:33:50,606 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 619) no Hoare annotation was computed. [2019-11-15 21:33:50,606 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-11-15 21:33:50,606 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 380) no Hoare annotation was computed. [2019-11-15 21:33:50,606 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 320) no Hoare annotation was computed. [2019-11-15 21:33:50,606 INFO L443 ceAbstractionStarter]: For program point L316-2(lines 316 320) no Hoare annotation was computed. [2019-11-15 21:33:50,607 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-11-15 21:33:50,607 INFO L439 ceAbstractionStarter]: At program point L184(lines 180 598) 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 21:33:50,607 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 609) 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 21:33:50,607 INFO L443 ceAbstractionStarter]: For program point L217-2(lines 209 586) no Hoare annotation was computed. [2019-11-15 21:33:50,607 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 501) no Hoare annotation was computed. [2019-11-15 21:33:50,607 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 21:33:50,607 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 553) no Hoare annotation was computed. [2019-11-15 21:33:50,608 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 596) no Hoare annotation was computed. [2019-11-15 21:33:50,608 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 607) no Hoare annotation was computed. [2019-11-15 21:33:50,608 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 618) no Hoare annotation was computed. [2019-11-15 21:33:50,608 INFO L439 ceAbstractionStarter]: At program point L550(lines 64 673) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-15 21:33:50,608 INFO L443 ceAbstractionStarter]: For program point L352(lines 352 379) no Hoare annotation was computed. [2019-11-15 21:33:50,608 INFO L443 ceAbstractionStarter]: For program point L352-1(lines 352 379) no Hoare annotation was computed. [2019-11-15 21:33:50,608 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 619) the Hoare annotation is: false [2019-11-15 21:33:50,609 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 501) no Hoare annotation was computed. [2019-11-15 21:33:50,609 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 376) no Hoare annotation was computed. [2019-11-15 21:33:50,609 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 266) no Hoare annotation was computed. [2019-11-15 21:33:50,609 INFO L446 ceAbstractionStarter]: At program point L684(lines 675 686) the Hoare annotation is: true [2019-11-15 21:33:50,609 INFO L443 ceAbstractionStarter]: For program point L255(lines 255 260) no Hoare annotation was computed. [2019-11-15 21:33:50,609 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 595) no Hoare annotation was computed. [2019-11-15 21:33:50,609 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 606) no Hoare annotation was computed. [2019-11-15 21:33:50,609 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 617) no Hoare annotation was computed. [2019-11-15 21:33:50,609 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 525) no Hoare annotation was computed. [2019-11-15 21:33:50,609 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 419) no Hoare annotation was computed. [2019-11-15 21:33:50,609 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 293) no Hoare annotation was computed. [2019-11-15 21:33:50,609 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 21:33:50,610 INFO L443 ceAbstractionStarter]: For program point L289-2(lines 209 586) no Hoare annotation was computed. [2019-11-15 21:33:50,610 INFO L439 ceAbstractionStarter]: At program point L190(lines 186 596) 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 21:33:50,610 INFO L439 ceAbstractionStarter]: At program point L157(lines 153 607) 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 21:33:50,610 INFO L439 ceAbstractionStarter]: At program point L124(lines 123 617) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse13 .cse14 .cse15) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-15 21:33:50,611 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 264) no Hoare annotation was computed. [2019-11-15 21:33:50,611 INFO L439 ceAbstractionStarter]: At program point L587(lines 99 655) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (let ((.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse17 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse16 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse15 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse19 (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse1 .cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) .cse7 .cse21 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) .cse3 .cse22 .cse4 .cse8 .cse23 .cse9 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) .cse11 .cse12)) (.cse18 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse6 .cse13 .cse14 .cse15 .cse11) (and .cse16 .cse6 .cse13 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse11) (and .cse16 .cse17 .cse6 .cse13 .cse11 .cse18) (and .cse6 .cse13 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse11) (and .cse5 .cse19) (and .cse16 .cse17 (= ULTIMATE.start_ssl3_accept_~s__state~0 8640) .cse18) (and (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse20 .cse21 .cse22 .cse23) .cse16) (and .cse0 .cse14 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) .cse10 .cse15) (and .cse19 .cse18)))) [2019-11-15 21:33:50,611 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2019-11-15 21:33:50,612 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-11-15 21:33:50,612 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 375) no Hoare annotation was computed. [2019-11-15 21:33:50,612 INFO L443 ceAbstractionStarter]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-11-15 21:33:50,612 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-11-15 21:33:50,612 INFO L443 ceAbstractionStarter]: For program point L357-2(lines 356 373) no Hoare annotation was computed. [2019-11-15 21:33:50,612 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 594) no Hoare annotation was computed. [2019-11-15 21:33:50,612 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 605) no Hoare annotation was computed. [2019-11-15 21:33:50,613 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 616) no Hoare annotation was computed. [2019-11-15 21:33:50,613 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-11-15 21:33:50,613 INFO L443 ceAbstractionStarter]: For program point L325-1(lines 325 334) no Hoare annotation was computed. [2019-11-15 21:33:50,613 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 21:33:50,613 INFO L446 ceAbstractionStarter]: At program point L656(lines 98 657) the Hoare annotation is: true [2019-11-15 21:33:50,613 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 264) no Hoare annotation was computed. [2019-11-15 21:33:50,614 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 593) no Hoare annotation was computed. [2019-11-15 21:33:50,614 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 604) no Hoare annotation was computed. [2019-11-15 21:33:50,614 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 615) no Hoare annotation was computed. [2019-11-15 21:33:50,614 INFO L443 ceAbstractionStarter]: For program point L625(lines 625 653) no Hoare annotation was computed. [2019-11-15 21:33:50,614 INFO L443 ceAbstractionStarter]: For program point L262(line 262) no Hoare annotation was computed. [2019-11-15 21:33:50,614 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 246) no Hoare annotation was computed. [2019-11-15 21:33:50,615 INFO L443 ceAbstractionStarter]: For program point L262-1(line 262) no Hoare annotation was computed. [2019-11-15 21:33:50,615 INFO L439 ceAbstractionStarter]: At program point L196(lines 192 594) the Hoare annotation is: (let ((.cse7 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) (and .cse2 (and .cse1 .cse3 .cse4 .cse5 .cse6)) .cse7)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse6))) [2019-11-15 21:33:50,615 INFO L439 ceAbstractionStarter]: At program point L163(lines 159 605) 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 21:33:50,615 INFO L443 ceAbstractionStarter]: For program point L229-2(lines 209 586) no Hoare annotation was computed. [2019-11-15 21:33:50,615 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 650) no Hoare annotation was computed. [2019-11-15 21:33:50,616 INFO L443 ceAbstractionStarter]: For program point L560(lines 560 564) no Hoare annotation was computed. [2019-11-15 21:33:50,616 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 262) no Hoare annotation was computed. [2019-11-15 21:33:50,616 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 531) no Hoare annotation was computed. [2019-11-15 21:33:50,616 INFO L443 ceAbstractionStarter]: For program point L560-2(lines 560 564) no Hoare annotation was computed. [2019-11-15 21:33:50,616 INFO L443 ceAbstractionStarter]: For program point L527-2(lines 209 586) no Hoare annotation was computed. [2019-11-15 21:33:50,616 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-11-15 21:33:50,617 INFO L443 ceAbstractionStarter]: For program point L660(lines 660 664) no Hoare annotation was computed. [2019-11-15 21:33:50,617 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 636) no Hoare annotation was computed. [2019-11-15 21:33:50,617 INFO L443 ceAbstractionStarter]: For program point L660-2(lines 660 664) no Hoare annotation was computed. [2019-11-15 21:33:50,617 INFO L443 ceAbstractionStarter]: For program point L627-2(lines 626 648) no Hoare annotation was computed. [2019-11-15 21:33:50,617 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-11-15 21:33:50,617 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-11-15 21:33:50,618 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 21:33:50,618 INFO L443 ceAbstractionStarter]: For program point L264(line 264) no Hoare annotation was computed. [2019-11-15 21:33:50,618 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-11-15 21:33:50,618 INFO L443 ceAbstractionStarter]: For program point L264-1(line 264) no Hoare annotation was computed. [2019-11-15 21:33:50,618 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 592) no Hoare annotation was computed. [2019-11-15 21:33:50,619 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 603) no Hoare annotation was computed. [2019-11-15 21:33:50,619 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 614) no Hoare annotation was computed. [2019-11-15 21:33:50,619 INFO L439 ceAbstractionStarter]: At program point L99-2(lines 99 655) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (let ((.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse17 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse16 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse15 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse19 (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse1 .cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) .cse7 .cse21 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) .cse3 .cse22 .cse4 .cse8 .cse23 .cse9 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) .cse11 .cse12)) (.cse18 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse6 .cse13 .cse14 .cse15 .cse11) (and .cse16 .cse6 .cse13 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse11) (and .cse16 .cse17 .cse6 .cse13 .cse11 .cse18) (and .cse6 .cse13 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse11) (and .cse5 .cse19) (and .cse16 .cse17 (= ULTIMATE.start_ssl3_accept_~s__state~0 8640) .cse18) (and (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse20 .cse21 .cse22 .cse23) .cse16) (and .cse0 .cse14 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) .cse10 .cse15) (and .cse19 .cse18)))) [2019-11-15 21:33:50,620 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 21:33:50,620 INFO L439 ceAbstractionStarter]: At program point L166(lines 165 603) 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 21:33:50,620 INFO L439 ceAbstractionStarter]: At program point L133(lines 126 616) 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 21:33:50,620 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-15 21:33:50,620 INFO L443 ceAbstractionStarter]: For program point L629(lines 629 633) no Hoare annotation was computed. [2019-11-15 21:33:50,621 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-11-15 21:33:50,621 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 262) no Hoare annotation was computed. [2019-11-15 21:33:50,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:33:50 BoogieIcfgContainer [2019-11-15 21:33:50,653 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:33:50,653 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:33:50,653 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:33:50,654 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:33:50,654 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:33:22" (3/4) ... [2019-11-15 21:33:50,657 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 21:33:50,674 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 21:33:50,675 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 21:33:50,775 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_db68ee40-b0bf-4af4-9751-03dc1e6dd7a4/bin/uautomizer/witness.graphml [2019-11-15 21:33:50,776 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:33:50,777 INFO L168 Benchmark]: Toolchain (without parser) took 29334.40 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 764.4 MB). Free memory was 944.7 MB in the beginning and 869.3 MB in the end (delta: 75.5 MB). Peak memory consumption was 839.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:33:50,777 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:33:50,777 INFO L168 Benchmark]: CACSL2BoogieTranslator took 546.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -192.4 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:33:50,778 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.56 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 21:33:50,778 INFO L168 Benchmark]: Boogie Preprocessor took 48.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:33:50,778 INFO L168 Benchmark]: RCFGBuilder took 799.57 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:33:50,779 INFO L168 Benchmark]: TraceAbstraction took 27746.85 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 615.5 MB). Free memory was 1.1 GB in the beginning and 893.2 MB in the end (delta: 183.9 MB). Peak memory consumption was 804.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:33:50,779 INFO L168 Benchmark]: Witness Printer took 122.58 ms. Allocated memory is still 1.8 GB. Free memory was 893.2 MB in the beginning and 869.3 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:33:50,781 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 546.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -192.4 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.02 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. * RCFGBuilder took 799.57 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27746.85 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 615.5 MB). Free memory was 1.1 GB in the beginning and 893.2 MB in the end (delta: 183.9 MB). Peak memory consumption was 804.3 MB. Max. memory is 11.5 GB. * Witness Printer took 122.58 ms. Allocated memory is still 1.8 GB. Free memory was 893.2 MB in the beginning and 869.3 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 262]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 501]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 501]: 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: 501]: 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: 501]: 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 - 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: 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 == 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__s3__tmp__next_state___0 <= 8640) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || ((((((((((((((((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)) - 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: 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: 9]: 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: 64]: Loop Invariant Derived loop invariant: !(s__state == 12292) - 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: 98]: Loop Invariant Derived loop invariant: 1 - 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: 675]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: 0 - 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: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8192)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || (((((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 == 8192) && s__state <= 8448) && !(s__state == 8448)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8195))) || (!(s__state == 8576) && (((((((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8195)) && !(s__state == 8480))) || (((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && s__state == 8640) && !(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)) || (((((((((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 1 - 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 == 8513)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8192)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || (((((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 == 8192) && s__state <= 8448) && !(s__state == 8448)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8195))) || (!(s__state == 8576) && (((((((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8195)) && !(s__state == 8480))) || (((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && s__state == 8640) && !(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)) || (((((((((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 8576 <= s__state) && s__state <= 8640 - 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 <= 2 && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 16384)) && !(0 == s__hit)) || (blastFlag <= 3 && (s__s3__tmp__next_state___0 <= 8640 && 8576 <= s__state && (((!(s__state == 8672) && !(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: 27.6s, OverallIterations: 39, TraceHistogramMax: 14, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.8s, HoareTripleCheckerStatistics: 6988 SDtfs, 5871 SDslu, 3536 SDs, 0 SdLazy, 4214 SolverSat, 1138 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1986 GetRequests, 1935 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5243occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 39 MinimizatonAttempts, 4793 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 275 NumberOfFragments, 1948 HoareAnnotationTreeSize, 29 FomulaSimplifications, 223086 FormulaSimplificationTreeSizeReduction, 2.6s HoareSimplificationTime, 29 FomulaSimplificationsInter, 46520 FormulaSimplificationTreeSizeReductionInter, 7.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 5670 NumberOfCodeBlocks, 5670 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 5627 ConstructedInterpolants, 0 QuantifiedInterpolants, 1668610 SizeOfPredicates, 13 NumberOfNonLiveVariables, 3550 ConjunctsInSsa, 36 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...