./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 b0b2d978b2f3873db9b988022a041d2d18a2f859 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 11:26:26,774 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 11:26:26,776 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 11:26:26,805 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 11:26:26,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 11:26:26,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 11:26:26,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 11:26:26,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 11:26:26,815 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 11:26:26,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 11:26:26,819 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 11:26:26,820 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 11:26:26,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 11:26:26,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 11:26:26,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 11:26:26,827 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 11:26:26,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 11:26:26,828 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 11:26:26,830 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 11:26:26,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 11:26:26,835 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 11:26:26,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 11:26:26,837 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 11:26:26,838 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 11:26:26,842 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 11:26:26,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 11:26:26,843 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 11:26:26,844 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 11:26:26,844 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 11:26:26,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 11:26:26,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 11:26:26,845 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 11:26:26,846 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 11:26:26,847 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 11:26:26,848 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 11:26:26,848 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 11:26:26,849 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 11:26:26,849 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 11:26:26,849 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 11:26:26,850 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 11:26:26,850 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 11:26:26,853 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2021-08-27 11:26:26,876 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 11:26:26,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 11:26:26,877 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 11:26:26,878 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 11:26:26,879 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 11:26:26,879 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 11:26:26,879 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 11:26:26,879 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 11:26:26,880 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 11:26:26,880 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 11:26:26,880 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 11:26:26,880 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 11:26:26,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 11:26:26,881 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-27 11:26:26,881 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 11:26:26,881 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-27 11:26:26,881 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-08-27 11:26:26,881 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 11:26:26,881 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 11:26:26,881 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 11:26:26,882 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-27 11:26:26,882 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 11:26:26,882 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 11:26:26,882 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 11:26:26,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 11:26:26,882 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 11:26:26,883 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 11:26:26,883 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-27 11:26:26,883 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 11:26:26,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 11:26:26,898 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-27 11:26:26,898 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 11:26:26,899 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> b0b2d978b2f3873db9b988022a041d2d18a2f859 [2021-08-27 11:26:27,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 11:26:27,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 11:26:27,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 11:26:27,271 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 11:26:27,271 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 11:26:27,272 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2021-08-27 11:26:27,323 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ed08727a/d843ddde3e114984854572d0ec6ab959/FLAG01ea54e8e [2021-08-27 11:26:27,639 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 11:26:27,640 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2021-08-27 11:26:27,664 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ed08727a/d843ddde3e114984854572d0ec6ab959/FLAG01ea54e8e [2021-08-27 11:26:28,055 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ed08727a/d843ddde3e114984854572d0ec6ab959 [2021-08-27 11:26:28,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 11:26:28,059 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 11:26:28,062 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 11:26:28,062 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 11:26:28,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 11:26:28,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 11:26:28" (1/1) ... [2021-08-27 11:26:28,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f9d6168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:26:28, skipping insertion in model container [2021-08-27 11:26:28,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 11:26:28" (1/1) ... [2021-08-27 11:26:28,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 11:26:28,124 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 11:26:28,259 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c[44644,44657] [2021-08-27 11:26:28,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 11:26:28,268 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 11:26:28,325 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c[44644,44657] [2021-08-27 11:26:28,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 11:26:28,336 INFO L208 MainTranslator]: Completed translation [2021-08-27 11:26:28,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:26:28 WrapperNode [2021-08-27 11:26:28,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 11:26:28,337 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 11:26:28,337 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 11:26:28,337 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 11:26:28,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:26:28" (1/1) ... [2021-08-27 11:26:28,348 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:26:28" (1/1) ... [2021-08-27 11:26:28,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 11:26:28,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 11:26:28,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 11:26:28,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 11:26:28,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:26:28" (1/1) ... [2021-08-27 11:26:28,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:26:28" (1/1) ... [2021-08-27 11:26:28,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:26:28" (1/1) ... [2021-08-27 11:26:28,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:26:28" (1/1) ... [2021-08-27 11:26:28,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:26:28" (1/1) ... [2021-08-27 11:26:28,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:26:28" (1/1) ... [2021-08-27 11:26:28,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:26:28" (1/1) ... [2021-08-27 11:26:28,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 11:26:28,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 11:26:28,392 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 11:26:28,392 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 11:26:28,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:26:28" (1/1) ... [2021-08-27 11:26:28,408 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 11:26:28,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:26:28,420 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 11:26:28,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 11:26:28,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 11:26:28,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 11:26:28,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 11:26:28,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 11:26:28,586 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 11:26:29,062 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-08-27 11:26:29,063 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-08-27 11:26:29,071 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 11:26:29,071 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-27 11:26:29,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 11:26:29 BoogieIcfgContainer [2021-08-27 11:26:29,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 11:26:29,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 11:26:29,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 11:26:29,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 11:26:29,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 11:26:28" (1/3) ... [2021-08-27 11:26:29,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f71d855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 11:26:29, skipping insertion in model container [2021-08-27 11:26:29,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:26:28" (2/3) ... [2021-08-27 11:26:29,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f71d855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 11:26:29, skipping insertion in model container [2021-08-27 11:26:29,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 11:26:29" (3/3) ... [2021-08-27 11:26:29,081 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2021-08-27 11:26:29,084 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 11:26:29,084 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-08-27 11:26:29,110 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 11:26:29,115 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 11:26:29,115 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-08-27 11:26:29,142 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 142 states have (on average 1.732394366197183) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:29,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-27 11:26:29,145 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:29,146 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:26:29,146 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:29,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:29,150 INFO L82 PathProgramCache]: Analyzing trace with hash -580333898, now seen corresponding path program 1 times [2021-08-27 11:26:29,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:29,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163340944] [2021-08-27 11:26:29,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:29,157 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:29,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:26:29,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:29,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163340944] [2021-08-27 11:26:29,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163340944] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:26:29,265 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:26:29,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:26:29,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215265965] [2021-08-27 11:26:29,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:26:29,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:29,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:26:29,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:29,279 INFO L87 Difference]: Start difference. First operand has 147 states, 142 states have (on average 1.732394366197183) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:29,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:29,396 INFO L93 Difference]: Finished difference Result 312 states and 520 transitions. [2021-08-27 11:26:29,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:26:29,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-08-27 11:26:29,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:29,405 INFO L225 Difference]: With dead ends: 312 [2021-08-27 11:26:29,405 INFO L226 Difference]: Without dead ends: 150 [2021-08-27 11:26:29,407 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:29,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-08-27 11:26:29,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2021-08-27 11:26:29,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 146 states have (on average 1.5410958904109588) internal successors, (225), 149 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:29,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 225 transitions. [2021-08-27 11:26:29,433 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 225 transitions. Word has length 18 [2021-08-27 11:26:29,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:29,434 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 225 transitions. [2021-08-27 11:26:29,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:29,434 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 225 transitions. [2021-08-27 11:26:29,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 11:26:29,435 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:29,435 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:26:29,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 11:26:29,435 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:29,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:29,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1061870123, now seen corresponding path program 1 times [2021-08-27 11:26:29,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:29,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769490841] [2021-08-27 11:26:29,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:29,437 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:29,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:26:29,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:29,475 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769490841] [2021-08-27 11:26:29,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769490841] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:26:29,476 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:26:29,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:26:29,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207764530] [2021-08-27 11:26:29,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:26:29,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:29,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:26:29,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:29,478 INFO L87 Difference]: Start difference. First operand 150 states and 225 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:29,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:29,563 INFO L93 Difference]: Finished difference Result 302 states and 451 transitions. [2021-08-27 11:26:29,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:26:29,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-08-27 11:26:29,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:29,565 INFO L225 Difference]: With dead ends: 302 [2021-08-27 11:26:29,565 INFO L226 Difference]: Without dead ends: 160 [2021-08-27 11:26:29,566 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:29,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-08-27 11:26:29,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 151. [2021-08-27 11:26:29,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 147 states have (on average 1.5374149659863945) internal successors, (226), 150 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:29,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 226 transitions. [2021-08-27 11:26:29,572 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 226 transitions. Word has length 19 [2021-08-27 11:26:29,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:29,573 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 226 transitions. [2021-08-27 11:26:29,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:29,573 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 226 transitions. [2021-08-27 11:26:29,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 11:26:29,574 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:29,574 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:26:29,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 11:26:29,574 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:29,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:29,575 INFO L82 PathProgramCache]: Analyzing trace with hash 323589326, now seen corresponding path program 1 times [2021-08-27 11:26:29,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:29,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347626918] [2021-08-27 11:26:29,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:29,575 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:29,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:26:29,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:29,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347626918] [2021-08-27 11:26:29,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347626918] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:26:29,603 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:26:29,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:26:29,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339244656] [2021-08-27 11:26:29,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:26:29,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:29,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:26:29,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:29,604 INFO L87 Difference]: Start difference. First operand 151 states and 226 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:29,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:29,687 INFO L93 Difference]: Finished difference Result 304 states and 453 transitions. [2021-08-27 11:26:29,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:26:29,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-08-27 11:26:29,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:29,688 INFO L225 Difference]: With dead ends: 304 [2021-08-27 11:26:29,689 INFO L226 Difference]: Without dead ends: 161 [2021-08-27 11:26:29,689 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:29,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-08-27 11:26:29,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 152. [2021-08-27 11:26:29,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 148 states have (on average 1.5337837837837838) internal successors, (227), 151 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 227 transitions. [2021-08-27 11:26:29,702 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 227 transitions. Word has length 20 [2021-08-27 11:26:29,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:29,703 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 227 transitions. [2021-08-27 11:26:29,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:29,703 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 227 transitions. [2021-08-27 11:26:29,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 11:26:29,703 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:29,704 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:26:29,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 11:26:29,704 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:29,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:29,704 INFO L82 PathProgramCache]: Analyzing trace with hash -659408240, now seen corresponding path program 1 times [2021-08-27 11:26:29,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:29,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12777773] [2021-08-27 11:26:29,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:29,705 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:29,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:26:29,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:29,730 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12777773] [2021-08-27 11:26:29,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12777773] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:26:29,730 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:26:29,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:26:29,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363272335] [2021-08-27 11:26:29,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:26:29,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:29,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:26:29,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:29,732 INFO L87 Difference]: Start difference. First operand 152 states and 227 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:29,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:29,815 INFO L93 Difference]: Finished difference Result 306 states and 455 transitions. [2021-08-27 11:26:29,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:26:29,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-27 11:26:29,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:29,816 INFO L225 Difference]: With dead ends: 306 [2021-08-27 11:26:29,816 INFO L226 Difference]: Without dead ends: 162 [2021-08-27 11:26:29,817 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:29,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-08-27 11:26:29,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 153. [2021-08-27 11:26:29,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 149 states have (on average 1.5302013422818792) internal successors, (228), 152 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:29,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 228 transitions. [2021-08-27 11:26:29,822 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 228 transitions. Word has length 21 [2021-08-27 11:26:29,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:29,822 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 228 transitions. [2021-08-27 11:26:29,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:29,823 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 228 transitions. [2021-08-27 11:26:29,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 11:26:29,823 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:29,823 INFO L512 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] [2021-08-27 11:26:29,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 11:26:29,824 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:29,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:29,824 INFO L82 PathProgramCache]: Analyzing trace with hash -2050129239, now seen corresponding path program 1 times [2021-08-27 11:26:29,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:29,824 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840636496] [2021-08-27 11:26:29,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:29,825 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:29,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:26:29,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:29,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840636496] [2021-08-27 11:26:29,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840636496] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:26:29,848 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:26:29,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:26:29,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790795717] [2021-08-27 11:26:29,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:26:29,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:29,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:26:29,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:29,850 INFO L87 Difference]: Start difference. First operand 153 states and 228 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:29,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:29,943 INFO L93 Difference]: Finished difference Result 308 states and 457 transitions. [2021-08-27 11:26:29,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:26:29,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-08-27 11:26:29,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:29,944 INFO L225 Difference]: With dead ends: 308 [2021-08-27 11:26:29,944 INFO L226 Difference]: Without dead ends: 163 [2021-08-27 11:26:29,945 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:29,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-08-27 11:26:29,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 154. [2021-08-27 11:26:29,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 150 states have (on average 1.5266666666666666) internal successors, (229), 153 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 229 transitions. [2021-08-27 11:26:29,949 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 229 transitions. Word has length 22 [2021-08-27 11:26:29,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:29,949 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 229 transitions. [2021-08-27 11:26:29,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:29,950 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 229 transitions. [2021-08-27 11:26:29,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-08-27 11:26:29,951 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:29,951 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:26:29,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 11:26:29,951 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:29,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:29,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1990190120, now seen corresponding path program 1 times [2021-08-27 11:26:29,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:29,952 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147509278] [2021-08-27 11:26:29,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:29,952 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:29,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:26:29,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:29,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147509278] [2021-08-27 11:26:29,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147509278] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:26:29,979 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:26:29,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:26:29,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537944081] [2021-08-27 11:26:29,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:26:29,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:29,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:26:29,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:29,980 INFO L87 Difference]: Start difference. First operand 154 states and 229 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:30,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:30,089 INFO L93 Difference]: Finished difference Result 331 states and 499 transitions. [2021-08-27 11:26:30,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:26:30,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-08-27 11:26:30,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:30,091 INFO L225 Difference]: With dead ends: 331 [2021-08-27 11:26:30,091 INFO L226 Difference]: Without dead ends: 185 [2021-08-27 11:26:30,091 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:30,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-08-27 11:26:30,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2021-08-27 11:26:30,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 181 states have (on average 1.5524861878453038) internal successors, (281), 184 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:30,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 281 transitions. [2021-08-27 11:26:30,096 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 281 transitions. Word has length 47 [2021-08-27 11:26:30,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:30,096 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 281 transitions. [2021-08-27 11:26:30,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:30,097 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 281 transitions. [2021-08-27 11:26:30,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-27 11:26:30,098 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:30,098 INFO L512 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, 1, 1, 1] [2021-08-27 11:26:30,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 11:26:30,098 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:30,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:30,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1367947310, now seen corresponding path program 1 times [2021-08-27 11:26:30,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:30,099 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386211456] [2021-08-27 11:26:30,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:30,099 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:30,122 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-27 11:26:30,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:30,123 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386211456] [2021-08-27 11:26:30,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386211456] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:26:30,123 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:26:30,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:26:30,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669736317] [2021-08-27 11:26:30,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:26:30,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:30,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:26:30,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:30,125 INFO L87 Difference]: Start difference. First operand 185 states and 281 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:30,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:30,218 INFO L93 Difference]: Finished difference Result 380 states and 575 transitions. [2021-08-27 11:26:30,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:26:30,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-08-27 11:26:30,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:30,219 INFO L225 Difference]: With dead ends: 380 [2021-08-27 11:26:30,219 INFO L226 Difference]: Without dead ends: 203 [2021-08-27 11:26:30,220 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:30,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-08-27 11:26:30,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2021-08-27 11:26:30,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 197 states have (on average 1.532994923857868) internal successors, (302), 200 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:30,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 302 transitions. [2021-08-27 11:26:30,225 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 302 transitions. Word has length 59 [2021-08-27 11:26:30,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:30,225 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 302 transitions. [2021-08-27 11:26:30,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:30,226 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 302 transitions. [2021-08-27 11:26:30,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-27 11:26:30,226 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:30,227 INFO L512 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, 1, 1, 1] [2021-08-27 11:26:30,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 11:26:30,227 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:30,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:30,228 INFO L82 PathProgramCache]: Analyzing trace with hash -2136164213, now seen corresponding path program 1 times [2021-08-27 11:26:30,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:30,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104588086] [2021-08-27 11:26:30,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:30,228 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:30,250 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-27 11:26:30,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:30,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104588086] [2021-08-27 11:26:30,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104588086] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:26:30,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:26:30,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:26:30,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38746167] [2021-08-27 11:26:30,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:26:30,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:30,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:26:30,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:30,253 INFO L87 Difference]: Start difference. First operand 201 states and 302 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:30,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:30,338 INFO L93 Difference]: Finished difference Result 397 states and 596 transitions. [2021-08-27 11:26:30,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:26:30,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-08-27 11:26:30,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:30,339 INFO L225 Difference]: With dead ends: 397 [2021-08-27 11:26:30,339 INFO L226 Difference]: Without dead ends: 204 [2021-08-27 11:26:30,340 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:30,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-08-27 11:26:30,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202. [2021-08-27 11:26:30,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 198 states have (on average 1.5252525252525253) internal successors, (302), 201 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:30,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 302 transitions. [2021-08-27 11:26:30,344 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 302 transitions. Word has length 60 [2021-08-27 11:26:30,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:30,344 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 302 transitions. [2021-08-27 11:26:30,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:30,345 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 302 transitions. [2021-08-27 11:26:30,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-27 11:26:30,345 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:30,345 INFO L512 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, 1, 1, 1] [2021-08-27 11:26:30,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 11:26:30,346 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:30,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:30,346 INFO L82 PathProgramCache]: Analyzing trace with hash -956503025, now seen corresponding path program 1 times [2021-08-27 11:26:30,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:30,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686777519] [2021-08-27 11:26:30,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:30,347 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:30,370 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-27 11:26:30,370 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:30,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686777519] [2021-08-27 11:26:30,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686777519] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:26:30,371 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:26:30,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:26:30,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866091639] [2021-08-27 11:26:30,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:26:30,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:30,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:26:30,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:30,372 INFO L87 Difference]: Start difference. First operand 202 states and 302 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:30,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:30,480 INFO L93 Difference]: Finished difference Result 440 states and 667 transitions. [2021-08-27 11:26:30,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:26:30,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-08-27 11:26:30,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:30,481 INFO L225 Difference]: With dead ends: 440 [2021-08-27 11:26:30,482 INFO L226 Difference]: Without dead ends: 246 [2021-08-27 11:26:30,482 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:30,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-08-27 11:26:30,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2021-08-27 11:26:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 240 states have (on average 1.5541666666666667) internal successors, (373), 243 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:30,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 373 transitions. [2021-08-27 11:26:30,487 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 373 transitions. Word has length 73 [2021-08-27 11:26:30,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:30,487 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 373 transitions. [2021-08-27 11:26:30,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:30,488 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 373 transitions. [2021-08-27 11:26:30,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-27 11:26:30,488 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:30,488 INFO L512 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, 1, 1, 1] [2021-08-27 11:26:30,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 11:26:30,489 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:30,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:30,489 INFO L82 PathProgramCache]: Analyzing trace with hash 603125704, now seen corresponding path program 1 times [2021-08-27 11:26:30,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:30,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214560644] [2021-08-27 11:26:30,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:30,490 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-27 11:26:30,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:30,512 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214560644] [2021-08-27 11:26:30,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214560644] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:26:30,512 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:26:30,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:26:30,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589344472] [2021-08-27 11:26:30,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:26:30,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:30,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:26:30,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:30,514 INFO L87 Difference]: Start difference. First operand 244 states and 373 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:30,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:30,616 INFO L93 Difference]: Finished difference Result 514 states and 789 transitions. [2021-08-27 11:26:30,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:26:30,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-08-27 11:26:30,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:30,618 INFO L225 Difference]: With dead ends: 514 [2021-08-27 11:26:30,618 INFO L226 Difference]: Without dead ends: 278 [2021-08-27 11:26:30,618 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:30,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-08-27 11:26:30,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 271. [2021-08-27 11:26:30,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 267 states have (on average 1.546816479400749) internal successors, (413), 270 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:30,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 413 transitions. [2021-08-27 11:26:30,624 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 413 transitions. Word has length 74 [2021-08-27 11:26:30,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:30,625 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 413 transitions. [2021-08-27 11:26:30,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:30,625 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 413 transitions. [2021-08-27 11:26:30,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-27 11:26:30,625 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:30,626 INFO L512 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, 1, 1, 1] [2021-08-27 11:26:30,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 11:26:30,626 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:30,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:30,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1649015640, now seen corresponding path program 1 times [2021-08-27 11:26:30,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:30,627 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962811709] [2021-08-27 11:26:30,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:30,627 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:30,646 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-27 11:26:30,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:30,647 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962811709] [2021-08-27 11:26:30,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962811709] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:26:30,647 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:26:30,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:26:30,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870899914] [2021-08-27 11:26:30,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:26:30,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:30,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:26:30,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:30,648 INFO L87 Difference]: Start difference. First operand 271 states and 413 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:30,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:30,760 INFO L93 Difference]: Finished difference Result 537 states and 818 transitions. [2021-08-27 11:26:30,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:26:30,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-08-27 11:26:30,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:30,762 INFO L225 Difference]: With dead ends: 537 [2021-08-27 11:26:30,762 INFO L226 Difference]: Without dead ends: 274 [2021-08-27 11:26:30,763 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:30,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-08-27 11:26:30,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 272. [2021-08-27 11:26:30,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 268 states have (on average 1.541044776119403) internal successors, (413), 271 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:30,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 413 transitions. [2021-08-27 11:26:30,768 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 413 transitions. Word has length 74 [2021-08-27 11:26:30,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:30,769 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 413 transitions. [2021-08-27 11:26:30,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:30,769 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 413 transitions. [2021-08-27 11:26:30,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-27 11:26:30,770 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:30,770 INFO L512 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, 1, 1, 1] [2021-08-27 11:26:30,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 11:26:30,770 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:30,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:30,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1207629393, now seen corresponding path program 1 times [2021-08-27 11:26:30,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:30,771 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031824169] [2021-08-27 11:26:30,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:30,771 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:30,789 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-27 11:26:30,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:30,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031824169] [2021-08-27 11:26:30,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031824169] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:26:30,790 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:26:30,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:26:30,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342267533] [2021-08-27 11:26:30,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:26:30,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:30,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:26:30,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:30,791 INFO L87 Difference]: Start difference. First operand 272 states and 413 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:30,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:30,896 INFO L93 Difference]: Finished difference Result 543 states and 826 transitions. [2021-08-27 11:26:30,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:26:30,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-08-27 11:26:30,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:30,897 INFO L225 Difference]: With dead ends: 543 [2021-08-27 11:26:30,897 INFO L226 Difference]: Without dead ends: 279 [2021-08-27 11:26:30,898 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:30,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-08-27 11:26:30,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 272. [2021-08-27 11:26:30,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 268 states have (on average 1.5298507462686568) internal successors, (410), 271 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:30,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 410 transitions. [2021-08-27 11:26:30,904 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 410 transitions. Word has length 75 [2021-08-27 11:26:30,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:30,905 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 410 transitions. [2021-08-27 11:26:30,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:30,905 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 410 transitions. [2021-08-27 11:26:30,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-08-27 11:26:30,906 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:30,906 INFO L512 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, 1, 1, 1] [2021-08-27 11:26:30,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 11:26:30,906 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:30,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:30,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1576887455, now seen corresponding path program 1 times [2021-08-27 11:26:30,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:30,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889018948] [2021-08-27 11:26:30,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:30,907 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:30,926 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-27 11:26:30,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:30,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889018948] [2021-08-27 11:26:30,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889018948] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:26:30,927 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:26:30,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:26:30,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319104338] [2021-08-27 11:26:30,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:26:30,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:30,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:26:30,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:30,928 INFO L87 Difference]: Start difference. First operand 272 states and 410 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:31,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:31,055 INFO L93 Difference]: Finished difference Result 583 states and 882 transitions. [2021-08-27 11:26:31,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:26:31,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2021-08-27 11:26:31,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:31,057 INFO L225 Difference]: With dead ends: 583 [2021-08-27 11:26:31,057 INFO L226 Difference]: Without dead ends: 319 [2021-08-27 11:26:31,057 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:31,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-08-27 11:26:31,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 315. [2021-08-27 11:26:31,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 311 states have (on average 1.540192926045016) internal successors, (479), 314 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:31,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 479 transitions. [2021-08-27 11:26:31,064 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 479 transitions. Word has length 90 [2021-08-27 11:26:31,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:31,065 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 479 transitions. [2021-08-27 11:26:31,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:31,065 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 479 transitions. [2021-08-27 11:26:31,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-08-27 11:26:31,065 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:31,066 INFO L512 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, 1, 1, 1, 1] [2021-08-27 11:26:31,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 11:26:31,066 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:31,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:31,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1659002301, now seen corresponding path program 1 times [2021-08-27 11:26:31,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:31,067 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136779885] [2021-08-27 11:26:31,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:31,067 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:31,086 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-27 11:26:31,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:31,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136779885] [2021-08-27 11:26:31,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136779885] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:26:31,087 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:26:31,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:26:31,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404019206] [2021-08-27 11:26:31,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:26:31,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:31,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:26:31,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:31,088 INFO L87 Difference]: Start difference. First operand 315 states and 479 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:31,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:31,207 INFO L93 Difference]: Finished difference Result 638 states and 973 transitions. [2021-08-27 11:26:31,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:26:31,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-08-27 11:26:31,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:31,209 INFO L225 Difference]: With dead ends: 638 [2021-08-27 11:26:31,209 INFO L226 Difference]: Without dead ends: 329 [2021-08-27 11:26:31,209 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:31,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2021-08-27 11:26:31,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 325. [2021-08-27 11:26:31,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 321 states have (on average 1.5514018691588785) internal successors, (498), 324 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:31,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 498 transitions. [2021-08-27 11:26:31,216 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 498 transitions. Word has length 91 [2021-08-27 11:26:31,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:31,216 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 498 transitions. [2021-08-27 11:26:31,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:31,216 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 498 transitions. [2021-08-27 11:26:31,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-27 11:26:31,224 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:31,224 INFO L512 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, 1, 1, 1] [2021-08-27 11:26:31,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 11:26:31,225 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:31,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:31,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1994556924, now seen corresponding path program 1 times [2021-08-27 11:26:31,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:31,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745627569] [2021-08-27 11:26:31,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:31,226 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:31,243 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-08-27 11:26:31,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:31,244 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745627569] [2021-08-27 11:26:31,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745627569] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:26:31,244 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:26:31,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:26:31,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438176656] [2021-08-27 11:26:31,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:26:31,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:31,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:26:31,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:31,245 INFO L87 Difference]: Start difference. First operand 325 states and 498 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:31,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:31,350 INFO L93 Difference]: Finished difference Result 679 states and 1043 transitions. [2021-08-27 11:26:31,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:26:31,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-27 11:26:31,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:31,352 INFO L225 Difference]: With dead ends: 679 [2021-08-27 11:26:31,352 INFO L226 Difference]: Without dead ends: 362 [2021-08-27 11:26:31,352 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:31,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-08-27 11:26:31,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 350. [2021-08-27 11:26:31,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 346 states have (on average 1.5375722543352601) internal successors, (532), 349 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:31,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 532 transitions. [2021-08-27 11:26:31,359 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 532 transitions. Word has length 100 [2021-08-27 11:26:31,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:31,360 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 532 transitions. [2021-08-27 11:26:31,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:31,360 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 532 transitions. [2021-08-27 11:26:31,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-27 11:26:31,361 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:31,361 INFO L512 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, 1, 1, 1] [2021-08-27 11:26:31,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 11:26:31,361 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:31,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:31,361 INFO L82 PathProgramCache]: Analyzing trace with hash 98352259, now seen corresponding path program 1 times [2021-08-27 11:26:31,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:31,362 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957095614] [2021-08-27 11:26:31,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:31,362 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:31,377 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-08-27 11:26:31,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:31,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957095614] [2021-08-27 11:26:31,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957095614] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:26:31,378 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:26:31,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:26:31,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992206062] [2021-08-27 11:26:31,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:26:31,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:31,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:26:31,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:31,379 INFO L87 Difference]: Start difference. First operand 350 states and 532 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:31,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:31,476 INFO L93 Difference]: Finished difference Result 704 states and 1072 transitions. [2021-08-27 11:26:31,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:26:31,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-08-27 11:26:31,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:31,477 INFO L225 Difference]: With dead ends: 704 [2021-08-27 11:26:31,477 INFO L226 Difference]: Without dead ends: 362 [2021-08-27 11:26:31,478 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:31,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-08-27 11:26:31,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 350. [2021-08-27 11:26:31,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 346 states have (on average 1.523121387283237) internal successors, (527), 349 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:31,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 527 transitions. [2021-08-27 11:26:31,485 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 527 transitions. Word has length 101 [2021-08-27 11:26:31,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:31,485 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 527 transitions. [2021-08-27 11:26:31,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:31,485 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 527 transitions. [2021-08-27 11:26:31,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-27 11:26:31,486 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:31,486 INFO L512 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, 1, 1, 1] [2021-08-27 11:26:31,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 11:26:31,487 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:31,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:31,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1920296106, now seen corresponding path program 1 times [2021-08-27 11:26:31,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:31,487 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990721777] [2021-08-27 11:26:31,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:31,488 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:31,509 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-08-27 11:26:31,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:31,509 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990721777] [2021-08-27 11:26:31,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990721777] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:26:31,510 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:26:31,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:26:31,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797614900] [2021-08-27 11:26:31,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:26:31,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:31,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:26:31,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:31,511 INFO L87 Difference]: Start difference. First operand 350 states and 527 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:31,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:31,604 INFO L93 Difference]: Finished difference Result 719 states and 1082 transitions. [2021-08-27 11:26:31,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:26:31,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2021-08-27 11:26:31,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:31,606 INFO L225 Difference]: With dead ends: 719 [2021-08-27 11:26:31,606 INFO L226 Difference]: Without dead ends: 377 [2021-08-27 11:26:31,607 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:31,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-08-27 11:26:31,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 374. [2021-08-27 11:26:31,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 370 states have (on average 1.5054054054054054) internal successors, (557), 373 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:31,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 557 transitions. [2021-08-27 11:26:31,615 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 557 transitions. Word has length 120 [2021-08-27 11:26:31,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:31,615 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 557 transitions. [2021-08-27 11:26:31,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:31,615 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 557 transitions. [2021-08-27 11:26:31,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-08-27 11:26:31,616 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:31,616 INFO L512 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, 1, 1, 1] [2021-08-27 11:26:31,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 11:26:31,617 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:31,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:31,617 INFO L82 PathProgramCache]: Analyzing trace with hash -698248943, now seen corresponding path program 1 times [2021-08-27 11:26:31,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:31,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543193954] [2021-08-27 11:26:31,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:31,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:31,634 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-08-27 11:26:31,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:31,634 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543193954] [2021-08-27 11:26:31,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543193954] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:26:31,634 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:26:31,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:26:31,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551954464] [2021-08-27 11:26:31,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:26:31,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:31,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:26:31,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:31,636 INFO L87 Difference]: Start difference. First operand 374 states and 557 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:31,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:31,732 INFO L93 Difference]: Finished difference Result 743 states and 1106 transitions. [2021-08-27 11:26:31,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:26:31,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2021-08-27 11:26:31,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:31,733 INFO L225 Difference]: With dead ends: 743 [2021-08-27 11:26:31,733 INFO L226 Difference]: Without dead ends: 377 [2021-08-27 11:26:31,734 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:31,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-08-27 11:26:31,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 374. [2021-08-27 11:26:31,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 370 states have (on average 1.4891891891891893) internal successors, (551), 373 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:31,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 551 transitions. [2021-08-27 11:26:31,742 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 551 transitions. Word has length 121 [2021-08-27 11:26:31,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:31,742 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 551 transitions. [2021-08-27 11:26:31,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:31,743 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 551 transitions. [2021-08-27 11:26:31,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-08-27 11:26:31,744 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:31,744 INFO L512 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, 1, 1, 1, 1] [2021-08-27 11:26:31,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 11:26:31,744 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:31,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:31,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1095545664, now seen corresponding path program 1 times [2021-08-27 11:26:31,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:31,745 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001319495] [2021-08-27 11:26:31,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:31,745 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:31,763 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-08-27 11:26:31,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:31,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001319495] [2021-08-27 11:26:31,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001319495] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:26:31,763 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:26:31,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:26:31,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672683749] [2021-08-27 11:26:31,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:26:31,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:31,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:26:31,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:31,765 INFO L87 Difference]: Start difference. First operand 374 states and 551 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:31,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:31,889 INFO L93 Difference]: Finished difference Result 785 states and 1156 transitions. [2021-08-27 11:26:31,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:26:31,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2021-08-27 11:26:31,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:31,891 INFO L225 Difference]: With dead ends: 785 [2021-08-27 11:26:31,891 INFO L226 Difference]: Without dead ends: 419 [2021-08-27 11:26:31,892 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:31,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-08-27 11:26:31,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 415. [2021-08-27 11:26:31,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 411 states have (on average 1.4841849148418491) internal successors, (610), 414 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:31,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 610 transitions. [2021-08-27 11:26:31,900 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 610 transitions. Word has length 130 [2021-08-27 11:26:31,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:31,901 INFO L470 AbstractCegarLoop]: Abstraction has 415 states and 610 transitions. [2021-08-27 11:26:31,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:31,901 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 610 transitions. [2021-08-27 11:26:31,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-08-27 11:26:31,902 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:31,902 INFO L512 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, 1, 1, 1, 1] [2021-08-27 11:26:31,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 11:26:31,902 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:31,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:31,903 INFO L82 PathProgramCache]: Analyzing trace with hash 850220610, now seen corresponding path program 1 times [2021-08-27 11:26:31,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:31,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115055189] [2021-08-27 11:26:31,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:31,903 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:31,920 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-08-27 11:26:31,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:31,921 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115055189] [2021-08-27 11:26:31,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115055189] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:26:31,921 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:26:31,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:26:31,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362979267] [2021-08-27 11:26:31,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:26:31,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:31,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:26:31,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:31,922 INFO L87 Difference]: Start difference. First operand 415 states and 610 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:32,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:32,041 INFO L93 Difference]: Finished difference Result 826 states and 1213 transitions. [2021-08-27 11:26:32,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:26:32,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2021-08-27 11:26:32,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:32,042 INFO L225 Difference]: With dead ends: 826 [2021-08-27 11:26:32,042 INFO L226 Difference]: Without dead ends: 417 [2021-08-27 11:26:32,043 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:32,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2021-08-27 11:26:32,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 413. [2021-08-27 11:26:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 409 states have (on average 1.4792176039119804) internal successors, (605), 412 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:32,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 605 transitions. [2021-08-27 11:26:32,052 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 605 transitions. Word has length 131 [2021-08-27 11:26:32,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:32,052 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 605 transitions. [2021-08-27 11:26:32,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:32,052 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 605 transitions. [2021-08-27 11:26:32,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-08-27 11:26:32,053 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:32,053 INFO L512 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, 1, 1, 1] [2021-08-27 11:26:32,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-27 11:26:32,054 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:32,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:32,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1977670215, now seen corresponding path program 1 times [2021-08-27 11:26:32,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:32,054 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514049921] [2021-08-27 11:26:32,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:32,055 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:32,071 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-08-27 11:26:32,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:32,072 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514049921] [2021-08-27 11:26:32,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514049921] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:26:32,072 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:26:32,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:26:32,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725767953] [2021-08-27 11:26:32,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:26:32,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:32,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:26:32,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:32,073 INFO L87 Difference]: Start difference. First operand 413 states and 605 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:32,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:32,175 INFO L93 Difference]: Finished difference Result 843 states and 1235 transitions. [2021-08-27 11:26:32,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:26:32,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2021-08-27 11:26:32,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:32,177 INFO L225 Difference]: With dead ends: 843 [2021-08-27 11:26:32,177 INFO L226 Difference]: Without dead ends: 438 [2021-08-27 11:26:32,177 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:32,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-08-27 11:26:32,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 434. [2021-08-27 11:26:32,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 430 states have (on average 1.4604651162790698) internal successors, (628), 433 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:32,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 628 transitions. [2021-08-27 11:26:32,187 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 628 transitions. Word has length 141 [2021-08-27 11:26:32,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:32,187 INFO L470 AbstractCegarLoop]: Abstraction has 434 states and 628 transitions. [2021-08-27 11:26:32,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:32,187 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 628 transitions. [2021-08-27 11:26:32,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-08-27 11:26:32,188 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:32,188 INFO L512 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, 1, 1, 1] [2021-08-27 11:26:32,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-27 11:26:32,189 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:32,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:32,189 INFO L82 PathProgramCache]: Analyzing trace with hash -2018786222, now seen corresponding path program 1 times [2021-08-27 11:26:32,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:32,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086830850] [2021-08-27 11:26:32,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:32,190 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:32,207 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-08-27 11:26:32,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:32,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086830850] [2021-08-27 11:26:32,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086830850] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:26:32,207 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:26:32,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:26:32,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425323537] [2021-08-27 11:26:32,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:26:32,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:32,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:26:32,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:32,208 INFO L87 Difference]: Start difference. First operand 434 states and 628 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:32,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:32,305 INFO L93 Difference]: Finished difference Result 864 states and 1250 transitions. [2021-08-27 11:26:32,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:26:32,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2021-08-27 11:26:32,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:32,307 INFO L225 Difference]: With dead ends: 864 [2021-08-27 11:26:32,307 INFO L226 Difference]: Without dead ends: 438 [2021-08-27 11:26:32,308 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:32,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-08-27 11:26:32,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 434. [2021-08-27 11:26:32,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 430 states have (on average 1.441860465116279) internal successors, (620), 433 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:32,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 620 transitions. [2021-08-27 11:26:32,317 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 620 transitions. Word has length 142 [2021-08-27 11:26:32,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:32,317 INFO L470 AbstractCegarLoop]: Abstraction has 434 states and 620 transitions. [2021-08-27 11:26:32,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:32,318 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 620 transitions. [2021-08-27 11:26:32,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-08-27 11:26:32,319 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:32,319 INFO L512 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, 1, 1, 1] [2021-08-27 11:26:32,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-27 11:26:32,319 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:32,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:32,320 INFO L82 PathProgramCache]: Analyzing trace with hash -136164042, now seen corresponding path program 1 times [2021-08-27 11:26:32,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:32,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236935638] [2021-08-27 11:26:32,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:32,320 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:32,340 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-08-27 11:26:32,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:32,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236935638] [2021-08-27 11:26:32,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236935638] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:26:32,340 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:26:32,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:26:32,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798083466] [2021-08-27 11:26:32,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:26:32,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:32,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:26:32,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:32,342 INFO L87 Difference]: Start difference. First operand 434 states and 620 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:32,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:32,375 INFO L93 Difference]: Finished difference Result 1280 states and 1824 transitions. [2021-08-27 11:26:32,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:26:32,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2021-08-27 11:26:32,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:32,378 INFO L225 Difference]: With dead ends: 1280 [2021-08-27 11:26:32,378 INFO L226 Difference]: Without dead ends: 854 [2021-08-27 11:26:32,379 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:32,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2021-08-27 11:26:32,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 435. [2021-08-27 11:26:32,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 431 states have (on average 1.4408352668213458) internal successors, (621), 434 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:32,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 621 transitions. [2021-08-27 11:26:32,393 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 621 transitions. Word has length 157 [2021-08-27 11:26:32,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:32,393 INFO L470 AbstractCegarLoop]: Abstraction has 435 states and 621 transitions. [2021-08-27 11:26:32,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:32,394 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 621 transitions. [2021-08-27 11:26:32,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-08-27 11:26:32,395 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:32,395 INFO L512 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, 1, 1, 1] [2021-08-27 11:26:32,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-27 11:26:32,395 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:32,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:32,396 INFO L82 PathProgramCache]: Analyzing trace with hash -877621738, now seen corresponding path program 1 times [2021-08-27 11:26:32,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:32,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108446926] [2021-08-27 11:26:32,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:32,396 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:32,426 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-08-27 11:26:32,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:32,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108446926] [2021-08-27 11:26:32,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108446926] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:26:32,427 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420609494] [2021-08-27 11:26:32,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:32,427 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:26:32,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:26:32,453 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 11:26:32,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-27 11:26:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:32,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 11:26:32,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:26:32,936 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-08-27 11:26:32,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420609494] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:26:32,936 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 11:26:32,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-08-27 11:26:32,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671683945] [2021-08-27 11:26:32,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:26:32,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:32,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:26:32,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:26:32,938 INFO L87 Difference]: Start difference. First operand 435 states and 621 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:33,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:33,175 INFO L93 Difference]: Finished difference Result 1356 states and 1933 transitions. [2021-08-27 11:26:33,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 11:26:33,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2021-08-27 11:26:33,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:33,178 INFO L225 Difference]: With dead ends: 1356 [2021-08-27 11:26:33,178 INFO L226 Difference]: Without dead ends: 904 [2021-08-27 11:26:33,179 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 11:26:33,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2021-08-27 11:26:33,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 533. [2021-08-27 11:26:33,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 529 states have (on average 1.440453686200378) internal successors, (762), 532 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:33,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 762 transitions. [2021-08-27 11:26:33,191 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 762 transitions. Word has length 157 [2021-08-27 11:26:33,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:33,191 INFO L470 AbstractCegarLoop]: Abstraction has 533 states and 762 transitions. [2021-08-27 11:26:33,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:33,192 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 762 transitions. [2021-08-27 11:26:33,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-08-27 11:26:33,193 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:33,193 INFO L512 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, 1, 1, 1] [2021-08-27 11:26:33,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-27 11:26:33,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-08-27 11:26:33,407 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:33,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:33,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1902183378, now seen corresponding path program 1 times [2021-08-27 11:26:33,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:33,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911214566] [2021-08-27 11:26:33,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:33,408 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:33,437 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-08-27 11:26:33,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:33,437 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911214566] [2021-08-27 11:26:33,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911214566] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:26:33,438 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792196260] [2021-08-27 11:26:33,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:33,438 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:26:33,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:26:33,439 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 11:26:33,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-27 11:26:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:33,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 11:26:33,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:26:33,942 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-08-27 11:26:33,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792196260] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:26:33,943 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 11:26:33,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-08-27 11:26:33,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984011997] [2021-08-27 11:26:33,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:26:33,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:33,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:26:33,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:26:33,944 INFO L87 Difference]: Start difference. First operand 533 states and 762 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:34,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:34,158 INFO L93 Difference]: Finished difference Result 1477 states and 2099 transitions. [2021-08-27 11:26:34,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 11:26:34,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2021-08-27 11:26:34,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:34,161 INFO L225 Difference]: With dead ends: 1477 [2021-08-27 11:26:34,161 INFO L226 Difference]: Without dead ends: 952 [2021-08-27 11:26:34,161 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 11:26:34,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2021-08-27 11:26:34,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 588. [2021-08-27 11:26:34,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 584 states have (on average 1.3732876712328768) internal successors, (802), 587 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:34,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 802 transitions. [2021-08-27 11:26:34,174 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 802 transitions. Word has length 159 [2021-08-27 11:26:34,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:34,174 INFO L470 AbstractCegarLoop]: Abstraction has 588 states and 802 transitions. [2021-08-27 11:26:34,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:34,174 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 802 transitions. [2021-08-27 11:26:34,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-08-27 11:26:34,175 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:34,176 INFO L512 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, 1, 1, 1, 1] [2021-08-27 11:26:34,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-27 11:26:34,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-08-27 11:26:34,393 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:34,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:34,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1057676942, now seen corresponding path program 1 times [2021-08-27 11:26:34,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:34,393 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211126392] [2021-08-27 11:26:34,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:34,393 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:34,421 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-27 11:26:34,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:34,422 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211126392] [2021-08-27 11:26:34,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211126392] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:26:34,422 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426981513] [2021-08-27 11:26:34,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:34,422 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:26:34,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:26:34,423 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 11:26:34,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-27 11:26:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:34,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 11:26:34,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:26:34,986 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-27 11:26:34,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426981513] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:26:34,987 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 11:26:34,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-08-27 11:26:34,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051003428] [2021-08-27 11:26:34,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:26:34,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:34,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:26:34,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:26:34,989 INFO L87 Difference]: Start difference. First operand 588 states and 802 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:35,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:35,199 INFO L93 Difference]: Finished difference Result 1485 states and 2023 transitions. [2021-08-27 11:26:35,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 11:26:35,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2021-08-27 11:26:35,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:35,202 INFO L225 Difference]: With dead ends: 1485 [2021-08-27 11:26:35,202 INFO L226 Difference]: Without dead ends: 898 [2021-08-27 11:26:35,203 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 11:26:35,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2021-08-27 11:26:35,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 516. [2021-08-27 11:26:35,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 514 states have (on average 1.3638132295719845) internal successors, (701), 515 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:35,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 701 transitions. [2021-08-27 11:26:35,214 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 701 transitions. Word has length 167 [2021-08-27 11:26:35,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:35,214 INFO L470 AbstractCegarLoop]: Abstraction has 516 states and 701 transitions. [2021-08-27 11:26:35,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:35,215 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 701 transitions. [2021-08-27 11:26:35,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-08-27 11:26:35,216 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:35,216 INFO L512 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, 1, 1, 1, 1] [2021-08-27 11:26:35,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-27 11:26:35,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:26:35,433 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:35,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:35,434 INFO L82 PathProgramCache]: Analyzing trace with hash 2140887848, now seen corresponding path program 1 times [2021-08-27 11:26:35,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:35,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472901382] [2021-08-27 11:26:35,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:35,434 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:35,457 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-08-27 11:26:35,457 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:35,457 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472901382] [2021-08-27 11:26:35,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472901382] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:26:35,458 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:26:35,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:26:35,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20077765] [2021-08-27 11:26:35,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:26:35,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:35,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:26:35,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:35,459 INFO L87 Difference]: Start difference. First operand 516 states and 701 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:35,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:35,478 INFO L93 Difference]: Finished difference Result 1227 states and 1657 transitions. [2021-08-27 11:26:35,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:26:35,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2021-08-27 11:26:35,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:35,480 INFO L225 Difference]: With dead ends: 1227 [2021-08-27 11:26:35,480 INFO L226 Difference]: Without dead ends: 478 [2021-08-27 11:26:35,481 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:35,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2021-08-27 11:26:35,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2021-08-27 11:26:35,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 476 states have (on average 1.3634453781512605) internal successors, (649), 477 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:35,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 649 transitions. [2021-08-27 11:26:35,490 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 649 transitions. Word has length 169 [2021-08-27 11:26:35,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:35,490 INFO L470 AbstractCegarLoop]: Abstraction has 478 states and 649 transitions. [2021-08-27 11:26:35,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:35,491 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 649 transitions. [2021-08-27 11:26:35,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2021-08-27 11:26:35,492 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:35,492 INFO L512 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, 1, 1, 1, 1] [2021-08-27 11:26:35,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-27 11:26:35,492 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:35,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:35,493 INFO L82 PathProgramCache]: Analyzing trace with hash -873338986, now seen corresponding path program 1 times [2021-08-27 11:26:35,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:35,493 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443431243] [2021-08-27 11:26:35,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:35,493 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:35,511 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2021-08-27 11:26:35,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:35,512 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443431243] [2021-08-27 11:26:35,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443431243] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:26:35,512 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:26:35,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:26:35,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863723803] [2021-08-27 11:26:35,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:26:35,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:35,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:26:35,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:35,514 INFO L87 Difference]: Start difference. First operand 478 states and 649 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:35,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:35,606 INFO L93 Difference]: Finished difference Result 965 states and 1305 transitions. [2021-08-27 11:26:35,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:26:35,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 201 [2021-08-27 11:26:35,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:35,607 INFO L225 Difference]: With dead ends: 965 [2021-08-27 11:26:35,608 INFO L226 Difference]: Without dead ends: 483 [2021-08-27 11:26:35,608 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:35,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2021-08-27 11:26:35,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 479. [2021-08-27 11:26:35,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 477 states have (on average 1.3417190775681342) internal successors, (640), 478 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:35,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 640 transitions. [2021-08-27 11:26:35,618 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 640 transitions. Word has length 201 [2021-08-27 11:26:35,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:35,618 INFO L470 AbstractCegarLoop]: Abstraction has 479 states and 640 transitions. [2021-08-27 11:26:35,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:35,618 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 640 transitions. [2021-08-27 11:26:35,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2021-08-27 11:26:35,621 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:35,621 INFO L512 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:26:35,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-27 11:26:35,621 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:35,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:35,622 INFO L82 PathProgramCache]: Analyzing trace with hash 840195126, now seen corresponding path program 1 times [2021-08-27 11:26:35,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:35,622 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560591875] [2021-08-27 11:26:35,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:35,622 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:35,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 700 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2021-08-27 11:26:35,653 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:35,653 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560591875] [2021-08-27 11:26:35,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560591875] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:26:35,653 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:26:35,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:26:35,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983630212] [2021-08-27 11:26:35,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:26:35,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:35,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:26:35,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:35,655 INFO L87 Difference]: Start difference. First operand 479 states and 640 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:35,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:35,755 INFO L93 Difference]: Finished difference Result 986 states and 1311 transitions. [2021-08-27 11:26:35,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:26:35,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 340 [2021-08-27 11:26:35,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:35,757 INFO L225 Difference]: With dead ends: 986 [2021-08-27 11:26:35,757 INFO L226 Difference]: Without dead ends: 515 [2021-08-27 11:26:35,757 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:35,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2021-08-27 11:26:35,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 513. [2021-08-27 11:26:35,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 511 states have (on average 1.3287671232876712) internal successors, (679), 512 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:35,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 679 transitions. [2021-08-27 11:26:35,767 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 679 transitions. Word has length 340 [2021-08-27 11:26:35,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:35,768 INFO L470 AbstractCegarLoop]: Abstraction has 513 states and 679 transitions. [2021-08-27 11:26:35,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:35,768 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 679 transitions. [2021-08-27 11:26:35,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2021-08-27 11:26:35,771 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:35,771 INFO L512 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:26:35,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-27 11:26:35,771 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:35,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:35,772 INFO L82 PathProgramCache]: Analyzing trace with hash 299615116, now seen corresponding path program 1 times [2021-08-27 11:26:35,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:35,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930069676] [2021-08-27 11:26:35,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:35,772 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:35,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 824 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2021-08-27 11:26:35,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:35,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930069676] [2021-08-27 11:26:35,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930069676] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:26:35,805 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:26:35,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:26:35,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373494130] [2021-08-27 11:26:35,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:26:35,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:35,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:26:35,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:35,807 INFO L87 Difference]: Start difference. First operand 513 states and 679 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:35,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:35,900 INFO L93 Difference]: Finished difference Result 1056 states and 1393 transitions. [2021-08-27 11:26:35,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:26:35,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 371 [2021-08-27 11:26:35,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:35,902 INFO L225 Difference]: With dead ends: 1056 [2021-08-27 11:26:35,902 INFO L226 Difference]: Without dead ends: 551 [2021-08-27 11:26:35,903 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:35,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2021-08-27 11:26:35,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 549. [2021-08-27 11:26:35,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 547 states have (on average 1.3162705667276051) internal successors, (720), 548 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:35,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 720 transitions. [2021-08-27 11:26:35,913 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 720 transitions. Word has length 371 [2021-08-27 11:26:35,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:35,914 INFO L470 AbstractCegarLoop]: Abstraction has 549 states and 720 transitions. [2021-08-27 11:26:35,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:35,914 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 720 transitions. [2021-08-27 11:26:35,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2021-08-27 11:26:35,917 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:35,917 INFO L512 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:26:35,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-27 11:26:35,917 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:35,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:35,918 INFO L82 PathProgramCache]: Analyzing trace with hash 521510171, now seen corresponding path program 1 times [2021-08-27 11:26:35,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:35,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012741744] [2021-08-27 11:26:35,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:35,918 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 970 proven. 0 refuted. 0 times theorem prover too weak. 749 trivial. 0 not checked. [2021-08-27 11:26:35,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:35,961 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012741744] [2021-08-27 11:26:35,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012741744] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:26:35,961 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:26:35,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:26:35,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772034718] [2021-08-27 11:26:35,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:26:35,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:35,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:26:35,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:35,962 INFO L87 Difference]: Start difference. First operand 549 states and 720 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:35,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:35,987 INFO L93 Difference]: Finished difference Result 1500 states and 1957 transitions. [2021-08-27 11:26:35,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:26:35,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 404 [2021-08-27 11:26:35,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:35,990 INFO L225 Difference]: With dead ends: 1500 [2021-08-27 11:26:35,990 INFO L226 Difference]: Without dead ends: 959 [2021-08-27 11:26:35,991 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:26:35,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2021-08-27 11:26:36,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 959. [2021-08-27 11:26:36,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 957 states have (on average 1.3009404388714734) internal successors, (1245), 958 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1245 transitions. [2021-08-27 11:26:36,025 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1245 transitions. Word has length 404 [2021-08-27 11:26:36,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:36,026 INFO L470 AbstractCegarLoop]: Abstraction has 959 states and 1245 transitions. [2021-08-27 11:26:36,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:36,026 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1245 transitions. [2021-08-27 11:26:36,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2021-08-27 11:26:36,029 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:26:36,030 INFO L512 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:26:36,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-27 11:26:36,030 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2021-08-27 11:26:36,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:26:36,030 INFO L82 PathProgramCache]: Analyzing trace with hash 810329561, now seen corresponding path program 1 times [2021-08-27 11:26:36,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:26:36,031 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759382873] [2021-08-27 11:26:36,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:36,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:26:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:36,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2021-08-27 11:26:36,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:26:36,075 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759382873] [2021-08-27 11:26:36,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759382873] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:26:36,075 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110676660] [2021-08-27 11:26:36,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:26:36,076 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:26:36,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:26:36,077 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 11:26:36,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-27 11:26:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:26:36,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 11:26:36,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:26:37,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2021-08-27 11:26:37,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110676660] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:26:37,162 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 11:26:37,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-08-27 11:26:37,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650444036] [2021-08-27 11:26:37,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 11:26:37,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:26:37,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 11:26:37,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 11:26:37,163 INFO L87 Difference]: Start difference. First operand 959 states and 1245 transitions. Second operand has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:37,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:26:37,361 INFO L93 Difference]: Finished difference Result 2294 states and 3012 transitions. [2021-08-27 11:26:37,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 11:26:37,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 404 [2021-08-27 11:26:37,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:26:37,362 INFO L225 Difference]: With dead ends: 2294 [2021-08-27 11:26:37,362 INFO L226 Difference]: Without dead ends: 0 [2021-08-27 11:26:37,365 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 13.3ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:26:37,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-27 11:26:37,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-27 11:26:37,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:37,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-27 11:26:37,366 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 404 [2021-08-27 11:26:37,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:26:37,366 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 11:26:37,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:26:37,367 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-27 11:26:37,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-27 11:26:37,369 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:26:37,369 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:26:37,369 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:26:37,369 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:26:37,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-27 11:26:37,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:26:37,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-27 11:26:37,607 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:37,627 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:37,628 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:37,643 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:37,651 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:37,664 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:37,678 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:37,679 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:37,694 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:37,709 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:37,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:37,729 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:37,741 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:37,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:37,931 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:37,946 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:37,962 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:37,962 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:37,977 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:38,198 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:38,199 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:38,199 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:38,199 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:38,213 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:38,214 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:38,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:38,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:38,242 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:38,257 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-27 11:26:43,417 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 262) no Hoare annotation was computed. [2021-08-27 11:26:43,417 INFO L853 garLoopResultBuilder]: At program point L168(lines 167 609) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse16 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= 8192 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 3 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse14 .cse15))) [2021-08-27 11:26:43,417 INFO L853 garLoopResultBuilder]: At program point L135(lines 128 622) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= 8192 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse14 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse11 .cse12 .cse13 .cse14 .cse15))) [2021-08-27 11:26:43,418 INFO L857 garLoopResultBuilder]: For program point L102(line 102) no Hoare annotation was computed. [2021-08-27 11:26:43,418 INFO L857 garLoopResultBuilder]: For program point L631(lines 631 659) no Hoare annotation was computed. [2021-08-27 11:26:43,418 INFO L857 garLoopResultBuilder]: For program point L466(lines 466 470) no Hoare annotation was computed. [2021-08-27 11:26:43,418 INFO L857 garLoopResultBuilder]: For program point L632(lines 632 656) no Hoare annotation was computed. [2021-08-27 11:26:43,418 INFO L857 garLoopResultBuilder]: For program point L566(lines 566 570) no Hoare annotation was computed. [2021-08-27 11:26:43,418 INFO L857 garLoopResultBuilder]: For program point L500(lines 500 504) no Hoare annotation was computed. [2021-08-27 11:26:43,418 INFO L857 garLoopResultBuilder]: For program point L566-2(lines 566 570) no Hoare annotation was computed. [2021-08-27 11:26:43,418 INFO L857 garLoopResultBuilder]: For program point L500-2(lines 211 592) no Hoare annotation was computed. [2021-08-27 11:26:43,418 INFO L857 garLoopResultBuilder]: For program point L203(lines 203 597) no Hoare annotation was computed. [2021-08-27 11:26:43,418 INFO L857 garLoopResultBuilder]: For program point L170(lines 170 608) no Hoare annotation was computed. [2021-08-27 11:26:43,418 INFO L857 garLoopResultBuilder]: For program point L137(lines 137 619) no Hoare annotation was computed. [2021-08-27 11:26:43,418 INFO L857 garLoopResultBuilder]: For program point L104(lines 104 630) no Hoare annotation was computed. [2021-08-27 11:26:43,418 INFO L857 garLoopResultBuilder]: For program point L666(lines 666 670) no Hoare annotation was computed. [2021-08-27 11:26:43,418 INFO L857 garLoopResultBuilder]: For program point L633(lines 633 642) no Hoare annotation was computed. [2021-08-27 11:26:43,418 INFO L857 garLoopResultBuilder]: For program point L666-2(lines 666 670) no Hoare annotation was computed. [2021-08-27 11:26:43,418 INFO L857 garLoopResultBuilder]: For program point L633-2(lines 632 654) no Hoare annotation was computed. [2021-08-27 11:26:43,418 INFO L857 garLoopResultBuilder]: For program point L270(lines 270 274) no Hoare annotation was computed. [2021-08-27 11:26:43,418 INFO L853 garLoopResultBuilder]: At program point L204(lines 200 598) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse3 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 24576 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse5) (and .cse0 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 .cse3 .cse4 .cse5))) [2021-08-27 11:26:43,419 INFO L853 garLoopResultBuilder]: At program point L105(lines 104 630) the Hoare annotation is: false [2021-08-27 11:26:43,419 INFO L857 garLoopResultBuilder]: For program point L304(lines 304 308) no Hoare annotation was computed. [2021-08-27 11:26:43,419 INFO L857 garLoopResultBuilder]: For program point L304-2(lines 211 592) no Hoare annotation was computed. [2021-08-27 11:26:43,419 INFO L857 garLoopResultBuilder]: For program point L635(lines 635 639) no Hoare annotation was computed. [2021-08-27 11:26:43,419 INFO L857 garLoopResultBuilder]: For program point L206(lines 206 596) no Hoare annotation was computed. [2021-08-27 11:26:43,419 INFO L857 garLoopResultBuilder]: For program point L173(lines 173 607) no Hoare annotation was computed. [2021-08-27 11:26:43,419 INFO L857 garLoopResultBuilder]: For program point L140(lines 140 618) no Hoare annotation was computed. [2021-08-27 11:26:43,419 INFO L857 garLoopResultBuilder]: For program point L107(lines 107 629) no Hoare annotation was computed. [2021-08-27 11:26:43,419 INFO L857 garLoopResultBuilder]: For program point L339(lines 339 343) no Hoare annotation was computed. [2021-08-27 11:26:43,419 INFO L857 garLoopResultBuilder]: For program point L339-2(lines 211 592) no Hoare annotation was computed. [2021-08-27 11:26:43,419 INFO L853 garLoopResultBuilder]: At program point L207(lines 206 596) the Hoare annotation is: (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) [2021-08-27 11:26:43,419 INFO L853 garLoopResultBuilder]: At program point L174(lines 170 608) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640) (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) [2021-08-27 11:26:43,419 INFO L853 garLoopResultBuilder]: At program point L141(lines 137 619) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= 8192 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse12 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-08-27 11:26:43,419 INFO L857 garLoopResultBuilder]: For program point L75(lines 75 83) no Hoare annotation was computed. [2021-08-27 11:26:43,419 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 262) no Hoare annotation was computed. [2021-08-27 11:26:43,419 INFO L857 garLoopResultBuilder]: For program point L439(lines 439 451) no Hoare annotation was computed. [2021-08-27 11:26:43,419 INFO L853 garLoopResultBuilder]: At program point L406(lines 397 417) the Hoare annotation is: (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= 8192 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) [2021-08-27 11:26:43,420 INFO L857 garLoopResultBuilder]: For program point L439-2(lines 439 451) no Hoare annotation was computed. [2021-08-27 11:26:43,420 INFO L857 garLoopResultBuilder]: For program point L176(lines 176 606) no Hoare annotation was computed. [2021-08-27 11:26:43,420 INFO L857 garLoopResultBuilder]: For program point L143(lines 143 617) no Hoare annotation was computed. [2021-08-27 11:26:43,420 INFO L857 garLoopResultBuilder]: For program point L110(lines 110 628) no Hoare annotation was computed. [2021-08-27 11:26:43,420 INFO L853 garLoopResultBuilder]: At program point L210(lines 209 595) the Hoare annotation is: (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) [2021-08-27 11:26:43,420 INFO L857 garLoopResultBuilder]: For program point L78(lines 78 82) no Hoare annotation was computed. [2021-08-27 11:26:43,420 INFO L857 garLoopResultBuilder]: For program point L78-2(lines 75 83) no Hoare annotation was computed. [2021-08-27 11:26:43,420 INFO L857 garLoopResultBuilder]: For program point L541(lines 541 546) no Hoare annotation was computed. [2021-08-27 11:26:43,420 INFO L857 garLoopResultBuilder]: For program point L442(lines 442 447) no Hoare annotation was computed. [2021-08-27 11:26:43,420 INFO L857 garLoopResultBuilder]: For program point L409(lines 409 413) no Hoare annotation was computed. [2021-08-27 11:26:43,420 INFO L857 garLoopResultBuilder]: For program point L244(lines 244 249) no Hoare annotation was computed. [2021-08-27 11:26:43,420 INFO L857 garLoopResultBuilder]: For program point L179(lines 179 605) no Hoare annotation was computed. [2021-08-27 11:26:43,420 INFO L857 garLoopResultBuilder]: For program point L146(lines 146 616) no Hoare annotation was computed. [2021-08-27 11:26:43,420 INFO L857 garLoopResultBuilder]: For program point L113(lines 113 627) no Hoare annotation was computed. [2021-08-27 11:26:43,420 INFO L857 garLoopResultBuilder]: For program point L576(lines 576 586) no Hoare annotation was computed. [2021-08-27 11:26:43,420 INFO L857 garLoopResultBuilder]: For program point L576-1(lines 576 586) no Hoare annotation was computed. [2021-08-27 11:26:43,420 INFO L857 garLoopResultBuilder]: For program point L510(lines 510 514) no Hoare annotation was computed. [2021-08-27 11:26:43,420 INFO L857 garLoopResultBuilder]: For program point L510-2(lines 510 514) no Hoare annotation was computed. [2021-08-27 11:26:43,420 INFO L853 garLoopResultBuilder]: At program point L180(lines 176 606) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse1 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse0 .cse1) (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2021-08-27 11:26:43,421 INFO L853 garLoopResultBuilder]: At program point L147(lines 143 617) the Hoare annotation is: (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (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 8529)) (not (= 8192 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) [2021-08-27 11:26:43,421 INFO L857 garLoopResultBuilder]: For program point L478(lines 478 482) no Hoare annotation was computed. [2021-08-27 11:26:43,421 INFO L853 garLoopResultBuilder]: At program point L214(lines 107 629) the Hoare annotation is: false [2021-08-27 11:26:43,421 INFO L860 garLoopResultBuilder]: At program point L677(lines 67 679) the Hoare annotation is: true [2021-08-27 11:26:43,421 INFO L857 garLoopResultBuilder]: For program point L644(lines 644 650) no Hoare annotation was computed. [2021-08-27 11:26:43,421 INFO L857 garLoopResultBuilder]: For program point L347(lines 347 379) no Hoare annotation was computed. [2021-08-27 11:26:43,421 INFO L857 garLoopResultBuilder]: For program point L314(lines 314 318) no Hoare annotation was computed. [2021-08-27 11:26:43,421 INFO L857 garLoopResultBuilder]: For program point L314-2(lines 314 318) no Hoare annotation was computed. [2021-08-27 11:26:43,421 INFO L857 garLoopResultBuilder]: For program point L182(lines 182 604) no Hoare annotation was computed. [2021-08-27 11:26:43,421 INFO L857 garLoopResultBuilder]: For program point L149(lines 149 615) no Hoare annotation was computed. [2021-08-27 11:26:43,421 INFO L857 garLoopResultBuilder]: For program point L116(lines 116 626) no Hoare annotation was computed. [2021-08-27 11:26:43,421 INFO L860 garLoopResultBuilder]: At program point L678(lines 12 680) the Hoare annotation is: true [2021-08-27 11:26:43,421 INFO L857 garLoopResultBuilder]: For program point L579(lines 579 583) no Hoare annotation was computed. [2021-08-27 11:26:43,421 INFO L857 garLoopResultBuilder]: For program point L85(lines 85 93) no Hoare annotation was computed. [2021-08-27 11:26:43,421 INFO L857 garLoopResultBuilder]: For program point L85-1(lines 67 679) no Hoare annotation was computed. [2021-08-27 11:26:43,421 INFO L857 garLoopResultBuilder]: For program point L350(lines 350 378) no Hoare annotation was computed. [2021-08-27 11:26:43,421 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-27 11:26:43,421 INFO L857 garLoopResultBuilder]: For program point L350-1(lines 350 378) no Hoare annotation was computed. [2021-08-27 11:26:43,421 INFO L857 garLoopResultBuilder]: For program point L251(lines 251 264) no Hoare annotation was computed. [2021-08-27 11:26:43,421 INFO L857 garLoopResultBuilder]: For program point L185(lines 185 603) no Hoare annotation was computed. [2021-08-27 11:26:43,422 INFO L857 garLoopResultBuilder]: For program point L152(lines 152 614) no Hoare annotation was computed. [2021-08-27 11:26:43,422 INFO L857 garLoopResultBuilder]: For program point L119(lines 119 625) no Hoare annotation was computed. [2021-08-27 11:26:43,422 INFO L857 garLoopResultBuilder]: For program point L86(lines 86 90) no Hoare annotation was computed. [2021-08-27 11:26:43,422 INFO L857 garLoopResultBuilder]: For program point L351(lines 351 375) no Hoare annotation was computed. [2021-08-27 11:26:43,422 INFO L857 garLoopResultBuilder]: For program point L219(lines 219 223) no Hoare annotation was computed. [2021-08-27 11:26:43,422 INFO L853 garLoopResultBuilder]: At program point L186(lines 182 604) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse1 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse0 .cse1) (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2021-08-27 11:26:43,422 INFO L853 garLoopResultBuilder]: At program point L153(lines 149 615) the Hoare annotation is: (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= 8192 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) [2021-08-27 11:26:43,422 INFO L857 garLoopResultBuilder]: For program point L219-2(lines 211 592) no Hoare annotation was computed. [2021-08-27 11:26:43,422 INFO L857 garLoopResultBuilder]: For program point L253(lines 253 258) no Hoare annotation was computed. [2021-08-27 11:26:43,422 INFO L857 garLoopResultBuilder]: For program point L551(lines 551 559) no Hoare annotation was computed. [2021-08-27 11:26:43,422 INFO L857 garLoopResultBuilder]: For program point L287(lines 287 291) no Hoare annotation was computed. [2021-08-27 11:26:43,422 INFO L857 garLoopResultBuilder]: For program point L287-2(lines 211 592) no Hoare annotation was computed. [2021-08-27 11:26:43,422 INFO L857 garLoopResultBuilder]: For program point L188(lines 188 602) no Hoare annotation was computed. [2021-08-27 11:26:43,422 INFO L857 garLoopResultBuilder]: For program point L155(lines 155 613) no Hoare annotation was computed. [2021-08-27 11:26:43,422 INFO L857 garLoopResultBuilder]: For program point L122(lines 122 624) no Hoare annotation was computed. [2021-08-27 11:26:43,422 INFO L857 garLoopResultBuilder]: For program point L387(lines 387 418) no Hoare annotation was computed. [2021-08-27 11:26:43,422 INFO L857 garLoopResultBuilder]: For program point L354(lines 354 374) no Hoare annotation was computed. [2021-08-27 11:26:43,422 INFO L853 garLoopResultBuilder]: At program point L123(lines 119 625) the Hoare annotation is: false [2021-08-27 11:26:43,423 INFO L857 garLoopResultBuilder]: For program point L388(lines 388 394) no Hoare annotation was computed. [2021-08-27 11:26:43,423 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-27 11:26:43,423 INFO L857 garLoopResultBuilder]: For program point L554(lines 554 558) no Hoare annotation was computed. [2021-08-27 11:26:43,423 INFO L857 garLoopResultBuilder]: For program point L521(lines 521 526) no Hoare annotation was computed. [2021-08-27 11:26:43,423 INFO L857 garLoopResultBuilder]: For program point L356(lines 356 360) no Hoare annotation was computed. [2021-08-27 11:26:43,423 INFO L857 garLoopResultBuilder]: For program point L323-1(lines 323 332) no Hoare annotation was computed. [2021-08-27 11:26:43,423 INFO L857 garLoopResultBuilder]: For program point L356-2(lines 354 372) no Hoare annotation was computed. [2021-08-27 11:26:43,423 INFO L857 garLoopResultBuilder]: For program point L191(lines 191 601) no Hoare annotation was computed. [2021-08-27 11:26:43,423 INFO L857 garLoopResultBuilder]: For program point L158(lines 158 612) no Hoare annotation was computed. [2021-08-27 11:26:43,423 INFO L857 garLoopResultBuilder]: For program point L125(lines 125 623) no Hoare annotation was computed. [2021-08-27 11:26:43,423 INFO L853 garLoopResultBuilder]: At program point L555(lines 67 679) the Hoare annotation is: (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) [2021-08-27 11:26:43,423 INFO L857 garLoopResultBuilder]: For program point L489(lines 489 493) no Hoare annotation was computed. [2021-08-27 11:26:43,423 INFO L853 garLoopResultBuilder]: At program point L192(lines 188 602) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse5 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 24576 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse7) (and .cse0 .cse1 .cse2 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 .cse4 .cse5 .cse6 .cse7))) [2021-08-27 11:26:43,423 INFO L853 garLoopResultBuilder]: At program point L159(lines 155 613) the Hoare annotation is: (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= 8192 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) [2021-08-27 11:26:43,423 INFO L853 garLoopResultBuilder]: At program point L126(lines 125 623) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= 8192 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse14 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse11 .cse12 .cse13 .cse14 .cse15))) [2021-08-27 11:26:43,423 INFO L857 garLoopResultBuilder]: For program point L457(lines 457 461) no Hoare annotation was computed. [2021-08-27 11:26:43,423 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 260) no Hoare annotation was computed. [2021-08-27 11:26:43,423 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-27 11:26:43,424 INFO L857 garLoopResultBuilder]: For program point L260(line 260) no Hoare annotation was computed. [2021-08-27 11:26:43,424 INFO L857 garLoopResultBuilder]: For program point L260-1(line 260) no Hoare annotation was computed. [2021-08-27 11:26:43,424 INFO L857 garLoopResultBuilder]: For program point L194(lines 194 600) no Hoare annotation was computed. [2021-08-27 11:26:43,424 INFO L857 garLoopResultBuilder]: For program point L161(lines 161 611) no Hoare annotation was computed. [2021-08-27 11:26:43,424 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 260) no Hoare annotation was computed. [2021-08-27 11:26:43,424 INFO L857 garLoopResultBuilder]: For program point L128(lines 128 622) no Hoare annotation was computed. [2021-08-27 11:26:43,424 INFO L860 garLoopResultBuilder]: At program point L690(lines 681 692) the Hoare annotation is: true [2021-08-27 11:26:43,424 INFO L857 garLoopResultBuilder]: For program point L327(lines 327 331) no Hoare annotation was computed. [2021-08-27 11:26:43,424 INFO L857 garLoopResultBuilder]: For program point L262(line 262) no Hoare annotation was computed. [2021-08-27 11:26:43,424 INFO L857 garLoopResultBuilder]: For program point L262-1(line 262) no Hoare annotation was computed. [2021-08-27 11:26:43,424 INFO L853 garLoopResultBuilder]: At program point L593(lines 101 661) the Hoare annotation is: (let ((.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse11 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= 8192 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse0 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 24576 ULTIMATE.start_ssl3_accept_~s__state~0))) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse0 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse14 .cse9 .cse10) (and .cse1 .cse2 (= 3 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse0 .cse13 .cse9 .cse10))) [2021-08-27 11:26:43,424 INFO L857 garLoopResultBuilder]: For program point L560(lines 560 564) no Hoare annotation was computed. [2021-08-27 11:26:43,424 INFO L857 garLoopResultBuilder]: For program point L428(lines 428 432) no Hoare annotation was computed. [2021-08-27 11:26:43,424 INFO L853 garLoopResultBuilder]: At program point L362(lines 344 380) the Hoare annotation is: (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= 8192 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) [2021-08-27 11:26:43,424 INFO L857 garLoopResultBuilder]: For program point L197(lines 197 599) no Hoare annotation was computed. [2021-08-27 11:26:43,424 INFO L857 garLoopResultBuilder]: For program point L164(lines 164 610) no Hoare annotation was computed. [2021-08-27 11:26:43,424 INFO L857 garLoopResultBuilder]: For program point L131(lines 131 621) no Hoare annotation was computed. [2021-08-27 11:26:43,424 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-27 11:26:43,425 INFO L857 garLoopResultBuilder]: For program point L528(lines 528 532) no Hoare annotation was computed. [2021-08-27 11:26:43,425 INFO L857 garLoopResultBuilder]: For program point L462(lines 462 473) no Hoare annotation was computed. [2021-08-27 11:26:43,425 INFO L857 garLoopResultBuilder]: For program point L528-2(lines 211 592) no Hoare annotation was computed. [2021-08-27 11:26:43,425 INFO L853 garLoopResultBuilder]: At program point L396(lines 387 418) the Hoare annotation is: (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= 8192 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) [2021-08-27 11:26:43,425 INFO L857 garLoopResultBuilder]: For program point L231(lines 231 242) no Hoare annotation was computed. [2021-08-27 11:26:43,425 INFO L853 garLoopResultBuilder]: At program point L198(lines 194 600) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse3 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 24576 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse5) (and .cse0 .cse1 .cse2 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 .cse4 .cse5))) [2021-08-27 11:26:43,425 INFO L853 garLoopResultBuilder]: At program point L165(lines 161 611) the Hoare annotation is: (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (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 8529)) (not (= 8192 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) [2021-08-27 11:26:43,426 INFO L857 garLoopResultBuilder]: For program point L231-2(lines 231 242) no Hoare annotation was computed. [2021-08-27 11:26:43,426 INFO L857 garLoopResultBuilder]: For program point L364(lines 364 368) no Hoare annotation was computed. [2021-08-27 11:26:43,426 INFO L860 garLoopResultBuilder]: At program point L662(lines 100 663) the Hoare annotation is: true [2021-08-27 11:26:43,426 INFO L857 garLoopResultBuilder]: For program point L398(lines 398 404) no Hoare annotation was computed. [2021-08-27 11:26:43,426 INFO L857 garLoopResultBuilder]: For program point L233(lines 233 238) no Hoare annotation was computed. [2021-08-27 11:26:43,426 INFO L857 garLoopResultBuilder]: For program point L200(lines 200 598) no Hoare annotation was computed. [2021-08-27 11:26:43,426 INFO L857 garLoopResultBuilder]: For program point L167(lines 167 609) no Hoare annotation was computed. [2021-08-27 11:26:43,426 INFO L857 garLoopResultBuilder]: For program point L134(lines 134 620) no Hoare annotation was computed. [2021-08-27 11:26:43,426 INFO L853 garLoopResultBuilder]: At program point L101-2(lines 101 661) the Hoare annotation is: (let ((.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse11 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= 8192 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse0 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 24576 ULTIMATE.start_ssl3_accept_~s__state~0))) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse0 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse14 .cse9 .cse10) (and .cse1 .cse2 (= 3 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse0 .cse13 .cse9 .cse10))) [2021-08-27 11:26:43,429 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 11:26:43,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 11:26:43 BoogieIcfgContainer [2021-08-27 11:26:43,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 11:26:43,448 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 11:26:43,448 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 11:26:43,449 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 11:26:43,449 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 11:26:29" (3/4) ... [2021-08-27 11:26:43,451 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-27 11:26:43,463 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-08-27 11:26:43,464 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-27 11:26:43,464 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-27 11:26:43,465 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-27 11:26:43,506 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 11:26:43,506 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 11:26:43,507 INFO L168 Benchmark]: Toolchain (without parser) took 15447.63 ms. Allocated memory was 83.9 MB in the beginning and 346.0 MB in the end (delta: 262.1 MB). Free memory was 48.7 MB in the beginning and 313.6 MB in the end (delta: -264.9 MB). Peak memory consumption was 195.2 MB. Max. memory is 16.1 GB. [2021-08-27 11:26:43,508 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 83.9 MB. Free memory was 66.0 MB in the beginning and 65.9 MB in the end (delta: 71.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 11:26:43,508 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.19 ms. Allocated memory is still 83.9 MB. Free memory was 48.6 MB in the beginning and 65.3 MB in the end (delta: -16.7 MB). Peak memory consumption was 8.3 MB. Max. memory is 16.1 GB. [2021-08-27 11:26:43,508 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.10 ms. Allocated memory is still 83.9 MB. Free memory was 65.3 MB in the beginning and 62.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 11:26:43,508 INFO L168 Benchmark]: Boogie Preprocessor took 20.66 ms. Allocated memory is still 83.9 MB. Free memory was 62.5 MB in the beginning and 60.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 11:26:43,509 INFO L168 Benchmark]: RCFGBuilder took 684.22 ms. Allocated memory is still 83.9 MB. Free memory was 60.4 MB in the beginning and 38.8 MB in the end (delta: 21.7 MB). Peak memory consumption was 29.9 MB. Max. memory is 16.1 GB. [2021-08-27 11:26:43,509 INFO L168 Benchmark]: TraceAbstraction took 14370.63 ms. Allocated memory was 83.9 MB in the beginning and 346.0 MB in the end (delta: 262.1 MB). Free memory was 38.4 MB in the beginning and 119.7 MB in the end (delta: -81.3 MB). Peak memory consumption was 189.6 MB. Max. memory is 16.1 GB. [2021-08-27 11:26:43,509 INFO L168 Benchmark]: Witness Printer took 58.13 ms. Allocated memory is still 346.0 MB. Free memory was 119.7 MB in the beginning and 313.6 MB in the end (delta: -193.9 MB). Peak memory consumption was 2.2 MB. Max. memory is 16.1 GB. [2021-08-27 11:26:43,510 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 83.9 MB. Free memory was 66.0 MB in the beginning and 65.9 MB in the end (delta: 71.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 275.19 ms. Allocated memory is still 83.9 MB. Free memory was 48.6 MB in the beginning and 65.3 MB in the end (delta: -16.7 MB). Peak memory consumption was 8.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 33.10 ms. Allocated memory is still 83.9 MB. Free memory was 65.3 MB in the beginning and 62.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 20.66 ms. Allocated memory is still 83.9 MB. Free memory was 62.5 MB in the beginning and 60.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 684.22 ms. Allocated memory is still 83.9 MB. Free memory was 60.4 MB in the beginning and 38.8 MB in the end (delta: 21.7 MB). Peak memory consumption was 29.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14370.63 ms. Allocated memory was 83.9 MB in the beginning and 346.0 MB in the end (delta: 262.1 MB). Free memory was 38.4 MB in the beginning and 119.7 MB in the end (delta: -81.3 MB). Peak memory consumption was 189.6 MB. Max. memory is 16.1 GB. * Witness Printer took 58.13 ms. Allocated memory is still 346.0 MB. Free memory was 119.7 MB in the beginning and 313.6 MB in the end (delta: -193.9 MB). Peak memory consumption was 2.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 260]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 260]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 262]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 262]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 147 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 14319.6ms, OverallIterations: 32, TraceHistogramMax: 14, EmptinessCheckTime: 46.7ms, AutomataDifference: 3594.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 5814.9ms, InitialAbstractionConstructionTime: 24.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 5404 SDtfs, 4672 SDslu, 2467 SDs, 0 SdLazy, 3303 SolverSat, 1069 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2221.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 991 GetRequests, 949 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 84.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=959occurred in iteration=31, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 284.6ms AutomataMinimizationTime, 32 MinimizatonAttempts, 1656 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 198 NumberOfFragments, 1818 HoareAnnotationTreeSize, 29 FomulaSimplifications, 243882 FormulaSimplificationTreeSizeReduction, 662.8ms HoareSimplificationTime, 29 FomulaSimplificationsInter, 91354 FormulaSimplificationTreeSizeReductionInter, 5138.4ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 108.6ms SsaConstructionTime, 314.2ms SatisfiabilityAnalysisTime, 2406.3ms InterpolantComputationTime, 5145 NumberOfCodeBlocks, 5145 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 5109 ConstructedInterpolants, 0 QuantifiedInterpolants, 8036 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1674 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 36 InterpolantComputations, 28 PerfectInterpolantSequences, 11171/11219 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((!(8576 == s__state) && s__state <= 8640) && 8576 <= s__state) || ((s__state <= 8640 && 8576 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8192 == s__state)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8195)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512)) || ((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8192 == s__state)) && !(8560 == s__state)) && !(s__hit == 0)) && !(s__state == 8195)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512)) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: (((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && 3 == s__s3__tmp__next_state___0) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8192 == s__state)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8195)) && !(s__state == 8545)) && !(s__state == 8528)) && !(s__state == 8512)) || (((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8192 == s__state)) && !(8560 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && !(s__state == 8195)) && !(s__state == 8545)) && !(s__state == 8528)) && !(s__state == 8512))) || (((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8192 == s__state)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8195)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8528)) && !(s__state == 8512)) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: ((((((!(s__state == 8673) && !(s__state == 8672)) && !(s__state == 16384)) && 8576 <= s__state) && !(12292 == s__state)) && !(s__hit == 0)) && !(24576 == s__state)) || ((((((!(s__state == 8673) && !(s__state == 8672)) && !(s__state == 16384)) && !(8576 == s__state)) && 8576 <= s__state) && !(12292 == s__state)) && !(24576 == s__state)) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8192 == s__state)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8195)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512)) || ((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8192 == s__state)) && !(8560 == s__state)) && !(s__hit == 0)) && !(s__state == 8195)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512)) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(12292 == s__state) - InvariantResult [Line: 397]: Loop Invariant Derived loop invariant: (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8192 == s__state)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8195)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8192 == s__state)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8195)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512) - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 149]: Loop Invariant Derived loop invariant: (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(8192 == s__state)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8195)) && !(s__state == 8545)) && !(8448 == s__state)) && !(s__state == 8512) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: ((((((!(s__state == 16384) && !(s__state == 8657)) && !(s__state == 8656)) && 8576 <= s__state) && !(12292 == s__state)) && !(s__hit == 0)) && !(24576 == s__state)) || ((((((!(s__state == 16384) && !(8576 == s__state)) && !(s__state == 8657)) && !(s__state == 8656)) && 8576 <= s__state) && !(12292 == s__state)) && !(24576 == s__state)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: !(12292 == s__state) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: ((((((((((!(s__state == 8673) && !(s__state == 16384)) && !(8576 == s__state)) && !(s__state == 8657)) && 8576 <= s__state) && !(12292 == s__state)) && !(24576 == s__state)) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8192 == s__state)) && !(8576 == s__state)) && !(s__state == 8195)) && !(s__state == 8545)) && !(8448 == s__state))) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8192 == s__state)) && s__state <= 8640) && !(s__state == 8195)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576)) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8192 == s__state)) && !(s__hit == 0)) && !(s__state == 8195)) && !(s__state == 8545)) && !(8448 == s__state))) || ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8192 == s__state)) && s__state <= 8640) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && !(s__state == 8195)) && !(s__state == 8545))) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && 3 == s__s3__tmp__next_state___0) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8192 == s__state)) && !(8576 == s__state)) && s__state <= 8640) && !(s__state == 8195)) && !(s__state == 8545)) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8192 == s__state)) && !(8576 == s__state)) && !(s__state == 8195)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8480) && s__state <= 8576) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8192 == s__state)) && !(8560 == s__state)) && !(s__hit == 0)) && !(s__state == 8195)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512)) || ((((((((((((((!(s__state == 8480) && s__state <= 8576) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8192 == s__state)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8195)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512)) - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 143]: Loop Invariant Derived loop invariant: (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8192 == s__state)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8195)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: ((((((((((!(s__state == 8673) && !(s__state == 16384)) && !(8576 == s__state)) && !(s__state == 8657)) && 8576 <= s__state) && !(12292 == s__state)) && !(24576 == s__state)) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8192 == s__state)) && !(8576 == s__state)) && !(s__state == 8195)) && !(s__state == 8545)) && !(8448 == s__state))) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8192 == s__state)) && s__state <= 8640) && !(s__state == 8195)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576)) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8192 == s__state)) && !(s__hit == 0)) && !(s__state == 8195)) && !(s__state == 8545)) && !(8448 == s__state))) || ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8192 == s__state)) && s__state <= 8640) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && !(s__state == 8195)) && !(s__state == 8545))) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && 3 == s__s3__tmp__next_state___0) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8192 == s__state)) && !(8576 == s__state)) && s__state <= 8640) && !(s__state == 8195)) && !(s__state == 8545)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 681]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8192 == s__state)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8195)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8512) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(8192 == s__state)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8195)) && !(s__state == 8545)) && !(8448 == s__state)) && !(s__state == 8512) - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: ((((((((!(s__state == 8673) && !(s__state == 8672)) && !(s__state == 16384)) && !(s__state == 8657)) && !(s__state == 8656)) && 8576 <= s__state) && !(12292 == s__state)) && !(s__hit == 0)) && !(24576 == s__state)) || ((((((((!(s__state == 8673) && !(s__state == 8672)) && !(s__state == 16384)) && !(8576 == s__state)) && !(s__state == 8657)) && !(s__state == 8656)) && 8576 <= s__state) && !(12292 == s__state)) && !(24576 == s__state)) - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: !(12292 == s__state) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: s__state <= 8640 && 8576 <= s__state - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: ((!(8576 == s__state) && s__state <= 8640) && 8576 <= s__state) || ((s__state <= 8640 && 8576 <= s__state) && !(s__hit == 0)) RESULT: Ultimate proved your program to be correct! [2021-08-27 11:26:43,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...