./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-zilu/benchmark03_linear.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/loop-zilu/benchmark03_linear.i -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 36118893e72f01ac34f08ae30ac9eb83d0074096398f7228653cb15beb7a3f4b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:10:43,245 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:10:43,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:10:43,272 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:10:43,273 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:10:43,276 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:10:43,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:10:43,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:10:43,284 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:10:43,287 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:10:43,288 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:10:43,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:10:43,289 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:10:43,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:10:43,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:10:43,293 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:10:43,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:10:43,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:10:43,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:10:43,299 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:10:43,300 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:10:43,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:10:43,305 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:10:43,305 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:10:43,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:10:43,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:10:43,311 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:10:43,312 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:10:43,312 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:10:43,313 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:10:43,313 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:10:43,314 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:10:43,315 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:10:43,315 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:10:43,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:10:43,316 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:10:43,318 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:10:43,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:10:43,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:10:43,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:10:43,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:10:43,320 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-02-21 03:10:43,341 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:10:43,341 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:10:43,342 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:10:43,342 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:10:43,343 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:10:43,343 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:10:43,343 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:10:43,343 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:10:43,344 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:10:43,344 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:10:43,344 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:10:43,345 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:10:43,345 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:10:43,345 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:10:43,345 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:10:43,345 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:10:43,345 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:10:43,345 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:10:43,345 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:10:43,346 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:10:43,346 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:10:43,346 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:10:43,346 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:10:43,346 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:10:43,346 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:10:43,346 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:10:43,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:10:43,347 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:10:43,347 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:10:43,347 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:10:43,347 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:10:43,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:10:43,348 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:10:43,348 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 -> 36118893e72f01ac34f08ae30ac9eb83d0074096398f7228653cb15beb7a3f4b [2022-02-21 03:10:43,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:10:43,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:10:43,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:10:43,590 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:10:43,591 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:10:43,592 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-zilu/benchmark03_linear.i [2022-02-21 03:10:43,633 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e902e6c24/48c20bd63e5947fd9c002055dcb9655e/FLAGf63acf068 [2022-02-21 03:10:43,970 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:10:43,970 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark03_linear.i [2022-02-21 03:10:43,978 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e902e6c24/48c20bd63e5947fd9c002055dcb9655e/FLAGf63acf068 [2022-02-21 03:10:44,396 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e902e6c24/48c20bd63e5947fd9c002055dcb9655e [2022-02-21 03:10:44,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:10:44,399 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:10:44,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:10:44,402 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:10:44,404 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:10:44,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:10:44" (1/1) ... [2022-02-21 03:10:44,406 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3292d5dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:44, skipping insertion in model container [2022-02-21 03:10:44,406 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:10:44" (1/1) ... [2022-02-21 03:10:44,410 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:10:44,420 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:10:44,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark03_linear.i[868,881] [2022-02-21 03:10:44,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:10:44,548 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:10:44,555 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark03_linear.i[868,881] [2022-02-21 03:10:44,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:10:44,567 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:10:44,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:44 WrapperNode [2022-02-21 03:10:44,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:10:44,568 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:10:44,569 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:10:44,569 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:10:44,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:44" (1/1) ... [2022-02-21 03:10:44,578 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:44" (1/1) ... [2022-02-21 03:10:44,608 INFO L137 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60 [2022-02-21 03:10:44,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:10:44,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:10:44,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:10:44,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:10:44,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:44" (1/1) ... [2022-02-21 03:10:44,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:44" (1/1) ... [2022-02-21 03:10:44,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:44" (1/1) ... [2022-02-21 03:10:44,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:44" (1/1) ... [2022-02-21 03:10:44,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:44" (1/1) ... [2022-02-21 03:10:44,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:44" (1/1) ... [2022-02-21 03:10:44,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:44" (1/1) ... [2022-02-21 03:10:44,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:10:44,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:10:44,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:10:44,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:10:44,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:44" (1/1) ... [2022-02-21 03:10:44,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:10:44,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:44,658 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) [2022-02-21 03:10:44,660 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 [2022-02-21 03:10:44,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:10:44,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:10:44,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:10:44,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:10:44,725 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:10:44,726 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:10:44,951 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:10:44,955 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:10:44,967 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:10:44,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:10:44 BoogieIcfgContainer [2022-02-21 03:10:44,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:10:44,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:10:44,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:10:44,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:10:44,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:10:44" (1/3) ... [2022-02-21 03:10:44,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786c984e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:10:44, skipping insertion in model container [2022-02-21 03:10:44,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:44" (2/3) ... [2022-02-21 03:10:44,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786c984e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:10:44, skipping insertion in model container [2022-02-21 03:10:44,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:10:44" (3/3) ... [2022-02-21 03:10:44,989 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark03_linear.i [2022-02-21 03:10:44,992 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:10:44,993 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-02-21 03:10:45,032 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:10:45,039 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, mAutomataTypeConcurrency=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 [2022-02-21 03:10:45,039 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-02-21 03:10:45,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 20 states have (on average 1.75) internal successors, (35), 30 states have internal predecessors, (35), 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) [2022-02-21 03:10:45,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:10:45,060 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:45,060 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:10:45,061 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:10:45,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:45,065 INFO L85 PathProgramCache]: Analyzing trace with hash 28695973, now seen corresponding path program 1 times [2022-02-21 03:10:45,072 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:45,072 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225905932] [2022-02-21 03:10:45,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:45,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:45,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {34#true} is VALID [2022-02-21 03:10:45,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {36#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:10:45,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {36#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:10:45,248 INFO L290 TraceCheckUtils]: 3: Hoare triple {36#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {37#(= |ULTIMATE.start_main_#t~post7#1| 0)} is VALID [2022-02-21 03:10:45,248 INFO L290 TraceCheckUtils]: 4: Hoare triple {37#(= |ULTIMATE.start_main_#t~post7#1| 0)} assume !(1 + main_#t~post7#1 <= 2147483647); {35#false} is VALID [2022-02-21 03:10:45,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:45,250 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:45,250 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225905932] [2022-02-21 03:10:45,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225905932] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:45,251 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:45,251 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:10:45,253 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012481169] [2022-02-21 03:10:45,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:45,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2022-02-21 03:10:45,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:45,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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) [2022-02-21 03:10:45,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:45,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:10:45,270 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:45,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:10:45,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:10:45,291 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.75) internal successors, (35), 30 states have internal predecessors, (35), 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 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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) [2022-02-21 03:10:45,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:45,424 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-02-21 03:10:45,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:10:45,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2022-02-21 03:10:45,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:45,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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) [2022-02-21 03:10:45,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-02-21 03:10:45,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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) [2022-02-21 03:10:45,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-02-21 03:10:45,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2022-02-21 03:10:45,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:45,490 INFO L225 Difference]: With dead ends: 48 [2022-02-21 03:10:45,491 INFO L226 Difference]: Without dead ends: 28 [2022-02-21 03:10:45,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:10:45,495 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:45,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 81 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:45,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-21 03:10:45,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-21 03:10:45,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:45,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 27 states have internal predecessors, (29), 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) [2022-02-21 03:10:45,513 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 27 states have internal predecessors, (29), 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) [2022-02-21 03:10:45,513 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 27 states have internal predecessors, (29), 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) [2022-02-21 03:10:45,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:45,515 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-02-21 03:10:45,515 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-02-21 03:10:45,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:45,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:45,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 27 states have internal predecessors, (29), 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 28 states. [2022-02-21 03:10:45,517 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 27 states have internal predecessors, (29), 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 28 states. [2022-02-21 03:10:45,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:45,518 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-02-21 03:10:45,518 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-02-21 03:10:45,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:45,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:45,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:45,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:45,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 27 states have internal predecessors, (29), 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) [2022-02-21 03:10:45,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2022-02-21 03:10:45,521 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 5 [2022-02-21 03:10:45,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:45,522 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2022-02-21 03:10:45,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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) [2022-02-21 03:10:45,522 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-02-21 03:10:45,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 03:10:45,522 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:45,523 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:45,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:10:45,523 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:10:45,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:45,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1807027879, now seen corresponding path program 1 times [2022-02-21 03:10:45,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:45,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710476264] [2022-02-21 03:10:45,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:45,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:45,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {181#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {181#true} is VALID [2022-02-21 03:10:45,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {181#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {183#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:10:45,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {183#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {183#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:10:45,557 INFO L290 TraceCheckUtils]: 3: Hoare triple {183#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {183#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:10:45,558 INFO L290 TraceCheckUtils]: 4: Hoare triple {183#(= |ULTIMATE.start_main_~y~0#1| 0)} assume 1 + main_#t~post7#1 <= 2147483647; {183#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:10:45,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {183#(= |ULTIMATE.start_main_~y~0#1| 0)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {184#(= |ULTIMATE.start_main_#t~post8#1| 0)} is VALID [2022-02-21 03:10:45,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {184#(= |ULTIMATE.start_main_#t~post8#1| 0)} assume !(1 + main_#t~post8#1 <= 2147483647); {182#false} is VALID [2022-02-21 03:10:45,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:45,559 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:45,560 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710476264] [2022-02-21 03:10:45,560 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710476264] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:45,560 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:45,560 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:10:45,560 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853034893] [2022-02-21 03:10:45,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:45,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2022-02-21 03:10:45,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:45,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2022-02-21 03:10:45,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:45,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:10:45,568 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:45,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:10:45,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:10:45,569 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2022-02-21 03:10:45,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:45,615 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-02-21 03:10:45,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:10:45,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2022-02-21 03:10:45,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:45,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2022-02-21 03:10:45,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-02-21 03:10:45,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2022-02-21 03:10:45,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-02-21 03:10:45,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2022-02-21 03:10:45,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:45,639 INFO L225 Difference]: With dead ends: 32 [2022-02-21 03:10:45,640 INFO L226 Difference]: Without dead ends: 30 [2022-02-21 03:10:45,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:10:45,641 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:45,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 61 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:45,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-21 03:10:45,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-21 03:10:45,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:45,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.55) internal successors, (31), 29 states have internal predecessors, (31), 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) [2022-02-21 03:10:45,644 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.55) internal successors, (31), 29 states have internal predecessors, (31), 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) [2022-02-21 03:10:45,644 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.55) internal successors, (31), 29 states have internal predecessors, (31), 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) [2022-02-21 03:10:45,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:45,646 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-02-21 03:10:45,646 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-02-21 03:10:45,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:45,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:45,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 20 states have (on average 1.55) internal successors, (31), 29 states have internal predecessors, (31), 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 30 states. [2022-02-21 03:10:45,647 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.55) internal successors, (31), 29 states have internal predecessors, (31), 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 30 states. [2022-02-21 03:10:45,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:45,648 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-02-21 03:10:45,648 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-02-21 03:10:45,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:45,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:45,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:45,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:45,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.55) internal successors, (31), 29 states have internal predecessors, (31), 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) [2022-02-21 03:10:45,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-02-21 03:10:45,650 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 7 [2022-02-21 03:10:45,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:45,650 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-02-21 03:10:45,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2022-02-21 03:10:45,651 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-02-21 03:10:45,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:10:45,651 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:45,651 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:45,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:10:45,652 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:10:45,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:45,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1387005865, now seen corresponding path program 1 times [2022-02-21 03:10:45,652 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:45,653 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164356307] [2022-02-21 03:10:45,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:45,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:45,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {315#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {315#true} is VALID [2022-02-21 03:10:45,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {315#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {317#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:10:45,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {317#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {318#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-21 03:10:45,711 INFO L290 TraceCheckUtils]: 3: Hoare triple {318#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {319#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_#t~post7#1| 0))} is VALID [2022-02-21 03:10:45,711 INFO L290 TraceCheckUtils]: 4: Hoare triple {319#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_#t~post7#1| 0))} assume 1 + main_#t~post7#1 <= 2147483647; {319#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_#t~post7#1| 0))} is VALID [2022-02-21 03:10:45,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {319#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_#t~post7#1| 0))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {320#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 1)} is VALID [2022-02-21 03:10:45,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {320#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 1)} assume 1 + main_#t~post8#1 <= 2147483647; {320#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 1)} is VALID [2022-02-21 03:10:45,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {320#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 1)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {320#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 1)} is VALID [2022-02-21 03:10:45,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {320#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 1)} assume !(main_~i~0#1 + main_~x~0#1 <= 2147483647); {316#false} is VALID [2022-02-21 03:10:45,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:45,714 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:45,714 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164356307] [2022-02-21 03:10:45,714 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164356307] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:45,714 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:45,715 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:10:45,715 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92821680] [2022-02-21 03:10:45,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:45,715 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2022-02-21 03:10:45,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:45,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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) [2022-02-21 03:10:45,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:45,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:10:45,723 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:45,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:10:45,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:10:45,724 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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) [2022-02-21 03:10:45,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:45,799 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-02-21 03:10:45,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:45,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2022-02-21 03:10:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:45,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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) [2022-02-21 03:10:45,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-02-21 03:10:45,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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) [2022-02-21 03:10:45,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-02-21 03:10:45,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-02-21 03:10:45,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:45,825 INFO L225 Difference]: With dead ends: 33 [2022-02-21 03:10:45,825 INFO L226 Difference]: Without dead ends: 32 [2022-02-21 03:10:45,825 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:10:45,830 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:45,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 71 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:45,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-21 03:10:45,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-02-21 03:10:45,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:45,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 31 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 30 states have internal predecessors, (32), 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) [2022-02-21 03:10:45,840 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 31 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 30 states have internal predecessors, (32), 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) [2022-02-21 03:10:45,840 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 31 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 30 states have internal predecessors, (32), 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) [2022-02-21 03:10:45,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:45,841 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-02-21 03:10:45,841 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-02-21 03:10:45,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:45,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:45,845 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 30 states have internal predecessors, (32), 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 32 states. [2022-02-21 03:10:45,846 INFO L87 Difference]: Start difference. First operand has 31 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 30 states have internal predecessors, (32), 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 32 states. [2022-02-21 03:10:45,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:45,848 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-02-21 03:10:45,849 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-02-21 03:10:45,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:45,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:45,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:45,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:45,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 30 states have internal predecessors, (32), 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) [2022-02-21 03:10:45,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-02-21 03:10:45,854 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 9 [2022-02-21 03:10:45,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:45,854 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-02-21 03:10:45,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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) [2022-02-21 03:10:45,854 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-02-21 03:10:45,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-21 03:10:45,855 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:45,855 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:45,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:10:45,855 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:10:45,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:45,856 INFO L85 PathProgramCache]: Analyzing trace with hash 47508913, now seen corresponding path program 1 times [2022-02-21 03:10:45,856 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:45,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625853451] [2022-02-21 03:10:45,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:45,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:45,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {457#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {457#true} is VALID [2022-02-21 03:10:45,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {459#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:10:45,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {459#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {460#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-21 03:10:45,921 INFO L290 TraceCheckUtils]: 3: Hoare triple {460#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {461#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0))} is VALID [2022-02-21 03:10:45,921 INFO L290 TraceCheckUtils]: 4: Hoare triple {461#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0))} assume 1 + main_#t~post7#1 <= 2147483647; {461#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0))} is VALID [2022-02-21 03:10:45,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {461#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {462#(<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:10:45,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {462#(<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} assume 1 + main_#t~post8#1 <= 2147483647; {462#(<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:10:45,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {462#(<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {462#(<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:10:45,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {462#(<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {462#(<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:10:45,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {462#(<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !(main_~i~0#1 + main_~x~0#1 >= -2147483648); {458#false} is VALID [2022-02-21 03:10:45,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:45,924 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:45,924 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625853451] [2022-02-21 03:10:45,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625853451] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:45,925 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:45,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:10:45,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18507871] [2022-02-21 03:10:45,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:45,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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 10 [2022-02-21 03:10:45,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:45,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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) [2022-02-21 03:10:45,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:45,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:10:45,934 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:45,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:10:45,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:10:45,935 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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) [2022-02-21 03:10:46,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:46,032 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-02-21 03:10:46,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:46,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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 10 [2022-02-21 03:10:46,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:46,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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) [2022-02-21 03:10:46,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-02-21 03:10:46,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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) [2022-02-21 03:10:46,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-02-21 03:10:46,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 34 transitions. [2022-02-21 03:10:46,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:46,062 INFO L225 Difference]: With dead ends: 33 [2022-02-21 03:10:46,062 INFO L226 Difference]: Without dead ends: 32 [2022-02-21 03:10:46,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:10:46,063 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:46,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 89 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:46,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-21 03:10:46,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-02-21 03:10:46,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:46,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 22 states have (on average 1.5) internal successors, (33), 31 states have internal predecessors, (33), 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) [2022-02-21 03:10:46,067 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 22 states have (on average 1.5) internal successors, (33), 31 states have internal predecessors, (33), 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) [2022-02-21 03:10:46,068 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 22 states have (on average 1.5) internal successors, (33), 31 states have internal predecessors, (33), 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) [2022-02-21 03:10:46,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:46,069 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-02-21 03:10:46,069 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-02-21 03:10:46,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:46,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:46,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 22 states have (on average 1.5) internal successors, (33), 31 states have internal predecessors, (33), 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 32 states. [2022-02-21 03:10:46,070 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5) internal successors, (33), 31 states have internal predecessors, (33), 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 32 states. [2022-02-21 03:10:46,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:46,071 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-02-21 03:10:46,071 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-02-21 03:10:46,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:46,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:46,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:46,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.5) internal successors, (33), 31 states have internal predecessors, (33), 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) [2022-02-21 03:10:46,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-02-21 03:10:46,072 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 10 [2022-02-21 03:10:46,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:46,073 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-02-21 03:10:46,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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) [2022-02-21 03:10:46,073 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-02-21 03:10:46,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-21 03:10:46,073 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:46,073 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:46,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:10:46,074 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:10:46,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:46,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1472776363, now seen corresponding path program 1 times [2022-02-21 03:10:46,075 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:46,075 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057816019] [2022-02-21 03:10:46,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:46,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:46,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {600#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {600#true} is VALID [2022-02-21 03:10:46,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {600#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {602#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:10:46,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {602#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {603#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:10:46,127 INFO L290 TraceCheckUtils]: 3: Hoare triple {603#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {603#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:10:46,128 INFO L290 TraceCheckUtils]: 4: Hoare triple {603#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post7#1 <= 2147483647; {603#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:10:46,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {603#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {604#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:10:46,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {604#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post8#1 <= 2147483647; {604#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:10:46,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {604#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {605#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 1)} is VALID [2022-02-21 03:10:46,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {605#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 1)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {605#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 1)} is VALID [2022-02-21 03:10:46,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {605#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 1)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {605#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 1)} is VALID [2022-02-21 03:10:46,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {605#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 1)} assume !(main_~j~0#1 + main_~y~0#1 <= 2147483647); {601#false} is VALID [2022-02-21 03:10:46,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:46,131 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:46,131 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057816019] [2022-02-21 03:10:46,131 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057816019] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:46,131 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:46,131 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:10:46,132 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46291493] [2022-02-21 03:10:46,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:46,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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 11 [2022-02-21 03:10:46,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:46,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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) [2022-02-21 03:10:46,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:46,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:10:46,141 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:46,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:10:46,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:10:46,141 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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) [2022-02-21 03:10:46,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:46,247 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-02-21 03:10:46,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:46,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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 11 [2022-02-21 03:10:46,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:46,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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) [2022-02-21 03:10:46,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-02-21 03:10:46,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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) [2022-02-21 03:10:46,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-02-21 03:10:46,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2022-02-21 03:10:46,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:46,277 INFO L225 Difference]: With dead ends: 35 [2022-02-21 03:10:46,277 INFO L226 Difference]: Without dead ends: 34 [2022-02-21 03:10:46,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:10:46,278 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:46,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 77 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:46,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-21 03:10:46,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-02-21 03:10:46,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:46,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 32 states have internal predecessors, (34), 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) [2022-02-21 03:10:46,282 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 32 states have internal predecessors, (34), 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) [2022-02-21 03:10:46,282 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 32 states have internal predecessors, (34), 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) [2022-02-21 03:10:46,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:46,283 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-02-21 03:10:46,283 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-02-21 03:10:46,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:46,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:46,284 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 32 states have internal predecessors, (34), 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 34 states. [2022-02-21 03:10:46,284 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 32 states have internal predecessors, (34), 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 34 states. [2022-02-21 03:10:46,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:46,285 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-02-21 03:10:46,285 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-02-21 03:10:46,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:46,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:46,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:46,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:46,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 32 states have internal predecessors, (34), 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) [2022-02-21 03:10:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-02-21 03:10:46,286 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 11 [2022-02-21 03:10:46,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:46,286 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-02-21 03:10:46,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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) [2022-02-21 03:10:46,286 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-02-21 03:10:46,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-21 03:10:46,286 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:46,286 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:46,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 03:10:46,287 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:10:46,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:46,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1588572941, now seen corresponding path program 1 times [2022-02-21 03:10:46,287 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:46,287 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074362375] [2022-02-21 03:10:46,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:46,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:46,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {750#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {750#true} is VALID [2022-02-21 03:10:46,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {750#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {752#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:10:46,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {752#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {753#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-21 03:10:46,334 INFO L290 TraceCheckUtils]: 3: Hoare triple {753#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {753#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-21 03:10:46,334 INFO L290 TraceCheckUtils]: 4: Hoare triple {753#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0))} assume 1 + main_#t~post7#1 <= 2147483647; {753#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-21 03:10:46,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {753#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {754#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:10:46,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {754#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume 1 + main_#t~post8#1 <= 2147483647; {754#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:10:46,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {754#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {755#(<= 1 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:10:46,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {755#(<= 1 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {755#(<= 1 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:10:46,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {755#(<= 1 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {755#(<= 1 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:10:46,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {755#(<= 1 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {755#(<= 1 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:10:46,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {755#(<= 1 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} assume !(main_~j~0#1 + main_~y~0#1 >= -2147483648); {751#false} is VALID [2022-02-21 03:10:46,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:46,337 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:46,337 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074362375] [2022-02-21 03:10:46,337 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074362375] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:46,337 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:46,337 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:10:46,337 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891399074] [2022-02-21 03:10:46,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:46,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2022-02-21 03:10:46,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:46,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) [2022-02-21 03:10:46,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:46,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:10:46,345 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:46,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:10:46,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:10:46,346 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) [2022-02-21 03:10:46,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:46,422 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2022-02-21 03:10:46,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:46,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2022-02-21 03:10:46,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) [2022-02-21 03:10:46,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-02-21 03:10:46,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) [2022-02-21 03:10:46,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-02-21 03:10:46,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-02-21 03:10:46,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:46,448 INFO L225 Difference]: With dead ends: 35 [2022-02-21 03:10:46,448 INFO L226 Difference]: Without dead ends: 34 [2022-02-21 03:10:46,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:10:46,449 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:46,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 63 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:46,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-21 03:10:46,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-02-21 03:10:46,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:46,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 33 states have internal predecessors, (35), 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) [2022-02-21 03:10:46,454 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 33 states have internal predecessors, (35), 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) [2022-02-21 03:10:46,455 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 33 states have internal predecessors, (35), 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) [2022-02-21 03:10:46,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:46,455 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-02-21 03:10:46,456 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-02-21 03:10:46,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:46,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:46,456 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 33 states have internal predecessors, (35), 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 34 states. [2022-02-21 03:10:46,456 INFO L87 Difference]: Start difference. First operand has 34 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 33 states have internal predecessors, (35), 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 34 states. [2022-02-21 03:10:46,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:46,457 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-02-21 03:10:46,457 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-02-21 03:10:46,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:46,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:46,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:46,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:46,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 33 states have internal predecessors, (35), 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) [2022-02-21 03:10:46,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-02-21 03:10:46,459 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 12 [2022-02-21 03:10:46,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:46,459 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-02-21 03:10:46,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) [2022-02-21 03:10:46,459 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-02-21 03:10:46,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-21 03:10:46,460 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:46,460 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:46,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 03:10:46,460 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:10:46,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:46,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1905204139, now seen corresponding path program 1 times [2022-02-21 03:10:46,461 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:46,461 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544869288] [2022-02-21 03:10:46,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:46,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:46,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {901#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {901#true} is VALID [2022-02-21 03:10:46,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {901#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {903#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:10:46,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {903#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {904#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:10:46,526 INFO L290 TraceCheckUtils]: 3: Hoare triple {904#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {904#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:10:46,526 INFO L290 TraceCheckUtils]: 4: Hoare triple {904#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post7#1 <= 2147483647; {904#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:10:46,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {904#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {905#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:10:46,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {905#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post8#1 <= 2147483647; {905#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:10:46,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {905#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {906#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 1)} is VALID [2022-02-21 03:10:46,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {906#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 1)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {906#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 1)} is VALID [2022-02-21 03:10:46,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {906#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 1)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {906#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 1)} is VALID [2022-02-21 03:10:46,529 INFO L290 TraceCheckUtils]: 10: Hoare triple {906#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 1)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {906#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 1)} is VALID [2022-02-21 03:10:46,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {906#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 1)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {907#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:10:46,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {907#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume 0 != main_~flag~0#1 % 256; {907#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:10:46,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {907#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !(1 + main_~j~0#1 <= 2147483647); {902#false} is VALID [2022-02-21 03:10:46,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:46,530 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:46,530 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544869288] [2022-02-21 03:10:46,530 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544869288] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:46,530 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:46,530 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 03:10:46,530 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990439785] [2022-02-21 03:10:46,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:46,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 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 14 [2022-02-21 03:10:46,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:46,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 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) [2022-02-21 03:10:46,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:46,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-21 03:10:46,547 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:46,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:10:46,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:10:46,548 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 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) [2022-02-21 03:10:46,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:46,674 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2022-02-21 03:10:46,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:10:46,674 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 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 14 [2022-02-21 03:10:46,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:46,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 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) [2022-02-21 03:10:46,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-02-21 03:10:46,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 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) [2022-02-21 03:10:46,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-02-21 03:10:46,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 58 transitions. [2022-02-21 03:10:46,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:46,716 INFO L225 Difference]: With dead ends: 55 [2022-02-21 03:10:46,716 INFO L226 Difference]: Without dead ends: 54 [2022-02-21 03:10:46,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:10:46,718 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 31 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:46,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 86 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:46,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-02-21 03:10:46,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 36. [2022-02-21 03:10:46,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:46,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 35 states have internal predecessors, (38), 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) [2022-02-21 03:10:46,725 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 35 states have internal predecessors, (38), 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) [2022-02-21 03:10:46,725 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 35 states have internal predecessors, (38), 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) [2022-02-21 03:10:46,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:46,726 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-02-21 03:10:46,726 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-02-21 03:10:46,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:46,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:46,727 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 35 states have internal predecessors, (38), 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 54 states. [2022-02-21 03:10:46,727 INFO L87 Difference]: Start difference. First operand has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 35 states have internal predecessors, (38), 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 54 states. [2022-02-21 03:10:46,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:46,728 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-02-21 03:10:46,728 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-02-21 03:10:46,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:46,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:46,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:46,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:46,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 35 states have internal predecessors, (38), 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) [2022-02-21 03:10:46,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-02-21 03:10:46,731 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2022-02-21 03:10:46,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:46,731 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-02-21 03:10:46,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 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) [2022-02-21 03:10:46,732 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-02-21 03:10:46,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-21 03:10:46,732 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:46,732 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:46,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-21 03:10:46,732 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:10:46,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:46,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1068213904, now seen corresponding path program 1 times [2022-02-21 03:10:46,733 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:46,733 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452749491] [2022-02-21 03:10:46,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:46,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:46,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {1118#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {1118#true} is VALID [2022-02-21 03:10:46,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {1118#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {1120#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:10:46,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {1120#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {1121#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-21 03:10:46,787 INFO L290 TraceCheckUtils]: 3: Hoare triple {1121#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {1121#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-21 03:10:46,787 INFO L290 TraceCheckUtils]: 4: Hoare triple {1121#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0))} assume 1 + main_#t~post7#1 <= 2147483647; {1121#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-21 03:10:46,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {1121#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {1122#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:10:46,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {1122#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume 1 + main_#t~post8#1 <= 2147483647; {1122#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:10:46,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {1122#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1123#(<= 1 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:10:46,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {1123#(<= 1 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {1123#(<= 1 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:10:46,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {1123#(<= 1 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {1123#(<= 1 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:10:46,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {1123#(<= 1 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {1123#(<= 1 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:10:46,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {1123#(<= 1 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {1124#(<= 1 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:10:46,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {1124#(<= 1 |ULTIMATE.start_main_~j~0#1|)} assume 0 != main_~flag~0#1 % 256; {1124#(<= 1 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:10:46,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {1124#(<= 1 |ULTIMATE.start_main_~j~0#1|)} assume 1 + main_~j~0#1 <= 2147483647; {1124#(<= 1 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:10:46,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {1124#(<= 1 |ULTIMATE.start_main_~j~0#1|)} assume !(1 + main_~j~0#1 >= -2147483648); {1119#false} is VALID [2022-02-21 03:10:46,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:46,792 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:46,792 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452749491] [2022-02-21 03:10:46,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452749491] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:46,792 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:46,792 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 03:10:46,792 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908494533] [2022-02-21 03:10:46,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:46,792 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 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 15 [2022-02-21 03:10:46,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:46,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 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) [2022-02-21 03:10:46,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:46,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-21 03:10:46,803 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:46,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:10:46,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:10:46,803 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 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) [2022-02-21 03:10:46,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:46,947 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-02-21 03:10:46,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:10:46,947 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 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 15 [2022-02-21 03:10:46,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:46,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 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) [2022-02-21 03:10:46,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2022-02-21 03:10:46,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 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) [2022-02-21 03:10:46,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2022-02-21 03:10:46,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 57 transitions. [2022-02-21 03:10:47,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:47,004 INFO L225 Difference]: With dead ends: 55 [2022-02-21 03:10:47,004 INFO L226 Difference]: Without dead ends: 54 [2022-02-21 03:10:47,004 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:10:47,004 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 24 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:47,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 86 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:47,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-02-21 03:10:47,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 37. [2022-02-21 03:10:47,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:47,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 37 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 36 states have internal predecessors, (39), 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) [2022-02-21 03:10:47,021 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 37 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 36 states have internal predecessors, (39), 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) [2022-02-21 03:10:47,021 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 37 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 36 states have internal predecessors, (39), 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) [2022-02-21 03:10:47,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:47,021 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-02-21 03:10:47,022 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-02-21 03:10:47,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:47,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:47,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 36 states have internal predecessors, (39), 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 54 states. [2022-02-21 03:10:47,022 INFO L87 Difference]: Start difference. First operand has 37 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 36 states have internal predecessors, (39), 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 54 states. [2022-02-21 03:10:47,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:47,023 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-02-21 03:10:47,023 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-02-21 03:10:47,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:47,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:47,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:47,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:47,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 36 states have internal predecessors, (39), 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) [2022-02-21 03:10:47,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-02-21 03:10:47,024 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 15 [2022-02-21 03:10:47,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:47,024 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-02-21 03:10:47,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 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) [2022-02-21 03:10:47,024 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-02-21 03:10:47,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-21 03:10:47,025 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:47,025 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:47,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-21 03:10:47,025 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:10:47,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:47,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1068218998, now seen corresponding path program 1 times [2022-02-21 03:10:47,025 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:47,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128947673] [2022-02-21 03:10:47,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:47,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:47,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {1336#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {1336#true} is VALID [2022-02-21 03:10:47,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {1336#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {1338#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:10:47,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {1338#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {1338#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:10:47,088 INFO L290 TraceCheckUtils]: 3: Hoare triple {1338#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {1339#(= |ULTIMATE.start_main_#t~post7#1| 0)} is VALID [2022-02-21 03:10:47,088 INFO L290 TraceCheckUtils]: 4: Hoare triple {1339#(= |ULTIMATE.start_main_#t~post7#1| 0)} assume 1 + main_#t~post7#1 <= 2147483647; {1339#(= |ULTIMATE.start_main_#t~post7#1| 0)} is VALID [2022-02-21 03:10:47,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {1339#(= |ULTIMATE.start_main_#t~post7#1| 0)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:10:47,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_#t~post8#1 <= 2147483647; {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:10:47,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:10:47,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:10:47,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:10:47,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:10:47,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:10:47,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !(0 != main_~flag~0#1 % 256); {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:10:47,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {1341#(<= |ULTIMATE.start_main_#t~post7#1| 1)} is VALID [2022-02-21 03:10:47,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {1341#(<= |ULTIMATE.start_main_#t~post7#1| 1)} assume !(1 + main_#t~post7#1 <= 2147483647); {1337#false} is VALID [2022-02-21 03:10:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:47,092 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:47,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128947673] [2022-02-21 03:10:47,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128947673] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:47,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348777217] [2022-02-21 03:10:47,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:47,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:47,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:47,094 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) [2022-02-21 03:10:47,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:10:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:47,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:10:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:47,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:47,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {1336#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {1336#true} is VALID [2022-02-21 03:10:47,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {1336#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {1348#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:10:47,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {1348#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {1348#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:10:47,270 INFO L290 TraceCheckUtils]: 3: Hoare triple {1348#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {1355#(<= |ULTIMATE.start_main_#t~post7#1| 0)} is VALID [2022-02-21 03:10:47,270 INFO L290 TraceCheckUtils]: 4: Hoare triple {1355#(<= |ULTIMATE.start_main_#t~post7#1| 0)} assume 1 + main_#t~post7#1 <= 2147483647; {1355#(<= |ULTIMATE.start_main_#t~post7#1| 0)} is VALID [2022-02-21 03:10:47,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {1355#(<= |ULTIMATE.start_main_#t~post7#1| 0)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:10:47,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_#t~post8#1 <= 2147483647; {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:10:47,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:10:47,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:10:47,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:10:47,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:10:47,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:10:47,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !(0 != main_~flag~0#1 % 256); {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:10:47,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {1340#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {1341#(<= |ULTIMATE.start_main_#t~post7#1| 1)} is VALID [2022-02-21 03:10:47,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {1341#(<= |ULTIMATE.start_main_#t~post7#1| 1)} assume !(1 + main_#t~post7#1 <= 2147483647); {1337#false} is VALID [2022-02-21 03:10:47,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:47,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:47,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {1389#(<= |ULTIMATE.start_main_#t~post7#1| 2147483646)} assume !(1 + main_#t~post7#1 <= 2147483647); {1337#false} is VALID [2022-02-21 03:10:47,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {1393#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {1389#(<= |ULTIMATE.start_main_#t~post7#1| 2147483646)} is VALID [2022-02-21 03:10:47,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {1393#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume !(0 != main_~flag~0#1 % 256); {1393#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:10:47,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {1393#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {1393#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:10:47,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {1393#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {1393#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:10:47,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {1393#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {1393#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:10:47,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {1393#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {1393#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:10:47,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {1393#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1393#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:10:47,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {1393#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume 1 + main_#t~post8#1 <= 2147483647; {1393#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:10:47,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {1418#(<= |ULTIMATE.start_main_#t~post7#1| 2147483645)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {1393#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:10:47,393 INFO L290 TraceCheckUtils]: 4: Hoare triple {1418#(<= |ULTIMATE.start_main_#t~post7#1| 2147483645)} assume 1 + main_#t~post7#1 <= 2147483647; {1418#(<= |ULTIMATE.start_main_#t~post7#1| 2147483645)} is VALID [2022-02-21 03:10:47,393 INFO L290 TraceCheckUtils]: 3: Hoare triple {1425#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {1418#(<= |ULTIMATE.start_main_#t~post7#1| 2147483645)} is VALID [2022-02-21 03:10:47,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {1425#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {1425#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:10:47,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {1336#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {1425#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:10:47,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {1336#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {1336#true} is VALID [2022-02-21 03:10:47,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:47,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348777217] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:47,395 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:47,395 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-02-21 03:10:47,395 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732611985] [2022-02-21 03:10:47,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:47,395 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 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 15 [2022-02-21 03:10:47,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:47,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 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) [2022-02-21 03:10:47,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:47,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-21 03:10:47,418 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:47,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:10:47,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:10:47,419 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 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) [2022-02-21 03:10:47,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:47,615 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2022-02-21 03:10:47,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-21 03:10:47,615 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 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 15 [2022-02-21 03:10:47,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:47,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 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) [2022-02-21 03:10:47,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 90 transitions. [2022-02-21 03:10:47,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 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) [2022-02-21 03:10:47,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 90 transitions. [2022-02-21 03:10:47,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 90 transitions. [2022-02-21 03:10:47,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:47,679 INFO L225 Difference]: With dead ends: 84 [2022-02-21 03:10:47,680 INFO L226 Difference]: Without dead ends: 83 [2022-02-21 03:10:47,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-02-21 03:10:47,680 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 74 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:47,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 105 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:47,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-02-21 03:10:47,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 63. [2022-02-21 03:10:47,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:47,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 63 states, 53 states have (on average 1.6037735849056605) internal successors, (85), 62 states have internal predecessors, (85), 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) [2022-02-21 03:10:47,690 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 63 states, 53 states have (on average 1.6037735849056605) internal successors, (85), 62 states have internal predecessors, (85), 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) [2022-02-21 03:10:47,690 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 63 states, 53 states have (on average 1.6037735849056605) internal successors, (85), 62 states have internal predecessors, (85), 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) [2022-02-21 03:10:47,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:47,691 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-02-21 03:10:47,692 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-02-21 03:10:47,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:47,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:47,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 53 states have (on average 1.6037735849056605) internal successors, (85), 62 states have internal predecessors, (85), 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 83 states. [2022-02-21 03:10:47,692 INFO L87 Difference]: Start difference. First operand has 63 states, 53 states have (on average 1.6037735849056605) internal successors, (85), 62 states have internal predecessors, (85), 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 83 states. [2022-02-21 03:10:47,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:47,693 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-02-21 03:10:47,693 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-02-21 03:10:47,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:47,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:47,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:47,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:47,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 53 states have (on average 1.6037735849056605) internal successors, (85), 62 states have internal predecessors, (85), 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) [2022-02-21 03:10:47,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 85 transitions. [2022-02-21 03:10:47,695 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 85 transitions. Word has length 15 [2022-02-21 03:10:47,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:47,695 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 85 transitions. [2022-02-21 03:10:47,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 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) [2022-02-21 03:10:47,696 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 85 transitions. [2022-02-21 03:10:47,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-21 03:10:47,696 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:47,696 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:47,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:47,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:47,908 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:10:47,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:47,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1244949380, now seen corresponding path program 1 times [2022-02-21 03:10:47,908 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:47,908 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005928011] [2022-02-21 03:10:47,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:47,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:47,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {1771#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {1771#true} is VALID [2022-02-21 03:10:47,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {1773#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:10:47,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {1773#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {1773#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:10:47,948 INFO L290 TraceCheckUtils]: 3: Hoare triple {1773#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {1774#(= |ULTIMATE.start_main_#t~post7#1| 0)} is VALID [2022-02-21 03:10:47,948 INFO L290 TraceCheckUtils]: 4: Hoare triple {1774#(= |ULTIMATE.start_main_#t~post7#1| 0)} assume 1 + main_#t~post7#1 <= 2147483647; {1774#(= |ULTIMATE.start_main_#t~post7#1| 0)} is VALID [2022-02-21 03:10:47,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {1774#(= |ULTIMATE.start_main_#t~post7#1| 0)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:10:47,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume 1 + main_#t~post8#1 <= 2147483647; {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:10:47,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:10:47,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:10:47,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:10:47,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:10:47,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:10:47,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume !(0 != main_~flag~0#1 % 256); {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:10:47,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {1776#(<= 1 |ULTIMATE.start_main_#t~post7#1|)} is VALID [2022-02-21 03:10:47,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {1776#(<= 1 |ULTIMATE.start_main_#t~post7#1|)} assume 1 + main_#t~post7#1 <= 2147483647; {1776#(<= 1 |ULTIMATE.start_main_#t~post7#1|)} is VALID [2022-02-21 03:10:47,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {1776#(<= 1 |ULTIMATE.start_main_#t~post7#1|)} assume !(1 + main_#t~post7#1 >= -2147483648); {1772#false} is VALID [2022-02-21 03:10:47,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:47,952 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:47,952 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005928011] [2022-02-21 03:10:47,952 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005928011] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:47,952 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042207412] [2022-02-21 03:10:47,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:47,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:47,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:47,954 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) [2022-02-21 03:10:47,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 03:10:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:47,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:10:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:47,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:48,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {1771#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {1771#true} is VALID [2022-02-21 03:10:48,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {1783#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:10:48,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {1783#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {1783#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:10:48,085 INFO L290 TraceCheckUtils]: 3: Hoare triple {1783#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {1790#(<= 0 |ULTIMATE.start_main_#t~post7#1|)} is VALID [2022-02-21 03:10:48,086 INFO L290 TraceCheckUtils]: 4: Hoare triple {1790#(<= 0 |ULTIMATE.start_main_#t~post7#1|)} assume 1 + main_#t~post7#1 <= 2147483647; {1790#(<= 0 |ULTIMATE.start_main_#t~post7#1|)} is VALID [2022-02-21 03:10:48,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {1790#(<= 0 |ULTIMATE.start_main_#t~post7#1|)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:10:48,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume 1 + main_#t~post8#1 <= 2147483647; {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:10:48,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:10:48,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:10:48,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:10:48,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:10:48,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:10:48,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume !(0 != main_~flag~0#1 % 256); {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:10:48,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {1775#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {1776#(<= 1 |ULTIMATE.start_main_#t~post7#1|)} is VALID [2022-02-21 03:10:48,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {1776#(<= 1 |ULTIMATE.start_main_#t~post7#1|)} assume 1 + main_#t~post7#1 <= 2147483647; {1776#(<= 1 |ULTIMATE.start_main_#t~post7#1|)} is VALID [2022-02-21 03:10:48,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {1776#(<= 1 |ULTIMATE.start_main_#t~post7#1|)} assume !(1 + main_#t~post7#1 >= -2147483648); {1772#false} is VALID [2022-02-21 03:10:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:48,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:48,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042207412] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:48,090 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:48,091 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-02-21 03:10:48,091 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510389442] [2022-02-21 03:10:48,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:48,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2022-02-21 03:10:48,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:48,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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) [2022-02-21 03:10:48,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:48,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:10:48,101 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:48,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:10:48,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:10:48,102 INFO L87 Difference]: Start difference. First operand 63 states and 85 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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) [2022-02-21 03:10:48,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:48,178 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2022-02-21 03:10:48,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:48,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2022-02-21 03:10:48,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:48,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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) [2022-02-21 03:10:48,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-02-21 03:10:48,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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) [2022-02-21 03:10:48,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-02-21 03:10:48,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2022-02-21 03:10:48,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:48,208 INFO L225 Difference]: With dead ends: 63 [2022-02-21 03:10:48,208 INFO L226 Difference]: Without dead ends: 62 [2022-02-21 03:10:48,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:10:48,209 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:48,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 51 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:48,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-02-21 03:10:48,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-02-21 03:10:48,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:48,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 61 states have internal predecessors, (82), 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) [2022-02-21 03:10:48,220 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 61 states have internal predecessors, (82), 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) [2022-02-21 03:10:48,220 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 61 states have internal predecessors, (82), 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) [2022-02-21 03:10:48,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:48,221 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2022-02-21 03:10:48,221 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2022-02-21 03:10:48,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:48,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:48,222 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 61 states have internal predecessors, (82), 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 62 states. [2022-02-21 03:10:48,222 INFO L87 Difference]: Start difference. First operand has 62 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 61 states have internal predecessors, (82), 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 62 states. [2022-02-21 03:10:48,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:48,223 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2022-02-21 03:10:48,223 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2022-02-21 03:10:48,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:48,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:48,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:48,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:48,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 61 states have internal predecessors, (82), 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) [2022-02-21 03:10:48,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2022-02-21 03:10:48,224 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 16 [2022-02-21 03:10:48,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:48,225 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2022-02-21 03:10:48,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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) [2022-02-21 03:10:48,225 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2022-02-21 03:10:48,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-21 03:10:48,225 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:48,225 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:48,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:48,439 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,SelfDestructingSolverStorable9 [2022-02-21 03:10:48,440 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:10:48,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:48,440 INFO L85 PathProgramCache]: Analyzing trace with hash 61274936, now seen corresponding path program 1 times [2022-02-21 03:10:48,440 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:48,440 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734331191] [2022-02-21 03:10:48,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:48,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:48,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {2089#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {2089#true} is VALID [2022-02-21 03:10:48,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {2089#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {2091#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:10:48,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {2091#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {2091#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:10:48,481 INFO L290 TraceCheckUtils]: 3: Hoare triple {2091#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {2091#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:10:48,481 INFO L290 TraceCheckUtils]: 4: Hoare triple {2091#(= |ULTIMATE.start_main_~y~0#1| 0)} assume 1 + main_#t~post7#1 <= 2147483647; {2091#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:10:48,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {2091#(= |ULTIMATE.start_main_~y~0#1| 0)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {2092#(= |ULTIMATE.start_main_#t~post8#1| 0)} is VALID [2022-02-21 03:10:48,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {2092#(= |ULTIMATE.start_main_#t~post8#1| 0)} assume 1 + main_#t~post8#1 <= 2147483647; {2092#(= |ULTIMATE.start_main_#t~post8#1| 0)} is VALID [2022-02-21 03:10:48,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {2092#(= |ULTIMATE.start_main_#t~post8#1| 0)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:10:48,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:10:48,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:10:48,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:10:48,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:10:48,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !(0 != main_~flag~0#1 % 256); {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:10:48,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:10:48,484 INFO L290 TraceCheckUtils]: 14: Hoare triple {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 1 + main_#t~post7#1 <= 2147483647; {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:10:48,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {2094#(<= |ULTIMATE.start_main_#t~post8#1| 1)} is VALID [2022-02-21 03:10:48,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {2094#(<= |ULTIMATE.start_main_#t~post8#1| 1)} assume !(1 + main_#t~post8#1 <= 2147483647); {2090#false} is VALID [2022-02-21 03:10:48,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:48,485 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:48,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734331191] [2022-02-21 03:10:48,486 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734331191] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:48,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976568859] [2022-02-21 03:10:48,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:48,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:48,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:48,487 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) [2022-02-21 03:10:48,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-21 03:10:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:48,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:10:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:48,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:48,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {2089#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {2089#true} is VALID [2022-02-21 03:10:48,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {2089#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {2101#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:10:48,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {2101#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {2101#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:10:48,637 INFO L290 TraceCheckUtils]: 3: Hoare triple {2101#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {2101#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:10:48,638 INFO L290 TraceCheckUtils]: 4: Hoare triple {2101#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume 1 + main_#t~post7#1 <= 2147483647; {2101#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:10:48,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {2101#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {2114#(<= |ULTIMATE.start_main_#t~post8#1| 0)} is VALID [2022-02-21 03:10:48,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {2114#(<= |ULTIMATE.start_main_#t~post8#1| 0)} assume 1 + main_#t~post8#1 <= 2147483647; {2114#(<= |ULTIMATE.start_main_#t~post8#1| 0)} is VALID [2022-02-21 03:10:48,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {2114#(<= |ULTIMATE.start_main_#t~post8#1| 0)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:10:48,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:10:48,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:10:48,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:10:48,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:10:48,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !(0 != main_~flag~0#1 % 256); {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:10:48,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:10:48,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 1 + main_#t~post7#1 <= 2147483647; {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:10:48,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {2093#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {2094#(<= |ULTIMATE.start_main_#t~post8#1| 1)} is VALID [2022-02-21 03:10:48,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {2094#(<= |ULTIMATE.start_main_#t~post8#1| 1)} assume !(1 + main_#t~post8#1 <= 2147483647); {2090#false} is VALID [2022-02-21 03:10:48,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:48,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:48,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {2148#(<= |ULTIMATE.start_main_#t~post8#1| 2147483646)} assume !(1 + main_#t~post8#1 <= 2147483647); {2090#false} is VALID [2022-02-21 03:10:48,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {2152#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {2148#(<= |ULTIMATE.start_main_#t~post8#1| 2147483646)} is VALID [2022-02-21 03:10:48,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {2152#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} assume 1 + main_#t~post7#1 <= 2147483647; {2152#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} is VALID [2022-02-21 03:10:48,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {2152#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {2152#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} is VALID [2022-02-21 03:10:48,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {2152#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} assume !(0 != main_~flag~0#1 % 256); {2152#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} is VALID [2022-02-21 03:10:48,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {2152#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {2152#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} is VALID [2022-02-21 03:10:48,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {2152#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {2152#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} is VALID [2022-02-21 03:10:48,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {2152#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {2152#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} is VALID [2022-02-21 03:10:48,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {2152#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {2152#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} is VALID [2022-02-21 03:10:48,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {2177#(<= |ULTIMATE.start_main_#t~post8#1| 2147483645)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2152#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} is VALID [2022-02-21 03:10:48,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {2177#(<= |ULTIMATE.start_main_#t~post8#1| 2147483645)} assume 1 + main_#t~post8#1 <= 2147483647; {2177#(<= |ULTIMATE.start_main_#t~post8#1| 2147483645)} is VALID [2022-02-21 03:10:48,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {2184#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {2177#(<= |ULTIMATE.start_main_#t~post8#1| 2147483645)} is VALID [2022-02-21 03:10:48,752 INFO L290 TraceCheckUtils]: 4: Hoare triple {2184#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} assume 1 + main_#t~post7#1 <= 2147483647; {2184#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} is VALID [2022-02-21 03:10:48,752 INFO L290 TraceCheckUtils]: 3: Hoare triple {2184#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {2184#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} is VALID [2022-02-21 03:10:48,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {2184#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {2184#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} is VALID [2022-02-21 03:10:48,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {2089#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {2184#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} is VALID [2022-02-21 03:10:48,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {2089#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {2089#true} is VALID [2022-02-21 03:10:48,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:48,755 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976568859] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:48,755 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:48,755 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-02-21 03:10:48,755 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898209644] [2022-02-21 03:10:48,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:48,755 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 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 17 [2022-02-21 03:10:48,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:48,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 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) [2022-02-21 03:10:48,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:48,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-21 03:10:48,776 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:48,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:10:48,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:10:48,777 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 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) [2022-02-21 03:10:48,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:48,957 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2022-02-21 03:10:48,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-21 03:10:48,957 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 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 17 [2022-02-21 03:10:48,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:48,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 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) [2022-02-21 03:10:48,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 87 transitions. [2022-02-21 03:10:48,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 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) [2022-02-21 03:10:48,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 87 transitions. [2022-02-21 03:10:48,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 87 transitions. [2022-02-21 03:10:49,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:49,007 INFO L225 Difference]: With dead ends: 81 [2022-02-21 03:10:49,008 INFO L226 Difference]: Without dead ends: 80 [2022-02-21 03:10:49,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-02-21 03:10:49,008 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 63 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:49,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 87 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:49,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-02-21 03:10:49,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 64. [2022-02-21 03:10:49,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:49,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 64 states, 55 states have (on average 1.490909090909091) internal successors, (82), 63 states have internal predecessors, (82), 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) [2022-02-21 03:10:49,021 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 64 states, 55 states have (on average 1.490909090909091) internal successors, (82), 63 states have internal predecessors, (82), 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) [2022-02-21 03:10:49,021 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 64 states, 55 states have (on average 1.490909090909091) internal successors, (82), 63 states have internal predecessors, (82), 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) [2022-02-21 03:10:49,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:49,022 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2022-02-21 03:10:49,022 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-02-21 03:10:49,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:49,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:49,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 55 states have (on average 1.490909090909091) internal successors, (82), 63 states have internal predecessors, (82), 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 80 states. [2022-02-21 03:10:49,023 INFO L87 Difference]: Start difference. First operand has 64 states, 55 states have (on average 1.490909090909091) internal successors, (82), 63 states have internal predecessors, (82), 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 80 states. [2022-02-21 03:10:49,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:49,024 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2022-02-21 03:10:49,024 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-02-21 03:10:49,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:49,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:49,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:49,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:49,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.490909090909091) internal successors, (82), 63 states have internal predecessors, (82), 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) [2022-02-21 03:10:49,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 82 transitions. [2022-02-21 03:10:49,026 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 82 transitions. Word has length 17 [2022-02-21 03:10:49,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:49,027 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 82 transitions. [2022-02-21 03:10:49,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 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) [2022-02-21 03:10:49,027 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2022-02-21 03:10:49,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-21 03:10:49,027 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:49,027 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:49,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:49,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:49,228 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:10:49,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:49,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1899523070, now seen corresponding path program 1 times [2022-02-21 03:10:49,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:49,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814350576] [2022-02-21 03:10:49,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:49,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:49,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {2528#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {2528#true} is VALID [2022-02-21 03:10:49,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {2528#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {2530#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:10:49,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {2530#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {2530#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:10:49,270 INFO L290 TraceCheckUtils]: 3: Hoare triple {2530#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {2530#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:10:49,271 INFO L290 TraceCheckUtils]: 4: Hoare triple {2530#(= |ULTIMATE.start_main_~y~0#1| 0)} assume 1 + main_#t~post7#1 <= 2147483647; {2530#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:10:49,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {2530#(= |ULTIMATE.start_main_~y~0#1| 0)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {2531#(= |ULTIMATE.start_main_#t~post8#1| 0)} is VALID [2022-02-21 03:10:49,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {2531#(= |ULTIMATE.start_main_#t~post8#1| 0)} assume 1 + main_#t~post8#1 <= 2147483647; {2531#(= |ULTIMATE.start_main_#t~post8#1| 0)} is VALID [2022-02-21 03:10:49,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {2531#(= |ULTIMATE.start_main_#t~post8#1| 0)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:10:49,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:10:49,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:10:49,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:10:49,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:10:49,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume !(0 != main_~flag~0#1 % 256); {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:10:49,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:10:49,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume 1 + main_#t~post7#1 <= 2147483647; {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:10:49,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {2533#(<= 1 |ULTIMATE.start_main_#t~post8#1|)} is VALID [2022-02-21 03:10:49,275 INFO L290 TraceCheckUtils]: 16: Hoare triple {2533#(<= 1 |ULTIMATE.start_main_#t~post8#1|)} assume 1 + main_#t~post8#1 <= 2147483647; {2533#(<= 1 |ULTIMATE.start_main_#t~post8#1|)} is VALID [2022-02-21 03:10:49,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {2533#(<= 1 |ULTIMATE.start_main_#t~post8#1|)} assume !(1 + main_#t~post8#1 >= -2147483648); {2529#false} is VALID [2022-02-21 03:10:49,275 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:49,276 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:49,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814350576] [2022-02-21 03:10:49,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814350576] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:49,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462808622] [2022-02-21 03:10:49,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:49,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:49,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:49,277 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) [2022-02-21 03:10:49,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-21 03:10:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:49,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:10:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:49,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:49,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {2528#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {2528#true} is VALID [2022-02-21 03:10:49,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {2528#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {2540#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:10:49,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {2540#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {2540#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:10:49,422 INFO L290 TraceCheckUtils]: 3: Hoare triple {2540#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {2540#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:10:49,422 INFO L290 TraceCheckUtils]: 4: Hoare triple {2540#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume 1 + main_#t~post7#1 <= 2147483647; {2540#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:10:49,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {2540#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {2553#(<= 0 |ULTIMATE.start_main_#t~post8#1|)} is VALID [2022-02-21 03:10:49,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {2553#(<= 0 |ULTIMATE.start_main_#t~post8#1|)} assume 1 + main_#t~post8#1 <= 2147483647; {2553#(<= 0 |ULTIMATE.start_main_#t~post8#1|)} is VALID [2022-02-21 03:10:49,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {2553#(<= 0 |ULTIMATE.start_main_#t~post8#1|)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:10:49,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:10:49,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:10:49,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:10:49,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:10:49,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume !(0 != main_~flag~0#1 % 256); {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:10:49,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:10:49,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume 1 + main_#t~post7#1 <= 2147483647; {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:10:49,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {2532#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {2533#(<= 1 |ULTIMATE.start_main_#t~post8#1|)} is VALID [2022-02-21 03:10:49,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {2533#(<= 1 |ULTIMATE.start_main_#t~post8#1|)} assume 1 + main_#t~post8#1 <= 2147483647; {2533#(<= 1 |ULTIMATE.start_main_#t~post8#1|)} is VALID [2022-02-21 03:10:49,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {2533#(<= 1 |ULTIMATE.start_main_#t~post8#1|)} assume !(1 + main_#t~post8#1 >= -2147483648); {2529#false} is VALID [2022-02-21 03:10:49,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:49,427 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:49,427 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462808622] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:49,427 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:49,427 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-02-21 03:10:49,427 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101666243] [2022-02-21 03:10:49,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:49,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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 [2022-02-21 03:10:49,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:49,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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) [2022-02-21 03:10:49,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:49,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:10:49,441 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:49,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:10:49,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:10:49,442 INFO L87 Difference]: Start difference. First operand 64 states and 82 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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) [2022-02-21 03:10:49,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:49,509 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2022-02-21 03:10:49,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:49,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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 [2022-02-21 03:10:49,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:49,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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) [2022-02-21 03:10:49,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-02-21 03:10:49,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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) [2022-02-21 03:10:49,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-02-21 03:10:49,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2022-02-21 03:10:49,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:49,538 INFO L225 Difference]: With dead ends: 64 [2022-02-21 03:10:49,538 INFO L226 Difference]: Without dead ends: 63 [2022-02-21 03:10:49,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:10:49,539 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 22 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:49,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 40 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:49,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-02-21 03:10:49,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-02-21 03:10:49,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:49,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 62 states have internal predecessors, (79), 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) [2022-02-21 03:10:49,553 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 62 states have internal predecessors, (79), 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) [2022-02-21 03:10:49,553 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 62 states have internal predecessors, (79), 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) [2022-02-21 03:10:49,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:49,554 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2022-02-21 03:10:49,554 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 79 transitions. [2022-02-21 03:10:49,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:49,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:49,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 62 states have internal predecessors, (79), 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 63 states. [2022-02-21 03:10:49,554 INFO L87 Difference]: Start difference. First operand has 63 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 62 states have internal predecessors, (79), 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 63 states. [2022-02-21 03:10:49,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:49,555 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2022-02-21 03:10:49,555 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 79 transitions. [2022-02-21 03:10:49,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:49,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:49,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:49,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:49,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 62 states have internal predecessors, (79), 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) [2022-02-21 03:10:49,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 79 transitions. [2022-02-21 03:10:49,556 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 79 transitions. Word has length 18 [2022-02-21 03:10:49,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:49,556 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 79 transitions. [2022-02-21 03:10:49,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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) [2022-02-21 03:10:49,556 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 79 transitions. [2022-02-21 03:10:49,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-21 03:10:49,557 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:49,557 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:49,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:49,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:49,773 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:10:49,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:49,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1244326918, now seen corresponding path program 1 times [2022-02-21 03:10:49,773 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:49,773 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962110050] [2022-02-21 03:10:49,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:49,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:49,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {2856#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {2856#true} is VALID [2022-02-21 03:10:49,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {2856#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {2858#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:10:49,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {2858#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {2859#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-21 03:10:49,849 INFO L290 TraceCheckUtils]: 3: Hoare triple {2859#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {2860#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_#t~post7#1| 0))} is VALID [2022-02-21 03:10:49,849 INFO L290 TraceCheckUtils]: 4: Hoare triple {2860#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_#t~post7#1| 0))} assume 1 + main_#t~post7#1 <= 2147483647; {2860#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_#t~post7#1| 0))} is VALID [2022-02-21 03:10:49,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {2860#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_#t~post7#1| 0))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {2861#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~i~0#1|) 2)} is VALID [2022-02-21 03:10:49,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {2861#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~i~0#1|) 2)} assume 1 + main_#t~post8#1 <= 2147483647; {2861#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~i~0#1|) 2)} is VALID [2022-02-21 03:10:49,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {2861#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~i~0#1|) 2)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2861#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~i~0#1|) 2)} is VALID [2022-02-21 03:10:49,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {2861#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~i~0#1|) 2)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {2861#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~i~0#1|) 2)} is VALID [2022-02-21 03:10:49,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {2861#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~i~0#1|) 2)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {2862#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 2)} is VALID [2022-02-21 03:10:49,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {2862#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 2)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {2862#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 2)} is VALID [2022-02-21 03:10:49,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {2862#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 2)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {2862#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 2)} is VALID [2022-02-21 03:10:49,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {2862#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 2)} assume !(0 != main_~flag~0#1 % 256); {2862#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 2)} is VALID [2022-02-21 03:10:49,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {2862#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 2)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {2863#(<= (+ |ULTIMATE.start_main_#t~post7#1| |ULTIMATE.start_main_~i~0#1|) 2)} is VALID [2022-02-21 03:10:49,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {2863#(<= (+ |ULTIMATE.start_main_#t~post7#1| |ULTIMATE.start_main_~i~0#1|) 2)} assume 1 + main_#t~post7#1 <= 2147483647; {2863#(<= (+ |ULTIMATE.start_main_#t~post7#1| |ULTIMATE.start_main_~i~0#1|) 2)} is VALID [2022-02-21 03:10:49,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {2863#(<= (+ |ULTIMATE.start_main_#t~post7#1| |ULTIMATE.start_main_~i~0#1|) 2)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {2864#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 3)} is VALID [2022-02-21 03:10:49,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {2864#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 3)} assume 1 + main_#t~post8#1 <= 2147483647; {2864#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 3)} is VALID [2022-02-21 03:10:49,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {2864#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 3)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2864#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 3)} is VALID [2022-02-21 03:10:49,856 INFO L290 TraceCheckUtils]: 18: Hoare triple {2864#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 3)} assume !(main_~i~0#1 + main_~x~0#1 <= 2147483647); {2857#false} is VALID [2022-02-21 03:10:49,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:49,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:49,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962110050] [2022-02-21 03:10:49,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962110050] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:49,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929881942] [2022-02-21 03:10:49,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:49,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:49,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:49,858 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:10:49,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-21 03:10:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:49,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:10:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:49,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:50,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {2856#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {2856#true} is VALID [2022-02-21 03:10:50,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {2856#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {2871#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:10:50,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {2871#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {2875#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-21 03:10:50,176 INFO L290 TraceCheckUtils]: 3: Hoare triple {2875#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {2879#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_#t~post7#1| 0))} is VALID [2022-02-21 03:10:50,176 INFO L290 TraceCheckUtils]: 4: Hoare triple {2879#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_#t~post7#1| 0))} assume 1 + main_#t~post7#1 <= 2147483647; {2879#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_#t~post7#1| 0))} is VALID [2022-02-21 03:10:50,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {2879#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_#t~post7#1| 0))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {2886#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:10:50,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {2886#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 1))} assume 1 + main_#t~post8#1 <= 2147483647; {2886#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:10:50,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {2886#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 1))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2886#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:10:50,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {2886#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 1))} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {2886#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:10:50,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {2886#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 1))} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {2899#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:10:50,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {2899#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {2899#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:10:50,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {2899#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {2899#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:10:50,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {2899#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !(0 != main_~flag~0#1 % 256); {2899#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:10:50,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {2899#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {2912#(and (<= |ULTIMATE.start_main_#t~post7#1| 1) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:10:50,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {2912#(and (<= |ULTIMATE.start_main_#t~post7#1| 1) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume 1 + main_#t~post7#1 <= 2147483647; {2912#(and (<= |ULTIMATE.start_main_#t~post7#1| 1) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:10:50,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {2912#(and (<= |ULTIMATE.start_main_#t~post7#1| 1) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {2919#(and (<= |ULTIMATE.start_main_~x~0#1| 2) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:10:50,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {2919#(and (<= |ULTIMATE.start_main_~x~0#1| 2) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume 1 + main_#t~post8#1 <= 2147483647; {2919#(and (<= |ULTIMATE.start_main_~x~0#1| 2) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:10:50,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {2919#(and (<= |ULTIMATE.start_main_~x~0#1| 2) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2919#(and (<= |ULTIMATE.start_main_~x~0#1| 2) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:10:50,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {2919#(and (<= |ULTIMATE.start_main_~x~0#1| 2) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_~i~0#1 + main_~x~0#1 <= 2147483647); {2857#false} is VALID [2022-02-21 03:10:50,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:50,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:11:06,539 INFO L290 TraceCheckUtils]: 18: Hoare triple {2929#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 2147483647)} assume !(main_~i~0#1 + main_~x~0#1 <= 2147483647); {2857#false} is VALID [2022-02-21 03:11:06,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {2929#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 2147483647)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2929#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 2147483647)} is VALID [2022-02-21 03:11:06,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {2929#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 2147483647)} assume 1 + main_#t~post8#1 <= 2147483647; {2929#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 2147483647)} is VALID [2022-02-21 03:11:06,541 INFO L290 TraceCheckUtils]: 15: Hoare triple {2939#(<= (+ |ULTIMATE.start_main_#t~post7#1| |ULTIMATE.start_main_~i~0#1|) 2147483646)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {2929#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 2147483647)} is VALID [2022-02-21 03:11:06,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {2939#(<= (+ |ULTIMATE.start_main_#t~post7#1| |ULTIMATE.start_main_~i~0#1|) 2147483646)} assume 1 + main_#t~post7#1 <= 2147483647; {2939#(<= (+ |ULTIMATE.start_main_#t~post7#1| |ULTIMATE.start_main_~i~0#1|) 2147483646)} is VALID [2022-02-21 03:11:06,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {2946#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 2147483646)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {2939#(<= (+ |ULTIMATE.start_main_#t~post7#1| |ULTIMATE.start_main_~i~0#1|) 2147483646)} is VALID [2022-02-21 03:11:06,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {2946#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 2147483646)} assume !(0 != main_~flag~0#1 % 256); {2946#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 2147483646)} is VALID [2022-02-21 03:11:06,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {2946#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 2147483646)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {2946#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 2147483646)} is VALID [2022-02-21 03:11:06,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {2946#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 2147483646)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {2946#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 2147483646)} is VALID [2022-02-21 03:11:06,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {2959#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~i~0#1|) 2147483646)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {2946#(<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|) 2147483646)} is VALID [2022-02-21 03:11:06,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {2959#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~i~0#1|) 2147483646)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {2959#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~i~0#1|) 2147483646)} is VALID [2022-02-21 03:11:06,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {2959#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~i~0#1|) 2147483646)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2959#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~i~0#1|) 2147483646)} is VALID [2022-02-21 03:11:06,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {2959#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~i~0#1|) 2147483646)} assume 1 + main_#t~post8#1 <= 2147483647; {2959#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~i~0#1|) 2147483646)} is VALID [2022-02-21 03:11:06,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {2972#(<= (+ |ULTIMATE.start_main_#t~post7#1| 1) (div (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) 2147483646) 2))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {2959#(<= (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~i~0#1|) 2147483646)} is VALID [2022-02-21 03:11:06,558 INFO L290 TraceCheckUtils]: 4: Hoare triple {2972#(<= (+ |ULTIMATE.start_main_#t~post7#1| 1) (div (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) 2147483646) 2))} assume 1 + main_#t~post7#1 <= 2147483647; {2972#(<= (+ |ULTIMATE.start_main_#t~post7#1| 1) (div (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) 2147483646) 2))} is VALID [2022-02-21 03:11:06,558 INFO L290 TraceCheckUtils]: 3: Hoare triple {2979#(<= (+ |ULTIMATE.start_main_~x~0#1| 1) (div (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) 2147483646) 2))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {2972#(<= (+ |ULTIMATE.start_main_#t~post7#1| 1) (div (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) 2147483646) 2))} is VALID [2022-02-21 03:11:06,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {2983#(<= |ULTIMATE.start_main_~x~0#1| 1073741822)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {2979#(<= (+ |ULTIMATE.start_main_~x~0#1| 1) (div (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) 2147483646) 2))} is VALID [2022-02-21 03:11:06,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {2856#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {2983#(<= |ULTIMATE.start_main_~x~0#1| 1073741822)} is VALID [2022-02-21 03:11:06,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {2856#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {2856#true} is VALID [2022-02-21 03:11:06,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:11:06,560 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929881942] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:11:06,560 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:11:06,560 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-02-21 03:11:06,560 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76368166] [2022-02-21 03:11:06,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:11:06,562 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.5) internal successors, (55), 23 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 19 [2022-02-21 03:11:06,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:11:06,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 2.5) internal successors, (55), 23 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) [2022-02-21 03:11:06,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:11:06,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-21 03:11:06,600 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:11:06,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-21 03:11:06,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2022-02-21 03:11:06,601 INFO L87 Difference]: Start difference. First operand 63 states and 79 transitions. Second operand has 23 states, 22 states have (on average 2.5) internal successors, (55), 23 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) [2022-02-21 03:11:07,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:07,026 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-02-21 03:11:07,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-21 03:11:07,026 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.5) internal successors, (55), 23 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 19 [2022-02-21 03:11:07,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:11:07,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.5) internal successors, (55), 23 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) [2022-02-21 03:11:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions. [2022-02-21 03:11:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.5) internal successors, (55), 23 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) [2022-02-21 03:11:07,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions. [2022-02-21 03:11:07,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 82 transitions. [2022-02-21 03:11:07,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:11:07,081 INFO L225 Difference]: With dead ends: 76 [2022-02-21 03:11:07,081 INFO L226 Difference]: Without dead ends: 75 [2022-02-21 03:11:07,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=261, Invalid=795, Unknown=0, NotChecked=0, Total=1056 [2022-02-21 03:11:07,082 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 130 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:11:07,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 189 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:11:07,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-02-21 03:11:07,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2022-02-21 03:11:07,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:11:07,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 65 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 64 states have internal predecessors, (79), 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) [2022-02-21 03:11:07,095 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 65 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 64 states have internal predecessors, (79), 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) [2022-02-21 03:11:07,095 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 65 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 64 states have internal predecessors, (79), 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) [2022-02-21 03:11:07,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:07,096 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2022-02-21 03:11:07,096 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2022-02-21 03:11:07,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:07,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:11:07,097 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 64 states have internal predecessors, (79), 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 75 states. [2022-02-21 03:11:07,097 INFO L87 Difference]: Start difference. First operand has 65 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 64 states have internal predecessors, (79), 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 75 states. [2022-02-21 03:11:07,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:07,098 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2022-02-21 03:11:07,098 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2022-02-21 03:11:07,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:07,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:11:07,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:11:07,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:11:07,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 64 states have internal predecessors, (79), 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) [2022-02-21 03:11:07,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2022-02-21 03:11:07,099 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 19 [2022-02-21 03:11:07,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:11:07,099 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2022-02-21 03:11:07,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.5) internal successors, (55), 23 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) [2022-02-21 03:11:07,100 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2022-02-21 03:11:07,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-21 03:11:07,100 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:11:07,100 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:11:07,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-21 03:11:07,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-21 03:11:07,308 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:11:07,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:11:07,308 INFO L85 PathProgramCache]: Analyzing trace with hash 80571264, now seen corresponding path program 1 times [2022-02-21 03:11:07,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:11:07,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430769000] [2022-02-21 03:11:07,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:11:07,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:11:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:07,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {3310#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {3310#true} is VALID [2022-02-21 03:11:07,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {3310#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {3312#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:11:07,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {3312#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {3313#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-21 03:11:07,379 INFO L290 TraceCheckUtils]: 3: Hoare triple {3313#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {3314#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0))} is VALID [2022-02-21 03:11:07,379 INFO L290 TraceCheckUtils]: 4: Hoare triple {3314#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0))} assume 1 + main_#t~post7#1 <= 2147483647; {3314#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0))} is VALID [2022-02-21 03:11:07,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {3314#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {3315#(<= 2 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:11:07,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {3315#(<= 2 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~i~0#1|))} assume 1 + main_#t~post8#1 <= 2147483647; {3315#(<= 2 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:11:07,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {3315#(<= 2 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~i~0#1|))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3315#(<= 2 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:11:07,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {3315#(<= 2 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~i~0#1|))} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {3315#(<= 2 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:11:07,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {3315#(<= 2 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~i~0#1|))} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {3316#(<= 2 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:11:07,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {3316#(<= 2 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {3316#(<= 2 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:11:07,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {3316#(<= 2 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {3316#(<= 2 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:11:07,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {3316#(<= 2 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !(0 != main_~flag~0#1 % 256); {3316#(<= 2 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:11:07,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {3316#(<= 2 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {3317#(<= 2 (+ |ULTIMATE.start_main_#t~post7#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:11:07,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {3317#(<= 2 (+ |ULTIMATE.start_main_#t~post7#1| |ULTIMATE.start_main_~i~0#1|))} assume 1 + main_#t~post7#1 <= 2147483647; {3317#(<= 2 (+ |ULTIMATE.start_main_#t~post7#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:11:07,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {3317#(<= 2 (+ |ULTIMATE.start_main_#t~post7#1| |ULTIMATE.start_main_~i~0#1|))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {3318#(<= 3 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:11:07,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {3318#(<= 3 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} assume 1 + main_#t~post8#1 <= 2147483647; {3318#(<= 3 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:11:07,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {3318#(<= 3 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3318#(<= 3 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:11:07,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {3318#(<= 3 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {3318#(<= 3 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:11:07,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {3318#(<= 3 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !(main_~i~0#1 + main_~x~0#1 >= -2147483648); {3311#false} is VALID [2022-02-21 03:11:07,396 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:11:07,396 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:11:07,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430769000] [2022-02-21 03:11:07,396 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430769000] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:11:07,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326512143] [2022-02-21 03:11:07,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:11:07,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:11:07,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:11:07,397 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:11:07,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-21 03:11:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:07,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:11:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:07,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:11:07,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {3310#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {3310#true} is VALID [2022-02-21 03:11:07,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {3310#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {3325#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:11:07,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {3325#(<= 0 |ULTIMATE.start_main_~x~0#1|)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {3329#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:11:07,694 INFO L290 TraceCheckUtils]: 3: Hoare triple {3329#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {3333#(and (<= 0 |ULTIMATE.start_main_#t~post7#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:11:07,695 INFO L290 TraceCheckUtils]: 4: Hoare triple {3333#(and (<= 0 |ULTIMATE.start_main_#t~post7#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume 1 + main_#t~post7#1 <= 2147483647; {3333#(and (<= 0 |ULTIMATE.start_main_#t~post7#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:11:07,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {3333#(and (<= 0 |ULTIMATE.start_main_#t~post7#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {3340#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:11:07,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {3340#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|))} assume 1 + main_#t~post8#1 <= 2147483647; {3340#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:11:07,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {3340#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3340#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:11:07,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {3340#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|))} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {3340#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:11:07,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {3340#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|))} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {3353#(and (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:11:07,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {3353#(and (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|))} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {3353#(and (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:11:07,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {3353#(and (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|))} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {3353#(and (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:11:07,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {3353#(and (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|))} assume !(0 != main_~flag~0#1 % 256); {3353#(and (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:11:07,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {3353#(and (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~x~0#1|))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {3366#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post7#1|))} is VALID [2022-02-21 03:11:07,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {3366#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post7#1|))} assume 1 + main_#t~post7#1 <= 2147483647; {3366#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post7#1|))} is VALID [2022-02-21 03:11:07,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {3366#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post7#1|))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {3373#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:11:07,700 INFO L290 TraceCheckUtils]: 16: Hoare triple {3373#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|))} assume 1 + main_#t~post8#1 <= 2147483647; {3373#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:11:07,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {3373#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3373#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:11:07,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {3373#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|))} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {3373#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:11:07,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {3373#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|))} assume !(main_~i~0#1 + main_~x~0#1 >= -2147483648); {3311#false} is VALID [2022-02-21 03:11:07,701 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:11:07,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:11:07,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326512143] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:11:07,701 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:11:07,701 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2022-02-21 03:11:07,702 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397454160] [2022-02-21 03:11:07,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:11:07,702 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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 [2022-02-21 03:11:07,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:11:07,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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) [2022-02-21 03:11:07,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:11:07,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-21 03:11:07,716 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:11:07,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 03:11:07,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-02-21 03:11:07,717 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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) [2022-02-21 03:11:07,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:07,877 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-02-21 03:11:07,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:11:07,877 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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 [2022-02-21 03:11:07,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:11:07,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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) [2022-02-21 03:11:07,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 40 transitions. [2022-02-21 03:11:07,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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) [2022-02-21 03:11:07,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 40 transitions. [2022-02-21 03:11:07,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 40 transitions. [2022-02-21 03:11:07,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:11:07,905 INFO L225 Difference]: With dead ends: 65 [2022-02-21 03:11:07,905 INFO L226 Difference]: Without dead ends: 64 [2022-02-21 03:11:07,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2022-02-21 03:11:07,906 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 61 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:11:07,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 61 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:11:07,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-21 03:11:07,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-02-21 03:11:07,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:11:07,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 64 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 63 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) [2022-02-21 03:11:07,925 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 64 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 63 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) [2022-02-21 03:11:07,925 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 64 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 63 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) [2022-02-21 03:11:07,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:07,926 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2022-02-21 03:11:07,926 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2022-02-21 03:11:07,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:07,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:11:07,926 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 63 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) Second operand 64 states. [2022-02-21 03:11:07,926 INFO L87 Difference]: Start difference. First operand has 64 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 63 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) Second operand 64 states. [2022-02-21 03:11:07,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:07,927 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2022-02-21 03:11:07,927 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2022-02-21 03:11:07,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:07,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:11:07,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:11:07,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:11:07,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 63 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) [2022-02-21 03:11:07,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2022-02-21 03:11:07,928 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 20 [2022-02-21 03:11:07,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:11:07,928 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2022-02-21 03:11:07,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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) [2022-02-21 03:11:07,929 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2022-02-21 03:11:07,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 03:11:07,929 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:11:07,929 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:11:07,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-02-21 03:11:08,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:11:08,143 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:11:08,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:11:08,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1797258052, now seen corresponding path program 1 times [2022-02-21 03:11:08,144 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:11:08,144 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787995396] [2022-02-21 03:11:08,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:11:08,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:11:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:08,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {3660#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {3660#true} is VALID [2022-02-21 03:11:08,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {3660#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {3662#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:11:08,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {3662#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {3663#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:08,206 INFO L290 TraceCheckUtils]: 3: Hoare triple {3663#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {3663#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:08,207 INFO L290 TraceCheckUtils]: 4: Hoare triple {3663#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post7#1 <= 2147483647; {3663#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:08,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {3663#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {3664#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:08,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {3664#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post8#1 <= 2147483647; {3664#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:08,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {3664#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3665#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2)} is VALID [2022-02-21 03:11:08,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {3665#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {3665#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2)} is VALID [2022-02-21 03:11:08,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {3665#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {3665#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2)} is VALID [2022-02-21 03:11:08,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {3665#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {3665#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2)} is VALID [2022-02-21 03:11:08,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {3665#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {3666#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2)} is VALID [2022-02-21 03:11:08,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {3666#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2)} assume !(0 != main_~flag~0#1 % 256); {3666#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2)} is VALID [2022-02-21 03:11:08,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {3666#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {3666#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2)} is VALID [2022-02-21 03:11:08,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {3666#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2)} assume 1 + main_#t~post7#1 <= 2147483647; {3666#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2)} is VALID [2022-02-21 03:11:08,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {3666#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {3667#(<= (+ |ULTIMATE.start_main_#t~post8#1| |ULTIMATE.start_main_~j~0#1|) 2)} is VALID [2022-02-21 03:11:08,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {3667#(<= (+ |ULTIMATE.start_main_#t~post8#1| |ULTIMATE.start_main_~j~0#1|) 2)} assume 1 + main_#t~post8#1 <= 2147483647; {3667#(<= (+ |ULTIMATE.start_main_#t~post8#1| |ULTIMATE.start_main_~j~0#1|) 2)} is VALID [2022-02-21 03:11:08,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {3667#(<= (+ |ULTIMATE.start_main_#t~post8#1| |ULTIMATE.start_main_~j~0#1|) 2)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3668#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 3)} is VALID [2022-02-21 03:11:08,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {3668#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 3)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {3668#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 3)} is VALID [2022-02-21 03:11:08,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {3668#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 3)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {3668#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 3)} is VALID [2022-02-21 03:11:08,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {3668#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 3)} assume !(main_~j~0#1 + main_~y~0#1 <= 2147483647); {3661#false} is VALID [2022-02-21 03:11:08,219 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:11:08,219 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:11:08,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787995396] [2022-02-21 03:11:08,219 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787995396] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:11:08,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30927709] [2022-02-21 03:11:08,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:11:08,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:11:08,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:11:08,220 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:11:08,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-21 03:11:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:08,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:11:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:08,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:11:08,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {3660#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {3660#true} is VALID [2022-02-21 03:11:08,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {3660#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {3675#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:11:08,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {3675#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {3679#(and (<= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:08,498 INFO L290 TraceCheckUtils]: 3: Hoare triple {3679#(and (<= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {3679#(and (<= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:08,498 INFO L290 TraceCheckUtils]: 4: Hoare triple {3679#(and (<= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post7#1 <= 2147483647; {3679#(and (<= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:08,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {3679#(and (<= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {3689#(and (<= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:08,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {3689#(and (<= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post8#1 <= 2147483647; {3689#(and (<= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:08,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {3689#(and (<= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3696#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:08,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {3696#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {3696#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:08,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {3696#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {3696#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:08,503 INFO L290 TraceCheckUtils]: 10: Hoare triple {3696#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {3696#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:08,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {3696#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {3709#(and (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:11:08,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {3709#(and (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 1))} assume !(0 != main_~flag~0#1 % 256); {3709#(and (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:11:08,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {3709#(and (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {3709#(and (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:11:08,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {3709#(and (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 1))} assume 1 + main_#t~post7#1 <= 2147483647; {3709#(and (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:11:08,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {3709#(and (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 1))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {3722#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= |ULTIMATE.start_main_#t~post8#1| 1))} is VALID [2022-02-21 03:11:08,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {3722#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= |ULTIMATE.start_main_#t~post8#1| 1))} assume 1 + main_#t~post8#1 <= 2147483647; {3722#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= |ULTIMATE.start_main_#t~post8#1| 1))} is VALID [2022-02-21 03:11:08,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {3722#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= |ULTIMATE.start_main_#t~post8#1| 1))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3729#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= |ULTIMATE.start_main_~y~0#1| 2))} is VALID [2022-02-21 03:11:08,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {3729#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= |ULTIMATE.start_main_~y~0#1| 2))} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {3729#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= |ULTIMATE.start_main_~y~0#1| 2))} is VALID [2022-02-21 03:11:08,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {3729#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= |ULTIMATE.start_main_~y~0#1| 2))} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {3729#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= |ULTIMATE.start_main_~y~0#1| 2))} is VALID [2022-02-21 03:11:08,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {3729#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= |ULTIMATE.start_main_~y~0#1| 2))} assume !(main_~j~0#1 + main_~y~0#1 <= 2147483647); {3661#false} is VALID [2022-02-21 03:11:08,508 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:11:08,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:11:24,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {3739#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647)} assume !(main_~j~0#1 + main_~y~0#1 <= 2147483647); {3661#false} is VALID [2022-02-21 03:11:24,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {3739#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {3739#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647)} is VALID [2022-02-21 03:11:24,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {3739#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {3739#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647)} is VALID [2022-02-21 03:11:24,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {3749#(<= (+ |ULTIMATE.start_main_#t~post8#1| |ULTIMATE.start_main_~j~0#1|) 2147483646)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3739#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647)} is VALID [2022-02-21 03:11:24,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {3749#(<= (+ |ULTIMATE.start_main_#t~post8#1| |ULTIMATE.start_main_~j~0#1|) 2147483646)} assume 1 + main_#t~post8#1 <= 2147483647; {3749#(<= (+ |ULTIMATE.start_main_#t~post8#1| |ULTIMATE.start_main_~j~0#1|) 2147483646)} is VALID [2022-02-21 03:11:24,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {3756#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483646)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {3749#(<= (+ |ULTIMATE.start_main_#t~post8#1| |ULTIMATE.start_main_~j~0#1|) 2147483646)} is VALID [2022-02-21 03:11:24,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {3756#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483646)} assume 1 + main_#t~post7#1 <= 2147483647; {3756#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483646)} is VALID [2022-02-21 03:11:24,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {3756#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483646)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {3756#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483646)} is VALID [2022-02-21 03:11:24,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {3756#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483646)} assume !(0 != main_~flag~0#1 % 256); {3756#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483646)} is VALID [2022-02-21 03:11:24,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {3769#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2147483646)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {3756#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483646)} is VALID [2022-02-21 03:11:24,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {3769#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2147483646)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {3769#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2147483646)} is VALID [2022-02-21 03:11:24,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {3769#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2147483646)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {3769#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2147483646)} is VALID [2022-02-21 03:11:24,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {3769#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2147483646)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {3769#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2147483646)} is VALID [2022-02-21 03:11:24,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {3782#(<= (+ |ULTIMATE.start_main_#t~post8#1| 1) (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) 2147483646) 2))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3769#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2147483646)} is VALID [2022-02-21 03:11:24,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {3782#(<= (+ |ULTIMATE.start_main_#t~post8#1| 1) (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) 2147483646) 2))} assume 1 + main_#t~post8#1 <= 2147483647; {3782#(<= (+ |ULTIMATE.start_main_#t~post8#1| 1) (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) 2147483646) 2))} is VALID [2022-02-21 03:11:24,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {3789#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) 2147483646) 2))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {3782#(<= (+ |ULTIMATE.start_main_#t~post8#1| 1) (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) 2147483646) 2))} is VALID [2022-02-21 03:11:24,863 INFO L290 TraceCheckUtils]: 4: Hoare triple {3789#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) 2147483646) 2))} assume 1 + main_#t~post7#1 <= 2147483647; {3789#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) 2147483646) 2))} is VALID [2022-02-21 03:11:24,863 INFO L290 TraceCheckUtils]: 3: Hoare triple {3789#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) 2147483646) 2))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {3789#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) 2147483646) 2))} is VALID [2022-02-21 03:11:24,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {3799#(<= |ULTIMATE.start_main_~y~0#1| 1073741822)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {3789#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) 2147483646) 2))} is VALID [2022-02-21 03:11:24,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {3660#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {3799#(<= |ULTIMATE.start_main_~y~0#1| 1073741822)} is VALID [2022-02-21 03:11:24,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {3660#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {3660#true} is VALID [2022-02-21 03:11:24,864 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:11:24,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30927709] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:11:24,864 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:11:24,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-02-21 03:11:24,864 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893333040] [2022-02-21 03:11:24,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:11:24,865 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 23 states have internal predecessors, (61), 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 [2022-02-21 03:11:24,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:11:24,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 23 states have internal predecessors, (61), 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) [2022-02-21 03:11:24,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:11:24,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-21 03:11:24,904 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:11:24,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-21 03:11:24,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2022-02-21 03:11:24,905 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 23 states have internal predecessors, (61), 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) [2022-02-21 03:11:25,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:25,576 INFO L93 Difference]: Finished difference Result 121 states and 138 transitions. [2022-02-21 03:11:25,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-21 03:11:25,576 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 23 states have internal predecessors, (61), 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 [2022-02-21 03:11:25,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:11:25,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 23 states have internal predecessors, (61), 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) [2022-02-21 03:11:25,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 94 transitions. [2022-02-21 03:11:25,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 23 states have internal predecessors, (61), 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) [2022-02-21 03:11:25,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 94 transitions. [2022-02-21 03:11:25,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 94 transitions. [2022-02-21 03:11:25,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:11:25,645 INFO L225 Difference]: With dead ends: 121 [2022-02-21 03:11:25,645 INFO L226 Difference]: Without dead ends: 120 [2022-02-21 03:11:25,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=364, Invalid=1118, Unknown=0, NotChecked=0, Total=1482 [2022-02-21 03:11:25,646 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 156 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:11:25,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 138 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:11:25,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-02-21 03:11:25,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 100. [2022-02-21 03:11:25,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:11:25,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 100 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 99 states have internal predecessors, (115), 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) [2022-02-21 03:11:25,694 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 100 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 99 states have internal predecessors, (115), 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) [2022-02-21 03:11:25,694 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 100 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 99 states have internal predecessors, (115), 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) [2022-02-21 03:11:25,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:25,695 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2022-02-21 03:11:25,696 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2022-02-21 03:11:25,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:25,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:11:25,696 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 99 states have internal predecessors, (115), 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 120 states. [2022-02-21 03:11:25,696 INFO L87 Difference]: Start difference. First operand has 100 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 99 states have internal predecessors, (115), 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 120 states. [2022-02-21 03:11:25,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:25,700 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2022-02-21 03:11:25,700 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2022-02-21 03:11:25,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:25,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:11:25,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:11:25,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:11:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 99 states have internal predecessors, (115), 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) [2022-02-21 03:11:25,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 115 transitions. [2022-02-21 03:11:25,704 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 115 transitions. Word has length 21 [2022-02-21 03:11:25,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:11:25,704 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 115 transitions. [2022-02-21 03:11:25,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 23 states have internal predecessors, (61), 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) [2022-02-21 03:11:25,705 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 115 transitions. [2022-02-21 03:11:25,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-21 03:11:25,705 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:11:25,706 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:11:25,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:11:25,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:11:25,920 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:11:25,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:11:25,920 INFO L85 PathProgramCache]: Analyzing trace with hash 119575298, now seen corresponding path program 1 times [2022-02-21 03:11:25,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:11:25,920 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045404264] [2022-02-21 03:11:25,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:11:25,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:11:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:26,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {4318#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {4318#true} is VALID [2022-02-21 03:11:26,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {4318#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {4320#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:11:26,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {4320#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {4321#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-21 03:11:26,010 INFO L290 TraceCheckUtils]: 3: Hoare triple {4321#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {4321#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-21 03:11:26,011 INFO L290 TraceCheckUtils]: 4: Hoare triple {4321#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0))} assume 1 + main_#t~post7#1 <= 2147483647; {4321#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-21 03:11:26,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {4321#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {4322#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:11:26,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {4322#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume 1 + main_#t~post8#1 <= 2147483647; {4322#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:11:26,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {4322#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {4323#(<= 2 (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:11:26,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {4323#(<= 2 (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|))} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {4323#(<= 2 (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:11:26,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {4323#(<= 2 (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|))} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {4323#(<= 2 (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:11:26,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {4323#(<= 2 (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|))} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {4323#(<= 2 (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:11:26,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {4323#(<= 2 (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|))} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {4324#(<= 2 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:11:26,014 INFO L290 TraceCheckUtils]: 12: Hoare triple {4324#(<= 2 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} assume !(0 != main_~flag~0#1 % 256); {4324#(<= 2 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:11:26,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {4324#(<= 2 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {4324#(<= 2 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:11:26,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {4324#(<= 2 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} assume 1 + main_#t~post7#1 <= 2147483647; {4324#(<= 2 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:11:26,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {4324#(<= 2 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {4325#(<= 2 (+ |ULTIMATE.start_main_#t~post8#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:11:26,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {4325#(<= 2 (+ |ULTIMATE.start_main_#t~post8#1| |ULTIMATE.start_main_~j~0#1|))} assume 1 + main_#t~post8#1 <= 2147483647; {4325#(<= 2 (+ |ULTIMATE.start_main_#t~post8#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:11:26,017 INFO L290 TraceCheckUtils]: 17: Hoare triple {4325#(<= 2 (+ |ULTIMATE.start_main_#t~post8#1| |ULTIMATE.start_main_~j~0#1|))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {4326#(<= 3 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:11:26,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {4326#(<= 3 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {4326#(<= 3 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:11:26,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {4326#(<= 3 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {4326#(<= 3 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:11:26,018 INFO L290 TraceCheckUtils]: 20: Hoare triple {4326#(<= 3 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {4326#(<= 3 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:11:26,018 INFO L290 TraceCheckUtils]: 21: Hoare triple {4326#(<= 3 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|))} assume !(main_~j~0#1 + main_~y~0#1 >= -2147483648); {4319#false} is VALID [2022-02-21 03:11:26,019 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:11:26,019 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:11:26,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045404264] [2022-02-21 03:11:26,019 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045404264] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:11:26,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171321046] [2022-02-21 03:11:26,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:11:26,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:11:26,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:11:26,021 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:11:26,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-21 03:11:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:26,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:11:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:26,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:11:26,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {4318#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {4318#true} is VALID [2022-02-21 03:11:26,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {4318#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {4333#(<= 0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:11:26,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {4333#(<= 0 |ULTIMATE.start_main_~y~0#1|)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {4337#(and (<= 0 |ULTIMATE.start_main_~y~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:11:26,317 INFO L290 TraceCheckUtils]: 3: Hoare triple {4337#(and (<= 0 |ULTIMATE.start_main_~y~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {4337#(and (<= 0 |ULTIMATE.start_main_~y~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:11:26,318 INFO L290 TraceCheckUtils]: 4: Hoare triple {4337#(and (<= 0 |ULTIMATE.start_main_~y~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume 1 + main_#t~post7#1 <= 2147483647; {4337#(and (<= 0 |ULTIMATE.start_main_~y~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:11:26,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {4337#(and (<= 0 |ULTIMATE.start_main_~y~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {4347#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:11:26,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {4347#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume 1 + main_#t~post8#1 <= 2147483647; {4347#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:11:26,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {4347#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {4354#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:11:26,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {4354#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {4354#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:11:26,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {4354#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {4354#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:11:26,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {4354#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {4354#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:11:26,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {4354#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {4367#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:11:26,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {4367#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~j~0#1|))} assume !(0 != main_~flag~0#1 % 256); {4367#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:11:26,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {4367#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~j~0#1|))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {4367#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:11:26,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {4367#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~j~0#1|))} assume 1 + main_#t~post7#1 <= 2147483647; {4367#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:11:26,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {4367#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~j~0#1|))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {4380#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|))} is VALID [2022-02-21 03:11:26,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {4380#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|))} assume 1 + main_#t~post8#1 <= 2147483647; {4380#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|))} is VALID [2022-02-21 03:11:26,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {4380#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {4387#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:11:26,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {4387#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~y~0#1|))} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {4387#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:11:26,324 INFO L290 TraceCheckUtils]: 19: Hoare triple {4387#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~y~0#1|))} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {4387#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:11:26,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {4387#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~y~0#1|))} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {4387#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:11:26,325 INFO L290 TraceCheckUtils]: 21: Hoare triple {4387#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~y~0#1|))} assume !(main_~j~0#1 + main_~y~0#1 >= -2147483648); {4319#false} is VALID [2022-02-21 03:11:26,325 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:11:26,325 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:11:26,325 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171321046] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:11:26,325 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:11:26,325 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2022-02-21 03:11:26,325 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819465417] [2022-02-21 03:11:26,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:11:26,326 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 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 [2022-02-21 03:11:26,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:11:26,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 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) [2022-02-21 03:11:26,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:11:26,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-21 03:11:26,348 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:11:26,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 03:11:26,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-02-21 03:11:26,348 INFO L87 Difference]: Start difference. First operand 100 states and 115 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 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) [2022-02-21 03:11:26,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:26,560 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2022-02-21 03:11:26,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:11:26,560 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 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 [2022-02-21 03:11:26,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:11:26,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 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) [2022-02-21 03:11:26,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 41 transitions. [2022-02-21 03:11:26,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 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) [2022-02-21 03:11:26,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 41 transitions. [2022-02-21 03:11:26,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 41 transitions. [2022-02-21 03:11:26,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:11:26,591 INFO L225 Difference]: With dead ends: 100 [2022-02-21 03:11:26,591 INFO L226 Difference]: Without dead ends: 98 [2022-02-21 03:11:26,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2022-02-21 03:11:26,592 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 34 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:11:26,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 55 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:11:26,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-02-21 03:11:26,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-02-21 03:11:26,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:11:26,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 98 states, 93 states have (on average 1.1505376344086022) internal successors, (107), 97 states have internal predecessors, (107), 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) [2022-02-21 03:11:26,641 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 98 states, 93 states have (on average 1.1505376344086022) internal successors, (107), 97 states have internal predecessors, (107), 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) [2022-02-21 03:11:26,642 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 98 states, 93 states have (on average 1.1505376344086022) internal successors, (107), 97 states have internal predecessors, (107), 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) [2022-02-21 03:11:26,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:26,643 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2022-02-21 03:11:26,643 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2022-02-21 03:11:26,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:26,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:11:26,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 93 states have (on average 1.1505376344086022) internal successors, (107), 97 states have internal predecessors, (107), 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 98 states. [2022-02-21 03:11:26,646 INFO L87 Difference]: Start difference. First operand has 98 states, 93 states have (on average 1.1505376344086022) internal successors, (107), 97 states have internal predecessors, (107), 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 98 states. [2022-02-21 03:11:26,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:26,648 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2022-02-21 03:11:26,648 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2022-02-21 03:11:26,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:26,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:11:26,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:11:26,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:11:26,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 93 states have (on average 1.1505376344086022) internal successors, (107), 97 states have internal predecessors, (107), 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) [2022-02-21 03:11:26,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2022-02-21 03:11:26,651 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 22 [2022-02-21 03:11:26,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:11:26,652 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2022-02-21 03:11:26,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 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) [2022-02-21 03:11:26,652 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2022-02-21 03:11:26,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-21 03:11:26,653 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:11:26,653 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:11:26,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:11:26,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-02-21 03:11:26,859 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:11:26,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:11:26,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1052253532, now seen corresponding path program 1 times [2022-02-21 03:11:26,859 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:11:26,859 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92606064] [2022-02-21 03:11:26,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:11:26,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:11:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:26,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {4819#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {4819#true} is VALID [2022-02-21 03:11:26,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {4819#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {4819#true} is VALID [2022-02-21 03:11:26,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {4819#true} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {4819#true} is VALID [2022-02-21 03:11:26,883 INFO L290 TraceCheckUtils]: 3: Hoare triple {4819#true} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {4819#true} is VALID [2022-02-21 03:11:26,883 INFO L290 TraceCheckUtils]: 4: Hoare triple {4819#true} assume 1 + main_#t~post7#1 <= 2147483647; {4819#true} is VALID [2022-02-21 03:11:26,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {4819#true} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {4819#true} is VALID [2022-02-21 03:11:26,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {4819#true} assume 1 + main_#t~post8#1 <= 2147483647; {4819#true} is VALID [2022-02-21 03:11:26,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {4819#true} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {4819#true} is VALID [2022-02-21 03:11:26,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {4819#true} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {4819#true} is VALID [2022-02-21 03:11:26,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {4819#true} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {4819#true} is VALID [2022-02-21 03:11:26,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {4819#true} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {4819#true} is VALID [2022-02-21 03:11:26,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {4819#true} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {4819#true} is VALID [2022-02-21 03:11:26,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {4819#true} assume !(0 != main_~flag~0#1 % 256); {4821#(= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0)} is VALID [2022-02-21 03:11:26,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {4821#(= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {4821#(= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0)} is VALID [2022-02-21 03:11:26,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {4821#(= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0)} assume 1 + main_#t~post7#1 <= 2147483647; {4821#(= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0)} is VALID [2022-02-21 03:11:26,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {4821#(= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {4821#(= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0)} is VALID [2022-02-21 03:11:26,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {4821#(= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0)} assume 1 + main_#t~post8#1 <= 2147483647; {4821#(= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0)} is VALID [2022-02-21 03:11:26,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {4821#(= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {4821#(= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0)} is VALID [2022-02-21 03:11:26,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {4821#(= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {4821#(= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0)} is VALID [2022-02-21 03:11:26,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {4821#(= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {4821#(= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0)} is VALID [2022-02-21 03:11:26,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {4821#(= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {4821#(= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0)} is VALID [2022-02-21 03:11:26,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {4821#(= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {4821#(= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0)} is VALID [2022-02-21 03:11:26,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {4821#(= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0)} assume 0 != main_~flag~0#1 % 256; {4820#false} is VALID [2022-02-21 03:11:26,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {4820#false} assume !(1 + main_~j~0#1 <= 2147483647); {4820#false} is VALID [2022-02-21 03:11:26,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:11:26,889 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:11:26,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92606064] [2022-02-21 03:11:26,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92606064] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:11:26,889 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:11:26,890 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:11:26,890 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937971372] [2022-02-21 03:11:26,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:11:26,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2022-02-21 03:11:26,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:11:26,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-02-21 03:11:26,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:11:26,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:11:26,908 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:11:26,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:11:26,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:11:26,909 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-02-21 03:11:27,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:27,008 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2022-02-21 03:11:27,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:11:27,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2022-02-21 03:11:27,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:11:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-02-21 03:11:27,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-02-21 03:11:27,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-02-21 03:11:27,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-02-21 03:11:27,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2022-02-21 03:11:27,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:11:27,051 INFO L225 Difference]: With dead ends: 157 [2022-02-21 03:11:27,051 INFO L226 Difference]: Without dead ends: 120 [2022-02-21 03:11:27,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:11:27,053 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:11:27,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 49 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:11:27,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-02-21 03:11:27,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2022-02-21 03:11:27,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:11:27,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 116 states, 111 states have (on average 1.1441441441441442) internal successors, (127), 115 states have internal predecessors, (127), 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) [2022-02-21 03:11:27,112 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 116 states, 111 states have (on average 1.1441441441441442) internal successors, (127), 115 states have internal predecessors, (127), 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) [2022-02-21 03:11:27,113 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 116 states, 111 states have (on average 1.1441441441441442) internal successors, (127), 115 states have internal predecessors, (127), 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) [2022-02-21 03:11:27,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:27,114 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2022-02-21 03:11:27,115 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2022-02-21 03:11:27,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:27,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:11:27,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 111 states have (on average 1.1441441441441442) internal successors, (127), 115 states have internal predecessors, (127), 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 120 states. [2022-02-21 03:11:27,116 INFO L87 Difference]: Start difference. First operand has 116 states, 111 states have (on average 1.1441441441441442) internal successors, (127), 115 states have internal predecessors, (127), 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 120 states. [2022-02-21 03:11:27,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:27,118 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2022-02-21 03:11:27,118 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2022-02-21 03:11:27,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:27,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:11:27,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:11:27,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:11:27,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.1441441441441442) internal successors, (127), 115 states have internal predecessors, (127), 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) [2022-02-21 03:11:27,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2022-02-21 03:11:27,121 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 24 [2022-02-21 03:11:27,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:11:27,121 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2022-02-21 03:11:27,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-02-21 03:11:27,122 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2022-02-21 03:11:27,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-21 03:11:27,124 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:11:27,124 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:11:27,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-21 03:11:27,124 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:11:27,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:11:27,125 INFO L85 PathProgramCache]: Analyzing trace with hash -2046612408, now seen corresponding path program 1 times [2022-02-21 03:11:27,125 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:11:27,125 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692876079] [2022-02-21 03:11:27,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:11:27,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:11:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:27,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {5362#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {5362#true} is VALID [2022-02-21 03:11:27,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {5362#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {5364#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:11:27,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {5364#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {5365#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:27,234 INFO L290 TraceCheckUtils]: 3: Hoare triple {5365#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {5365#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:27,235 INFO L290 TraceCheckUtils]: 4: Hoare triple {5365#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post7#1 <= 2147483647; {5365#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:27,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {5365#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {5366#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:27,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {5366#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post8#1 <= 2147483647; {5366#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:27,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {5366#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {5367#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2)} is VALID [2022-02-21 03:11:27,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {5367#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {5367#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2)} is VALID [2022-02-21 03:11:27,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {5367#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {5367#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2)} is VALID [2022-02-21 03:11:27,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {5367#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {5367#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2)} is VALID [2022-02-21 03:11:27,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {5367#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {5368#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2)} is VALID [2022-02-21 03:11:27,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {5368#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2)} assume 0 != main_~flag~0#1 % 256; {5368#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2)} is VALID [2022-02-21 03:11:27,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {5368#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2)} assume 1 + main_~j~0#1 <= 2147483647; {5368#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2)} is VALID [2022-02-21 03:11:27,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {5368#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {5369#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 3)} is VALID [2022-02-21 03:11:27,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {5369#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 3)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {5369#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 3)} is VALID [2022-02-21 03:11:27,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {5369#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 3)} assume 1 + main_#t~post7#1 <= 2147483647; {5369#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 3)} is VALID [2022-02-21 03:11:27,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {5369#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 3)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {5370#(<= (+ |ULTIMATE.start_main_#t~post8#1| |ULTIMATE.start_main_~j~0#1|) 3)} is VALID [2022-02-21 03:11:27,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {5370#(<= (+ |ULTIMATE.start_main_#t~post8#1| |ULTIMATE.start_main_~j~0#1|) 3)} assume 1 + main_#t~post8#1 <= 2147483647; {5370#(<= (+ |ULTIMATE.start_main_#t~post8#1| |ULTIMATE.start_main_~j~0#1|) 3)} is VALID [2022-02-21 03:11:27,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {5370#(<= (+ |ULTIMATE.start_main_#t~post8#1| |ULTIMATE.start_main_~j~0#1|) 3)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {5371#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 4)} is VALID [2022-02-21 03:11:27,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {5371#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 4)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {5371#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 4)} is VALID [2022-02-21 03:11:27,242 INFO L290 TraceCheckUtils]: 21: Hoare triple {5371#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 4)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {5371#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 4)} is VALID [2022-02-21 03:11:27,242 INFO L290 TraceCheckUtils]: 22: Hoare triple {5371#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 4)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {5371#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 4)} is VALID [2022-02-21 03:11:27,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {5371#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 4)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {5372#(<= |ULTIMATE.start_main_~j~0#1| 4)} is VALID [2022-02-21 03:11:27,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {5372#(<= |ULTIMATE.start_main_~j~0#1| 4)} assume 0 != main_~flag~0#1 % 256; {5372#(<= |ULTIMATE.start_main_~j~0#1| 4)} is VALID [2022-02-21 03:11:27,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {5372#(<= |ULTIMATE.start_main_~j~0#1| 4)} assume !(1 + main_~j~0#1 <= 2147483647); {5363#false} is VALID [2022-02-21 03:11:27,243 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:11:27,244 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:11:27,244 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692876079] [2022-02-21 03:11:27,244 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692876079] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:11:27,244 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286536055] [2022-02-21 03:11:27,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:11:27,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:11:27,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:11:27,245 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:11:27,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-21 03:11:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:27,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:11:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:27,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:11:27,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {5362#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {5362#true} is VALID [2022-02-21 03:11:27,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {5362#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {5379#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:11:27,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {5379#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {5383#(and (<= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:27,598 INFO L290 TraceCheckUtils]: 3: Hoare triple {5383#(and (<= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {5383#(and (<= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:27,598 INFO L290 TraceCheckUtils]: 4: Hoare triple {5383#(and (<= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post7#1 <= 2147483647; {5383#(and (<= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:27,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {5383#(and (<= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {5393#(and (<= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:27,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {5393#(and (<= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post8#1 <= 2147483647; {5393#(and (<= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:27,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {5393#(and (<= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {5400#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:27,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {5400#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {5400#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:27,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {5400#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {5400#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:27,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {5400#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {5400#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:27,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {5400#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {5413#(and (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:11:27,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {5413#(and (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 1))} assume 0 != main_~flag~0#1 % 256; {5413#(and (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:11:27,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {5413#(and (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 1))} assume 1 + main_~j~0#1 <= 2147483647; {5413#(and (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:11:27,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {5413#(and (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 1))} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {5423#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~y~0#1| 1)))} is VALID [2022-02-21 03:11:27,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {5423#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~y~0#1| 1)))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {5423#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~y~0#1| 1)))} is VALID [2022-02-21 03:11:27,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {5423#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~y~0#1| 1)))} assume 1 + main_#t~post7#1 <= 2147483647; {5423#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~y~0#1| 1)))} is VALID [2022-02-21 03:11:27,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {5423#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~y~0#1| 1)))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {5433#(and (<= |ULTIMATE.start_main_#t~post8#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-21 03:11:27,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {5433#(and (<= |ULTIMATE.start_main_#t~post8#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume 1 + main_#t~post8#1 <= 2147483647; {5433#(and (<= |ULTIMATE.start_main_#t~post8#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-21 03:11:27,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {5433#(and (<= |ULTIMATE.start_main_#t~post8#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {5440#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-21 03:11:27,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {5440#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {5440#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-21 03:11:27,617 INFO L290 TraceCheckUtils]: 21: Hoare triple {5440#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {5440#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-21 03:11:27,618 INFO L290 TraceCheckUtils]: 22: Hoare triple {5440#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {5440#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-21 03:11:27,619 INFO L290 TraceCheckUtils]: 23: Hoare triple {5440#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {5372#(<= |ULTIMATE.start_main_~j~0#1| 4)} is VALID [2022-02-21 03:11:27,619 INFO L290 TraceCheckUtils]: 24: Hoare triple {5372#(<= |ULTIMATE.start_main_~j~0#1| 4)} assume 0 != main_~flag~0#1 % 256; {5372#(<= |ULTIMATE.start_main_~j~0#1| 4)} is VALID [2022-02-21 03:11:27,620 INFO L290 TraceCheckUtils]: 25: Hoare triple {5372#(<= |ULTIMATE.start_main_~j~0#1| 4)} assume !(1 + main_~j~0#1 <= 2147483647); {5363#false} is VALID [2022-02-21 03:11:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:11:27,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:11:42,422 INFO L290 TraceCheckUtils]: 25: Hoare triple {5459#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} assume !(1 + main_~j~0#1 <= 2147483647); {5363#false} is VALID [2022-02-21 03:11:42,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {5459#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} assume 0 != main_~flag~0#1 % 256; {5459#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} is VALID [2022-02-21 03:11:42,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {5466#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483646)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {5459#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} is VALID [2022-02-21 03:11:42,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {5466#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483646)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {5466#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483646)} is VALID [2022-02-21 03:11:42,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {5466#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483646)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {5466#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483646)} is VALID [2022-02-21 03:11:42,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {5466#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483646)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {5466#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483646)} is VALID [2022-02-21 03:11:42,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {5479#(<= (+ |ULTIMATE.start_main_#t~post8#1| |ULTIMATE.start_main_~j~0#1|) 2147483645)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {5466#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483646)} is VALID [2022-02-21 03:11:42,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {5479#(<= (+ |ULTIMATE.start_main_#t~post8#1| |ULTIMATE.start_main_~j~0#1|) 2147483645)} assume 1 + main_#t~post8#1 <= 2147483647; {5479#(<= (+ |ULTIMATE.start_main_#t~post8#1| |ULTIMATE.start_main_~j~0#1|) 2147483645)} is VALID [2022-02-21 03:11:42,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {5486#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483645)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {5479#(<= (+ |ULTIMATE.start_main_#t~post8#1| |ULTIMATE.start_main_~j~0#1|) 2147483645)} is VALID [2022-02-21 03:11:42,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {5486#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483645)} assume 1 + main_#t~post7#1 <= 2147483647; {5486#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483645)} is VALID [2022-02-21 03:11:42,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {5486#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483645)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {5486#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483645)} is VALID [2022-02-21 03:11:42,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {5496#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483644)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {5486#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483645)} is VALID [2022-02-21 03:11:42,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {5496#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483644)} assume 1 + main_~j~0#1 <= 2147483647; {5496#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483644)} is VALID [2022-02-21 03:11:42,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {5496#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483644)} assume 0 != main_~flag~0#1 % 256; {5496#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483644)} is VALID [2022-02-21 03:11:42,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {5506#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2147483644)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {5496#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483644)} is VALID [2022-02-21 03:11:42,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {5506#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2147483644)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {5506#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2147483644)} is VALID [2022-02-21 03:11:42,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {5506#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2147483644)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {5506#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2147483644)} is VALID [2022-02-21 03:11:42,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {5506#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2147483644)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {5506#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2147483644)} is VALID [2022-02-21 03:11:42,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {5519#(<= (+ |ULTIMATE.start_main_#t~post8#1| 1) (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) 2147483644) 2))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {5506#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 2147483644)} is VALID [2022-02-21 03:11:42,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {5519#(<= (+ |ULTIMATE.start_main_#t~post8#1| 1) (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) 2147483644) 2))} assume 1 + main_#t~post8#1 <= 2147483647; {5519#(<= (+ |ULTIMATE.start_main_#t~post8#1| 1) (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) 2147483644) 2))} is VALID [2022-02-21 03:11:42,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {5526#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) 2147483644) 2))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {5519#(<= (+ |ULTIMATE.start_main_#t~post8#1| 1) (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) 2147483644) 2))} is VALID [2022-02-21 03:11:42,430 INFO L290 TraceCheckUtils]: 4: Hoare triple {5526#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) 2147483644) 2))} assume 1 + main_#t~post7#1 <= 2147483647; {5526#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) 2147483644) 2))} is VALID [2022-02-21 03:11:42,431 INFO L290 TraceCheckUtils]: 3: Hoare triple {5526#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) 2147483644) 2))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {5526#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) 2147483644) 2))} is VALID [2022-02-21 03:11:42,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {5536#(<= |ULTIMATE.start_main_~y~0#1| 1073741821)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {5526#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) 2147483644) 2))} is VALID [2022-02-21 03:11:42,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {5362#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {5536#(<= |ULTIMATE.start_main_~y~0#1| 1073741821)} is VALID [2022-02-21 03:11:42,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {5362#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {5362#true} is VALID [2022-02-21 03:11:42,432 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:11:42,432 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286536055] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:11:42,432 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:11:42,432 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2022-02-21 03:11:42,432 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903422513] [2022-02-21 03:11:42,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:11:42,432 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.740740740740741) internal successors, (74), 28 states have internal predecessors, (74), 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 26 [2022-02-21 03:11:42,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:11:42,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 28 states, 27 states have (on average 2.740740740740741) internal successors, (74), 28 states have internal predecessors, (74), 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) [2022-02-21 03:11:42,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:11:42,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-21 03:11:42,479 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:11:42,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-21 03:11:42,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2022-02-21 03:11:42,480 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand has 28 states, 27 states have (on average 2.740740740740741) internal successors, (74), 28 states have internal predecessors, (74), 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) [2022-02-21 03:11:43,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:43,170 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2022-02-21 03:11:43,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-21 03:11:43,170 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.740740740740741) internal successors, (74), 28 states have internal predecessors, (74), 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 26 [2022-02-21 03:11:43,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:11:43,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.740740740740741) internal successors, (74), 28 states have internal predecessors, (74), 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) [2022-02-21 03:11:43,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 99 transitions. [2022-02-21 03:11:43,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.740740740740741) internal successors, (74), 28 states have internal predecessors, (74), 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) [2022-02-21 03:11:43,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 99 transitions. [2022-02-21 03:11:43,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 99 transitions. [2022-02-21 03:11:43,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:11:43,242 INFO L225 Difference]: With dead ends: 141 [2022-02-21 03:11:43,242 INFO L226 Difference]: Without dead ends: 139 [2022-02-21 03:11:43,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=1205, Unknown=0, NotChecked=0, Total=1640 [2022-02-21 03:11:43,243 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 229 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:11:43,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 161 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:11:43,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-02-21 03:11:43,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 106. [2022-02-21 03:11:43,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:11:43,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 106 states, 101 states have (on average 1.1287128712871286) internal successors, (114), 105 states have internal predecessors, (114), 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) [2022-02-21 03:11:43,292 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 106 states, 101 states have (on average 1.1287128712871286) internal successors, (114), 105 states have internal predecessors, (114), 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) [2022-02-21 03:11:43,292 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 106 states, 101 states have (on average 1.1287128712871286) internal successors, (114), 105 states have internal predecessors, (114), 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) [2022-02-21 03:11:43,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:43,293 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2022-02-21 03:11:43,294 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 147 transitions. [2022-02-21 03:11:43,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:43,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:11:43,294 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 101 states have (on average 1.1287128712871286) internal successors, (114), 105 states have internal predecessors, (114), 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 139 states. [2022-02-21 03:11:43,294 INFO L87 Difference]: Start difference. First operand has 106 states, 101 states have (on average 1.1287128712871286) internal successors, (114), 105 states have internal predecessors, (114), 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 139 states. [2022-02-21 03:11:43,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:43,296 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2022-02-21 03:11:43,296 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 147 transitions. [2022-02-21 03:11:43,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:43,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:11:43,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:11:43,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:11:43,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.1287128712871286) internal successors, (114), 105 states have internal predecessors, (114), 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) [2022-02-21 03:11:43,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2022-02-21 03:11:43,298 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 26 [2022-02-21 03:11:43,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:11:43,298 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2022-02-21 03:11:43,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.740740740740741) internal successors, (74), 28 states have internal predecessors, (74), 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) [2022-02-21 03:11:43,298 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2022-02-21 03:11:43,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-21 03:11:43,299 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:11:43,299 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2022-02-21 03:11:43,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:11:43,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-02-21 03:11:43,516 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:11:43,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:11:43,516 INFO L85 PathProgramCache]: Analyzing trace with hash 259934870, now seen corresponding path program 1 times [2022-02-21 03:11:43,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:11:43,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142568936] [2022-02-21 03:11:43,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:11:43,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:11:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:43,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {6116#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {6116#true} is VALID [2022-02-21 03:11:43,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {6116#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {6116#true} is VALID [2022-02-21 03:11:43,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {6116#true} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {6116#true} is VALID [2022-02-21 03:11:43,566 INFO L290 TraceCheckUtils]: 3: Hoare triple {6116#true} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {6116#true} is VALID [2022-02-21 03:11:43,566 INFO L290 TraceCheckUtils]: 4: Hoare triple {6116#true} assume 1 + main_#t~post7#1 <= 2147483647; {6116#true} is VALID [2022-02-21 03:11:43,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {6116#true} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {6116#true} is VALID [2022-02-21 03:11:43,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {6116#true} assume 1 + main_#t~post8#1 <= 2147483647; {6116#true} is VALID [2022-02-21 03:11:43,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {6116#true} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {6116#true} is VALID [2022-02-21 03:11:43,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {6116#true} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {6116#true} is VALID [2022-02-21 03:11:43,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {6116#true} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {6116#true} is VALID [2022-02-21 03:11:43,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {6116#true} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {6116#true} is VALID [2022-02-21 03:11:43,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {6116#true} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {6116#true} is VALID [2022-02-21 03:11:43,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {6116#true} assume 0 != main_~flag~0#1 % 256; {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} is VALID [2022-02-21 03:11:43,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} assume 1 + main_~j~0#1 <= 2147483647; {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} is VALID [2022-02-21 03:11:43,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} is VALID [2022-02-21 03:11:43,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} is VALID [2022-02-21 03:11:43,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} assume 1 + main_#t~post7#1 <= 2147483647; {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} is VALID [2022-02-21 03:11:43,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} is VALID [2022-02-21 03:11:43,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} assume 1 + main_#t~post8#1 <= 2147483647; {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} is VALID [2022-02-21 03:11:43,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} is VALID [2022-02-21 03:11:43,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} is VALID [2022-02-21 03:11:43,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} is VALID [2022-02-21 03:11:43,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} is VALID [2022-02-21 03:11:43,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} is VALID [2022-02-21 03:11:43,572 INFO L290 TraceCheckUtils]: 24: Hoare triple {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} assume 0 != main_~flag~0#1 % 256; {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} is VALID [2022-02-21 03:11:43,572 INFO L290 TraceCheckUtils]: 25: Hoare triple {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} assume 1 + main_~j~0#1 <= 2147483647; {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} is VALID [2022-02-21 03:11:43,573 INFO L290 TraceCheckUtils]: 26: Hoare triple {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} is VALID [2022-02-21 03:11:43,573 INFO L290 TraceCheckUtils]: 27: Hoare triple {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} is VALID [2022-02-21 03:11:43,573 INFO L290 TraceCheckUtils]: 28: Hoare triple {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} assume 1 + main_#t~post7#1 <= 2147483647; {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} is VALID [2022-02-21 03:11:43,574 INFO L290 TraceCheckUtils]: 29: Hoare triple {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} is VALID [2022-02-21 03:11:43,574 INFO L290 TraceCheckUtils]: 30: Hoare triple {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} assume 1 + main_#t~post8#1 <= 2147483647; {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} is VALID [2022-02-21 03:11:43,574 INFO L290 TraceCheckUtils]: 31: Hoare triple {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} is VALID [2022-02-21 03:11:43,575 INFO L290 TraceCheckUtils]: 32: Hoare triple {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} is VALID [2022-02-21 03:11:43,575 INFO L290 TraceCheckUtils]: 33: Hoare triple {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} is VALID [2022-02-21 03:11:43,575 INFO L290 TraceCheckUtils]: 34: Hoare triple {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} is VALID [2022-02-21 03:11:43,576 INFO L290 TraceCheckUtils]: 35: Hoare triple {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} is VALID [2022-02-21 03:11:43,576 INFO L290 TraceCheckUtils]: 36: Hoare triple {6118#(not (= (+ (* (- 256) (div |ULTIMATE.start_main_~flag~0#1| 256)) |ULTIMATE.start_main_~flag~0#1|) 0))} assume !(0 != main_~flag~0#1 % 256); {6117#false} is VALID [2022-02-21 03:11:43,576 INFO L290 TraceCheckUtils]: 37: Hoare triple {6117#false} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {6117#false} is VALID [2022-02-21 03:11:43,577 INFO L290 TraceCheckUtils]: 38: Hoare triple {6117#false} assume 1 + main_#t~post7#1 <= 2147483647; {6117#false} is VALID [2022-02-21 03:11:43,577 INFO L290 TraceCheckUtils]: 39: Hoare triple {6117#false} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {6117#false} is VALID [2022-02-21 03:11:43,577 INFO L290 TraceCheckUtils]: 40: Hoare triple {6117#false} assume 1 + main_#t~post8#1 <= 2147483647; {6117#false} is VALID [2022-02-21 03:11:43,577 INFO L290 TraceCheckUtils]: 41: Hoare triple {6117#false} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {6117#false} is VALID [2022-02-21 03:11:43,577 INFO L290 TraceCheckUtils]: 42: Hoare triple {6117#false} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {6117#false} is VALID [2022-02-21 03:11:43,577 INFO L290 TraceCheckUtils]: 43: Hoare triple {6117#false} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {6117#false} is VALID [2022-02-21 03:11:43,577 INFO L290 TraceCheckUtils]: 44: Hoare triple {6117#false} assume !(main_~j~0#1 + main_~y~0#1 <= 2147483647); {6117#false} is VALID [2022-02-21 03:11:43,578 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-21 03:11:43,578 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:11:43,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142568936] [2022-02-21 03:11:43,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142568936] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:11:43,578 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:11:43,578 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:11:43,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230075299] [2022-02-21 03:11:43,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:11:43,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 45 [2022-02-21 03:11:43,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:11:43,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2022-02-21 03:11:43,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:11:43,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:11:43,601 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:11:43,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:11:43,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:11:43,602 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2022-02-21 03:11:43,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:43,681 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2022-02-21 03:11:43,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:11:43,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 45 [2022-02-21 03:11:43,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:11:43,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2022-02-21 03:11:43,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-02-21 03:11:43,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2022-02-21 03:11:43,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-02-21 03:11:43,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-02-21 03:11:43,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:11:43,728 INFO L225 Difference]: With dead ends: 142 [2022-02-21 03:11:43,728 INFO L226 Difference]: Without dead ends: 104 [2022-02-21 03:11:43,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:11:43,729 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:11:43,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 48 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:11:43,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-02-21 03:11:43,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-02-21 03:11:43,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:11:43,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 100 states, 95 states have (on average 1.105263157894737) internal successors, (105), 99 states have internal predecessors, (105), 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) [2022-02-21 03:11:43,776 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 100 states, 95 states have (on average 1.105263157894737) internal successors, (105), 99 states have internal predecessors, (105), 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) [2022-02-21 03:11:43,776 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 100 states, 95 states have (on average 1.105263157894737) internal successors, (105), 99 states have internal predecessors, (105), 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) [2022-02-21 03:11:43,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:43,777 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2022-02-21 03:11:43,777 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2022-02-21 03:11:43,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:43,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:11:43,778 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 95 states have (on average 1.105263157894737) internal successors, (105), 99 states have internal predecessors, (105), 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 104 states. [2022-02-21 03:11:43,778 INFO L87 Difference]: Start difference. First operand has 100 states, 95 states have (on average 1.105263157894737) internal successors, (105), 99 states have internal predecessors, (105), 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 104 states. [2022-02-21 03:11:43,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:43,779 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2022-02-21 03:11:43,780 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2022-02-21 03:11:43,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:43,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:11:43,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:11:43,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:11:43,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 95 states have (on average 1.105263157894737) internal successors, (105), 99 states have internal predecessors, (105), 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) [2022-02-21 03:11:43,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2022-02-21 03:11:43,781 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 45 [2022-02-21 03:11:43,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:11:43,782 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2022-02-21 03:11:43,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2022-02-21 03:11:43,782 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2022-02-21 03:11:43,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-21 03:11:43,782 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:11:43,782 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2022-02-21 03:11:43,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-21 03:11:43,783 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:11:43,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:11:43,783 INFO L85 PathProgramCache]: Analyzing trace with hash 375204201, now seen corresponding path program 2 times [2022-02-21 03:11:43,783 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:11:43,784 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466514295] [2022-02-21 03:11:43,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:11:43,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:11:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:43,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {6593#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {6593#true} is VALID [2022-02-21 03:11:43,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {6593#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {6595#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:11:43,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {6595#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {6595#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:11:43,893 INFO L290 TraceCheckUtils]: 3: Hoare triple {6595#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {6596#(= |ULTIMATE.start_main_#t~post7#1| 0)} is VALID [2022-02-21 03:11:43,894 INFO L290 TraceCheckUtils]: 4: Hoare triple {6596#(= |ULTIMATE.start_main_#t~post7#1| 0)} assume 1 + main_#t~post7#1 <= 2147483647; {6596#(= |ULTIMATE.start_main_#t~post7#1| 0)} is VALID [2022-02-21 03:11:43,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {6596#(= |ULTIMATE.start_main_#t~post7#1| 0)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:11:43,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_#t~post8#1 <= 2147483647; {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:11:43,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:11:43,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:11:43,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:11:43,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:11:43,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:11:43,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !(0 != main_~flag~0#1 % 256); {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:11:43,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {6598#(<= |ULTIMATE.start_main_#t~post7#1| 1)} is VALID [2022-02-21 03:11:43,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {6598#(<= |ULTIMATE.start_main_#t~post7#1| 1)} assume 1 + main_#t~post7#1 <= 2147483647; {6598#(<= |ULTIMATE.start_main_#t~post7#1| 1)} is VALID [2022-02-21 03:11:43,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {6598#(<= |ULTIMATE.start_main_#t~post7#1| 1)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:11:43,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_#t~post8#1 <= 2147483647; {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:11:43,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:11:43,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:11:43,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:11:43,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:11:43,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:11:43,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !(0 != main_~flag~0#1 % 256); {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:11:43,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {6600#(<= |ULTIMATE.start_main_#t~post7#1| 2)} is VALID [2022-02-21 03:11:43,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {6600#(<= |ULTIMATE.start_main_#t~post7#1| 2)} assume 1 + main_#t~post7#1 <= 2147483647; {6600#(<= |ULTIMATE.start_main_#t~post7#1| 2)} is VALID [2022-02-21 03:11:43,920 INFO L290 TraceCheckUtils]: 25: Hoare triple {6600#(<= |ULTIMATE.start_main_#t~post7#1| 2)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:11:43,920 INFO L290 TraceCheckUtils]: 26: Hoare triple {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 1 + main_#t~post8#1 <= 2147483647; {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:11:43,921 INFO L290 TraceCheckUtils]: 27: Hoare triple {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:11:43,921 INFO L290 TraceCheckUtils]: 28: Hoare triple {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:11:43,921 INFO L290 TraceCheckUtils]: 29: Hoare triple {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:11:43,921 INFO L290 TraceCheckUtils]: 30: Hoare triple {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:11:43,922 INFO L290 TraceCheckUtils]: 31: Hoare triple {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:11:43,922 INFO L290 TraceCheckUtils]: 32: Hoare triple {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume !(0 != main_~flag~0#1 % 256); {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:11:43,922 INFO L290 TraceCheckUtils]: 33: Hoare triple {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {6602#(<= |ULTIMATE.start_main_#t~post7#1| 3)} is VALID [2022-02-21 03:11:43,923 INFO L290 TraceCheckUtils]: 34: Hoare triple {6602#(<= |ULTIMATE.start_main_#t~post7#1| 3)} assume 1 + main_#t~post7#1 <= 2147483647; {6602#(<= |ULTIMATE.start_main_#t~post7#1| 3)} is VALID [2022-02-21 03:11:43,923 INFO L290 TraceCheckUtils]: 35: Hoare triple {6602#(<= |ULTIMATE.start_main_#t~post7#1| 3)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:11:43,923 INFO L290 TraceCheckUtils]: 36: Hoare triple {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 1 + main_#t~post8#1 <= 2147483647; {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:11:43,924 INFO L290 TraceCheckUtils]: 37: Hoare triple {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:11:43,924 INFO L290 TraceCheckUtils]: 38: Hoare triple {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:11:43,924 INFO L290 TraceCheckUtils]: 39: Hoare triple {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:11:43,924 INFO L290 TraceCheckUtils]: 40: Hoare triple {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:11:43,925 INFO L290 TraceCheckUtils]: 41: Hoare triple {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:11:43,925 INFO L290 TraceCheckUtils]: 42: Hoare triple {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !(0 != main_~flag~0#1 % 256); {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:11:43,925 INFO L290 TraceCheckUtils]: 43: Hoare triple {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {6604#(<= |ULTIMATE.start_main_#t~post7#1| 4)} is VALID [2022-02-21 03:11:43,926 INFO L290 TraceCheckUtils]: 44: Hoare triple {6604#(<= |ULTIMATE.start_main_#t~post7#1| 4)} assume !(1 + main_#t~post7#1 <= 2147483647); {6594#false} is VALID [2022-02-21 03:11:43,926 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:11:43,926 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:11:43,926 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466514295] [2022-02-21 03:11:43,926 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466514295] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:11:43,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653908836] [2022-02-21 03:11:43,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:11:43,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:11:43,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:11:43,928 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:11:43,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-21 03:11:43,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:11:43,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:11:43,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:11:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:43,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:11:44,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {6593#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {6593#true} is VALID [2022-02-21 03:11:44,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {6593#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {6611#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:11:44,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {6611#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {6611#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:11:44,190 INFO L290 TraceCheckUtils]: 3: Hoare triple {6611#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {6618#(<= |ULTIMATE.start_main_#t~post7#1| 0)} is VALID [2022-02-21 03:11:44,191 INFO L290 TraceCheckUtils]: 4: Hoare triple {6618#(<= |ULTIMATE.start_main_#t~post7#1| 0)} assume 1 + main_#t~post7#1 <= 2147483647; {6618#(<= |ULTIMATE.start_main_#t~post7#1| 0)} is VALID [2022-02-21 03:11:44,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {6618#(<= |ULTIMATE.start_main_#t~post7#1| 0)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:11:44,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_#t~post8#1 <= 2147483647; {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:11:44,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:11:44,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:11:44,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:11:44,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:11:44,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:11:44,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !(0 != main_~flag~0#1 % 256); {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:11:44,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {6597#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {6598#(<= |ULTIMATE.start_main_#t~post7#1| 1)} is VALID [2022-02-21 03:11:44,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {6598#(<= |ULTIMATE.start_main_#t~post7#1| 1)} assume 1 + main_#t~post7#1 <= 2147483647; {6598#(<= |ULTIMATE.start_main_#t~post7#1| 1)} is VALID [2022-02-21 03:11:44,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {6598#(<= |ULTIMATE.start_main_#t~post7#1| 1)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:11:44,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_#t~post8#1 <= 2147483647; {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:11:44,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:11:44,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:11:44,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:11:44,195 INFO L290 TraceCheckUtils]: 20: Hoare triple {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:11:44,196 INFO L290 TraceCheckUtils]: 21: Hoare triple {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:11:44,196 INFO L290 TraceCheckUtils]: 22: Hoare triple {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !(0 != main_~flag~0#1 % 256); {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:11:44,196 INFO L290 TraceCheckUtils]: 23: Hoare triple {6599#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {6600#(<= |ULTIMATE.start_main_#t~post7#1| 2)} is VALID [2022-02-21 03:11:44,196 INFO L290 TraceCheckUtils]: 24: Hoare triple {6600#(<= |ULTIMATE.start_main_#t~post7#1| 2)} assume 1 + main_#t~post7#1 <= 2147483647; {6600#(<= |ULTIMATE.start_main_#t~post7#1| 2)} is VALID [2022-02-21 03:11:44,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {6600#(<= |ULTIMATE.start_main_#t~post7#1| 2)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:11:44,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 1 + main_#t~post8#1 <= 2147483647; {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:11:44,197 INFO L290 TraceCheckUtils]: 27: Hoare triple {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:11:44,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:11:44,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:11:44,198 INFO L290 TraceCheckUtils]: 30: Hoare triple {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:11:44,198 INFO L290 TraceCheckUtils]: 31: Hoare triple {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:11:44,199 INFO L290 TraceCheckUtils]: 32: Hoare triple {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume !(0 != main_~flag~0#1 % 256); {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:11:44,199 INFO L290 TraceCheckUtils]: 33: Hoare triple {6601#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {6602#(<= |ULTIMATE.start_main_#t~post7#1| 3)} is VALID [2022-02-21 03:11:44,199 INFO L290 TraceCheckUtils]: 34: Hoare triple {6602#(<= |ULTIMATE.start_main_#t~post7#1| 3)} assume 1 + main_#t~post7#1 <= 2147483647; {6602#(<= |ULTIMATE.start_main_#t~post7#1| 3)} is VALID [2022-02-21 03:11:44,200 INFO L290 TraceCheckUtils]: 35: Hoare triple {6602#(<= |ULTIMATE.start_main_#t~post7#1| 3)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:11:44,200 INFO L290 TraceCheckUtils]: 36: Hoare triple {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 1 + main_#t~post8#1 <= 2147483647; {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:11:44,200 INFO L290 TraceCheckUtils]: 37: Hoare triple {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:11:44,201 INFO L290 TraceCheckUtils]: 38: Hoare triple {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:11:44,201 INFO L290 TraceCheckUtils]: 39: Hoare triple {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:11:44,201 INFO L290 TraceCheckUtils]: 40: Hoare triple {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:11:44,201 INFO L290 TraceCheckUtils]: 41: Hoare triple {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:11:44,202 INFO L290 TraceCheckUtils]: 42: Hoare triple {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !(0 != main_~flag~0#1 % 256); {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:11:44,202 INFO L290 TraceCheckUtils]: 43: Hoare triple {6603#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {6604#(<= |ULTIMATE.start_main_#t~post7#1| 4)} is VALID [2022-02-21 03:11:44,202 INFO L290 TraceCheckUtils]: 44: Hoare triple {6604#(<= |ULTIMATE.start_main_#t~post7#1| 4)} assume !(1 + main_#t~post7#1 <= 2147483647); {6594#false} is VALID [2022-02-21 03:11:44,202 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:11:44,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:11:44,503 INFO L290 TraceCheckUtils]: 44: Hoare triple {6742#(<= |ULTIMATE.start_main_#t~post7#1| 2147483646)} assume !(1 + main_#t~post7#1 <= 2147483647); {6594#false} is VALID [2022-02-21 03:11:44,504 INFO L290 TraceCheckUtils]: 43: Hoare triple {6746#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {6742#(<= |ULTIMATE.start_main_#t~post7#1| 2147483646)} is VALID [2022-02-21 03:11:44,504 INFO L290 TraceCheckUtils]: 42: Hoare triple {6746#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume !(0 != main_~flag~0#1 % 256); {6746#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:11:44,504 INFO L290 TraceCheckUtils]: 41: Hoare triple {6746#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {6746#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:11:44,504 INFO L290 TraceCheckUtils]: 40: Hoare triple {6746#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {6746#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:11:44,505 INFO L290 TraceCheckUtils]: 39: Hoare triple {6746#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {6746#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:11:44,505 INFO L290 TraceCheckUtils]: 38: Hoare triple {6746#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {6746#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:11:44,505 INFO L290 TraceCheckUtils]: 37: Hoare triple {6746#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {6746#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:11:44,506 INFO L290 TraceCheckUtils]: 36: Hoare triple {6746#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume 1 + main_#t~post8#1 <= 2147483647; {6746#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:11:44,506 INFO L290 TraceCheckUtils]: 35: Hoare triple {6771#(<= |ULTIMATE.start_main_#t~post7#1| 2147483645)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {6746#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:11:44,506 INFO L290 TraceCheckUtils]: 34: Hoare triple {6771#(<= |ULTIMATE.start_main_#t~post7#1| 2147483645)} assume 1 + main_#t~post7#1 <= 2147483647; {6771#(<= |ULTIMATE.start_main_#t~post7#1| 2147483645)} is VALID [2022-02-21 03:11:44,507 INFO L290 TraceCheckUtils]: 33: Hoare triple {6778#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {6771#(<= |ULTIMATE.start_main_#t~post7#1| 2147483645)} is VALID [2022-02-21 03:11:44,507 INFO L290 TraceCheckUtils]: 32: Hoare triple {6778#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume !(0 != main_~flag~0#1 % 256); {6778#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:11:44,507 INFO L290 TraceCheckUtils]: 31: Hoare triple {6778#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {6778#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:11:44,507 INFO L290 TraceCheckUtils]: 30: Hoare triple {6778#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {6778#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:11:44,508 INFO L290 TraceCheckUtils]: 29: Hoare triple {6778#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {6778#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:11:44,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {6778#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {6778#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:11:44,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {6778#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {6778#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:11:44,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {6778#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 1 + main_#t~post8#1 <= 2147483647; {6778#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:11:44,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {6803#(<= |ULTIMATE.start_main_#t~post7#1| 2147483644)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {6778#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:11:44,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {6803#(<= |ULTIMATE.start_main_#t~post7#1| 2147483644)} assume 1 + main_#t~post7#1 <= 2147483647; {6803#(<= |ULTIMATE.start_main_#t~post7#1| 2147483644)} is VALID [2022-02-21 03:11:44,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {6810#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {6803#(<= |ULTIMATE.start_main_#t~post7#1| 2147483644)} is VALID [2022-02-21 03:11:44,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {6810#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume !(0 != main_~flag~0#1 % 256); {6810#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:11:44,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {6810#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {6810#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:11:44,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {6810#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {6810#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:11:44,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {6810#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {6810#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:11:44,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {6810#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {6810#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:11:44,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {6810#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {6810#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:11:44,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {6810#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume 1 + main_#t~post8#1 <= 2147483647; {6810#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:11:44,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {6835#(<= |ULTIMATE.start_main_#t~post7#1| 2147483643)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {6810#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:11:44,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {6835#(<= |ULTIMATE.start_main_#t~post7#1| 2147483643)} assume 1 + main_#t~post7#1 <= 2147483647; {6835#(<= |ULTIMATE.start_main_#t~post7#1| 2147483643)} is VALID [2022-02-21 03:11:44,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {6842#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {6835#(<= |ULTIMATE.start_main_#t~post7#1| 2147483643)} is VALID [2022-02-21 03:11:44,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {6842#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume !(0 != main_~flag~0#1 % 256); {6842#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:11:44,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {6842#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {6842#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:11:44,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {6842#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {6842#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:11:44,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {6842#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {6842#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:11:44,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {6842#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {6842#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:11:44,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {6842#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {6842#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:11:44,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {6842#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume 1 + main_#t~post8#1 <= 2147483647; {6842#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:11:44,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {6867#(<= |ULTIMATE.start_main_#t~post7#1| 2147483642)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {6842#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:11:44,520 INFO L290 TraceCheckUtils]: 4: Hoare triple {6867#(<= |ULTIMATE.start_main_#t~post7#1| 2147483642)} assume 1 + main_#t~post7#1 <= 2147483647; {6867#(<= |ULTIMATE.start_main_#t~post7#1| 2147483642)} is VALID [2022-02-21 03:11:44,521 INFO L290 TraceCheckUtils]: 3: Hoare triple {6874#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {6867#(<= |ULTIMATE.start_main_#t~post7#1| 2147483642)} is VALID [2022-02-21 03:11:44,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {6874#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {6874#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} is VALID [2022-02-21 03:11:44,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {6593#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {6874#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} is VALID [2022-02-21 03:11:44,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {6593#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {6593#true} is VALID [2022-02-21 03:11:44,522 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:11:44,522 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653908836] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:11:44,522 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:11:44,522 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2022-02-21 03:11:44,522 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646765343] [2022-02-21 03:11:44,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:11:44,523 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.086956521739131) internal successors, (94), 24 states have internal predecessors, (94), 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 45 [2022-02-21 03:11:44,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:11:44,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 23 states have (on average 4.086956521739131) internal successors, (94), 24 states have internal predecessors, (94), 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) [2022-02-21 03:11:44,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:11:44,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-21 03:11:44,578 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:11:44,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-21 03:11:44,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2022-02-21 03:11:44,579 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 24 states, 23 states have (on average 4.086956521739131) internal successors, (94), 24 states have internal predecessors, (94), 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) [2022-02-21 03:11:44,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:44,973 INFO L93 Difference]: Finished difference Result 247 states and 278 transitions. [2022-02-21 03:11:44,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-21 03:11:44,974 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.086956521739131) internal successors, (94), 24 states have internal predecessors, (94), 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 45 [2022-02-21 03:11:44,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:11:44,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 4.086956521739131) internal successors, (94), 24 states have internal predecessors, (94), 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) [2022-02-21 03:11:44,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 169 transitions. [2022-02-21 03:11:44,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 4.086956521739131) internal successors, (94), 24 states have internal predecessors, (94), 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) [2022-02-21 03:11:44,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 169 transitions. [2022-02-21 03:11:44,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 169 transitions. [2022-02-21 03:11:45,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:11:45,095 INFO L225 Difference]: With dead ends: 247 [2022-02-21 03:11:45,096 INFO L226 Difference]: Without dead ends: 246 [2022-02-21 03:11:45,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=332, Invalid=790, Unknown=0, NotChecked=0, Total=1122 [2022-02-21 03:11:45,096 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 177 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:11:45,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 152 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:11:45,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-02-21 03:11:45,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 222. [2022-02-21 03:11:45,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:11:45,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 246 states. Second operand has 222 states, 217 states have (on average 1.2165898617511521) internal successors, (264), 221 states have internal predecessors, (264), 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) [2022-02-21 03:11:45,186 INFO L74 IsIncluded]: Start isIncluded. First operand 246 states. Second operand has 222 states, 217 states have (on average 1.2165898617511521) internal successors, (264), 221 states have internal predecessors, (264), 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) [2022-02-21 03:11:45,187 INFO L87 Difference]: Start difference. First operand 246 states. Second operand has 222 states, 217 states have (on average 1.2165898617511521) internal successors, (264), 221 states have internal predecessors, (264), 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) [2022-02-21 03:11:45,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:45,190 INFO L93 Difference]: Finished difference Result 246 states and 266 transitions. [2022-02-21 03:11:45,190 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 266 transitions. [2022-02-21 03:11:45,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:45,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:11:45,190 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 217 states have (on average 1.2165898617511521) internal successors, (264), 221 states have internal predecessors, (264), 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 246 states. [2022-02-21 03:11:45,191 INFO L87 Difference]: Start difference. First operand has 222 states, 217 states have (on average 1.2165898617511521) internal successors, (264), 221 states have internal predecessors, (264), 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 246 states. [2022-02-21 03:11:45,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:11:45,194 INFO L93 Difference]: Finished difference Result 246 states and 266 transitions. [2022-02-21 03:11:45,194 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 266 transitions. [2022-02-21 03:11:45,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:11:45,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:11:45,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:11:45,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:11:45,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 217 states have (on average 1.2165898617511521) internal successors, (264), 221 states have internal predecessors, (264), 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) [2022-02-21 03:11:45,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 264 transitions. [2022-02-21 03:11:45,199 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 264 transitions. Word has length 45 [2022-02-21 03:11:45,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:11:45,199 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 264 transitions. [2022-02-21 03:11:45,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.086956521739131) internal successors, (94), 24 states have internal predecessors, (94), 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) [2022-02-21 03:11:45,199 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 264 transitions. [2022-02-21 03:11:45,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-21 03:11:45,200 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:11:45,200 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2022-02-21 03:11:45,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:11:45,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:11:45,414 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:11:45,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:11:45,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1697772786, now seen corresponding path program 1 times [2022-02-21 03:11:45,414 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:11:45,414 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311011823] [2022-02-21 03:11:45,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:11:45,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:11:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:45,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {7906#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {7906#true} is VALID [2022-02-21 03:11:45,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {7906#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {7908#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:11:45,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {7908#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {7909#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:45,597 INFO L290 TraceCheckUtils]: 3: Hoare triple {7909#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {7909#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:45,597 INFO L290 TraceCheckUtils]: 4: Hoare triple {7909#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post7#1 <= 2147483647; {7909#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:45,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {7909#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {7910#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:45,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {7910#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post8#1 <= 2147483647; {7910#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:45,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {7910#(and (= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {7911#(<= (+ (* |ULTIMATE.start_main_~y~0#1| 4) |ULTIMATE.start_main_~j~0#1|) 4)} is VALID [2022-02-21 03:11:45,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {7911#(<= (+ (* |ULTIMATE.start_main_~y~0#1| 4) |ULTIMATE.start_main_~j~0#1|) 4)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {7911#(<= (+ (* |ULTIMATE.start_main_~y~0#1| 4) |ULTIMATE.start_main_~j~0#1|) 4)} is VALID [2022-02-21 03:11:45,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {7911#(<= (+ (* |ULTIMATE.start_main_~y~0#1| 4) |ULTIMATE.start_main_~j~0#1|) 4)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {7911#(<= (+ (* |ULTIMATE.start_main_~y~0#1| 4) |ULTIMATE.start_main_~j~0#1|) 4)} is VALID [2022-02-21 03:11:45,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {7911#(<= (+ (* |ULTIMATE.start_main_~y~0#1| 4) |ULTIMATE.start_main_~j~0#1|) 4)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {7911#(<= (+ (* |ULTIMATE.start_main_~y~0#1| 4) |ULTIMATE.start_main_~j~0#1|) 4)} is VALID [2022-02-21 03:11:45,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {7911#(<= (+ (* |ULTIMATE.start_main_~y~0#1| 4) |ULTIMATE.start_main_~j~0#1|) 4)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {7912#(<= (+ |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~y~0#1|)) 4)} is VALID [2022-02-21 03:11:45,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {7912#(<= (+ |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~y~0#1|)) 4)} assume 0 != main_~flag~0#1 % 256; {7912#(<= (+ |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~y~0#1|)) 4)} is VALID [2022-02-21 03:11:45,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {7912#(<= (+ |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~y~0#1|)) 4)} assume 1 + main_~j~0#1 <= 2147483647; {7912#(<= (+ |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~y~0#1|)) 4)} is VALID [2022-02-21 03:11:45,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {7912#(<= (+ |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~y~0#1|)) 4)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {7913#(<= (+ |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~y~0#1|)) 5)} is VALID [2022-02-21 03:11:45,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {7913#(<= (+ |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~y~0#1|)) 5)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {7913#(<= (+ |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~y~0#1|)) 5)} is VALID [2022-02-21 03:11:45,601 INFO L290 TraceCheckUtils]: 16: Hoare triple {7913#(<= (+ |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~y~0#1|)) 5)} assume 1 + main_#t~post7#1 <= 2147483647; {7913#(<= (+ |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~y~0#1|)) 5)} is VALID [2022-02-21 03:11:45,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {7913#(<= (+ |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~y~0#1|)) 5)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {7914#(<= (+ |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_#t~post8#1|)) 5)} is VALID [2022-02-21 03:11:45,602 INFO L290 TraceCheckUtils]: 18: Hoare triple {7914#(<= (+ |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_#t~post8#1|)) 5)} assume 1 + main_#t~post8#1 <= 2147483647; {7914#(<= (+ |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_#t~post8#1|)) 5)} is VALID [2022-02-21 03:11:45,603 INFO L290 TraceCheckUtils]: 19: Hoare triple {7914#(<= (+ |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_#t~post8#1|)) 5)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {7915#(<= (+ |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~y~0#1|)) 8)} is VALID [2022-02-21 03:11:45,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {7915#(<= (+ |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~y~0#1|)) 8)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {7915#(<= (+ |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~y~0#1|)) 8)} is VALID [2022-02-21 03:11:45,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {7915#(<= (+ |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~y~0#1|)) 8)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {7915#(<= (+ |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~y~0#1|)) 8)} is VALID [2022-02-21 03:11:45,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {7915#(<= (+ |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~y~0#1|)) 8)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {7915#(<= (+ |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~y~0#1|)) 8)} is VALID [2022-02-21 03:11:45,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {7915#(<= (+ |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~y~0#1|)) 8)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {7916#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 8)} is VALID [2022-02-21 03:11:45,604 INFO L290 TraceCheckUtils]: 24: Hoare triple {7916#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 8)} assume 0 != main_~flag~0#1 % 256; {7916#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 8)} is VALID [2022-02-21 03:11:45,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {7916#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 8)} assume 1 + main_~j~0#1 <= 2147483647; {7916#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 8)} is VALID [2022-02-21 03:11:45,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {7916#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 8)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {7917#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 9)} is VALID [2022-02-21 03:11:45,606 INFO L290 TraceCheckUtils]: 27: Hoare triple {7917#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 9)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {7917#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 9)} is VALID [2022-02-21 03:11:45,609 INFO L290 TraceCheckUtils]: 28: Hoare triple {7917#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 9)} assume 1 + main_#t~post7#1 <= 2147483647; {7917#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 9)} is VALID [2022-02-21 03:11:45,609 INFO L290 TraceCheckUtils]: 29: Hoare triple {7917#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 9)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {7918#(<= (+ (* 2 |ULTIMATE.start_main_#t~post8#1|) |ULTIMATE.start_main_~j~0#1|) 9)} is VALID [2022-02-21 03:11:45,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {7918#(<= (+ (* 2 |ULTIMATE.start_main_#t~post8#1|) |ULTIMATE.start_main_~j~0#1|) 9)} assume 1 + main_#t~post8#1 <= 2147483647; {7918#(<= (+ (* 2 |ULTIMATE.start_main_#t~post8#1|) |ULTIMATE.start_main_~j~0#1|) 9)} is VALID [2022-02-21 03:11:45,610 INFO L290 TraceCheckUtils]: 31: Hoare triple {7918#(<= (+ (* 2 |ULTIMATE.start_main_#t~post8#1|) |ULTIMATE.start_main_~j~0#1|) 9)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {7919#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 11)} is VALID [2022-02-21 03:11:45,611 INFO L290 TraceCheckUtils]: 32: Hoare triple {7919#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 11)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {7919#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 11)} is VALID [2022-02-21 03:11:45,611 INFO L290 TraceCheckUtils]: 33: Hoare triple {7919#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 11)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {7919#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 11)} is VALID [2022-02-21 03:11:45,612 INFO L290 TraceCheckUtils]: 34: Hoare triple {7919#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 11)} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {7919#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 11)} is VALID [2022-02-21 03:11:45,612 INFO L290 TraceCheckUtils]: 35: Hoare triple {7919#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) 11)} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {7920#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 11)} is VALID [2022-02-21 03:11:45,612 INFO L290 TraceCheckUtils]: 36: Hoare triple {7920#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 11)} assume 0 != main_~flag~0#1 % 256; {7920#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 11)} is VALID [2022-02-21 03:11:45,613 INFO L290 TraceCheckUtils]: 37: Hoare triple {7920#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 11)} assume 1 + main_~j~0#1 <= 2147483647; {7920#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 11)} is VALID [2022-02-21 03:11:45,613 INFO L290 TraceCheckUtils]: 38: Hoare triple {7920#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 11)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {7921#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 12)} is VALID [2022-02-21 03:11:45,614 INFO L290 TraceCheckUtils]: 39: Hoare triple {7921#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 12)} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {7921#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 12)} is VALID [2022-02-21 03:11:45,614 INFO L290 TraceCheckUtils]: 40: Hoare triple {7921#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 12)} assume 1 + main_#t~post7#1 <= 2147483647; {7921#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 12)} is VALID [2022-02-21 03:11:45,614 INFO L290 TraceCheckUtils]: 41: Hoare triple {7921#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 12)} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {7922#(<= (+ |ULTIMATE.start_main_#t~post8#1| |ULTIMATE.start_main_~j~0#1|) 12)} is VALID [2022-02-21 03:11:45,615 INFO L290 TraceCheckUtils]: 42: Hoare triple {7922#(<= (+ |ULTIMATE.start_main_#t~post8#1| |ULTIMATE.start_main_~j~0#1|) 12)} assume 1 + main_#t~post8#1 <= 2147483647; {7922#(<= (+ |ULTIMATE.start_main_#t~post8#1| |ULTIMATE.start_main_~j~0#1|) 12)} is VALID [2022-02-21 03:11:45,615 INFO L290 TraceCheckUtils]: 43: Hoare triple {7922#(<= (+ |ULTIMATE.start_main_#t~post8#1| |ULTIMATE.start_main_~j~0#1|) 12)} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {7923#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 13)} is VALID [2022-02-21 03:11:45,615 INFO L290 TraceCheckUtils]: 44: Hoare triple {7923#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 13)} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {7923#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 13)} is VALID [2022-02-21 03:11:45,616 INFO L290 TraceCheckUtils]: 45: Hoare triple {7923#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 13)} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {7923#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 13)} is VALID [2022-02-21 03:11:45,616 INFO L290 TraceCheckUtils]: 46: Hoare triple {7923#(<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) 13)} assume !(main_~j~0#1 + main_~y~0#1 <= 2147483647); {7907#false} is VALID [2022-02-21 03:11:45,616 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:11:45,616 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:11:45,616 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311011823] [2022-02-21 03:11:45,617 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311011823] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:11:45,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225069246] [2022-02-21 03:11:45,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:11:45,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:11:45,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:11:45,618 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:11:45,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-21 03:11:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:45,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-21 03:11:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:11:45,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:11:46,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {7906#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {7906#true} is VALID [2022-02-21 03:11:46,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {7906#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet6#1, main_~x~0#1, main_~y~0#1, main_~i~0#1, main_~j~0#1, main_~flag~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~i~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~flag~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 0;main_~y~0#1 := 0; {7930#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:11:46,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {7930#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(0 == main_~i~0#1 && 0 == main_~j~0#1); {7934#(and (<= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:46,304 INFO L290 TraceCheckUtils]: 3: Hoare triple {7934#(and (<= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {7934#(and (<= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:46,305 INFO L290 TraceCheckUtils]: 4: Hoare triple {7934#(and (<= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post7#1 <= 2147483647; {7934#(and (<= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:46,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {7934#(and (<= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {7944#(and (<= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:46,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {7944#(and (<= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post8#1 <= 2147483647; {7944#(and (<= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:46,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {7944#(and (<= |ULTIMATE.start_main_#t~post8#1| 0) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {7951#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:46,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {7951#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {7951#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:46,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {7951#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {7951#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:46,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {7951#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {7951#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:11:46,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {7951#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {7964#(and (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:11:46,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {7964#(and (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 1))} assume 0 != main_~flag~0#1 % 256; {7964#(and (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:11:46,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {7964#(and (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 1))} assume 1 + main_~j~0#1 <= 2147483647; {7964#(and (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-21 03:11:46,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {7964#(and (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 1))} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {7974#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~y~0#1| 1)))} is VALID [2022-02-21 03:11:46,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {7974#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~y~0#1| 1)))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {7974#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~y~0#1| 1)))} is VALID [2022-02-21 03:11:46,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {7974#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~y~0#1| 1)))} assume 1 + main_#t~post7#1 <= 2147483647; {7974#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~y~0#1| 1)))} is VALID [2022-02-21 03:11:46,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {7974#(and (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~y~0#1| 1)))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {7984#(and (<= |ULTIMATE.start_main_#t~post8#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-21 03:11:46,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {7984#(and (<= |ULTIMATE.start_main_#t~post8#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume 1 + main_#t~post8#1 <= 2147483647; {7984#(and (<= |ULTIMATE.start_main_#t~post8#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-21 03:11:46,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {7984#(and (<= |ULTIMATE.start_main_#t~post8#1| 1) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {7991#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-21 03:11:46,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {7991#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {7991#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-21 03:11:46,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {7991#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {7991#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-21 03:11:46,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {7991#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {7991#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-21 03:11:46,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {7991#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {8004#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 2))} is VALID [2022-02-21 03:11:46,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {8004#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 2))} assume 0 != main_~flag~0#1 % 256; {8004#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 2))} is VALID [2022-02-21 03:11:46,321 INFO L290 TraceCheckUtils]: 25: Hoare triple {8004#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 2))} assume 1 + main_~j~0#1 <= 2147483647; {8004#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 2))} is VALID [2022-02-21 03:11:46,321 INFO L290 TraceCheckUtils]: 26: Hoare triple {8004#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 2))} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {8014#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-21 03:11:46,322 INFO L290 TraceCheckUtils]: 27: Hoare triple {8014#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~y~0#1|)))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {8014#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-21 03:11:46,322 INFO L290 TraceCheckUtils]: 28: Hoare triple {8014#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~y~0#1|)))} assume 1 + main_#t~post7#1 <= 2147483647; {8014#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-21 03:11:46,323 INFO L290 TraceCheckUtils]: 29: Hoare triple {8014#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~y~0#1|)))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {8024#(and (<= |ULTIMATE.start_main_~j~0#1| 5) (<= |ULTIMATE.start_main_#t~post8#1| 2))} is VALID [2022-02-21 03:11:46,323 INFO L290 TraceCheckUtils]: 30: Hoare triple {8024#(and (<= |ULTIMATE.start_main_~j~0#1| 5) (<= |ULTIMATE.start_main_#t~post8#1| 2))} assume 1 + main_#t~post8#1 <= 2147483647; {8024#(and (<= |ULTIMATE.start_main_~j~0#1| 5) (<= |ULTIMATE.start_main_#t~post8#1| 2))} is VALID [2022-02-21 03:11:46,324 INFO L290 TraceCheckUtils]: 31: Hoare triple {8024#(and (<= |ULTIMATE.start_main_~j~0#1| 5) (<= |ULTIMATE.start_main_#t~post8#1| 2))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {8031#(and (<= |ULTIMATE.start_main_~j~0#1| 5) (<= |ULTIMATE.start_main_~y~0#1| 3))} is VALID [2022-02-21 03:11:46,324 INFO L290 TraceCheckUtils]: 32: Hoare triple {8031#(and (<= |ULTIMATE.start_main_~j~0#1| 5) (<= |ULTIMATE.start_main_~y~0#1| 3))} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {8031#(and (<= |ULTIMATE.start_main_~j~0#1| 5) (<= |ULTIMATE.start_main_~y~0#1| 3))} is VALID [2022-02-21 03:11:46,325 INFO L290 TraceCheckUtils]: 33: Hoare triple {8031#(and (<= |ULTIMATE.start_main_~j~0#1| 5) (<= |ULTIMATE.start_main_~y~0#1| 3))} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {8031#(and (<= |ULTIMATE.start_main_~j~0#1| 5) (<= |ULTIMATE.start_main_~y~0#1| 3))} is VALID [2022-02-21 03:11:46,325 INFO L290 TraceCheckUtils]: 34: Hoare triple {8031#(and (<= |ULTIMATE.start_main_~j~0#1| 5) (<= |ULTIMATE.start_main_~y~0#1| 3))} assume main_~j~0#1 + main_~y~0#1 <= 2147483647; {8031#(and (<= |ULTIMATE.start_main_~j~0#1| 5) (<= |ULTIMATE.start_main_~y~0#1| 3))} is VALID [2022-02-21 03:11:46,325 INFO L290 TraceCheckUtils]: 35: Hoare triple {8031#(and (<= |ULTIMATE.start_main_~j~0#1| 5) (<= |ULTIMATE.start_main_~y~0#1| 3))} assume main_~j~0#1 + main_~y~0#1 >= -2147483648;main_~j~0#1 := main_~j~0#1 + main_~y~0#1; {8044#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 5 |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 3))} is VALID [2022-02-21 03:11:46,326 INFO L290 TraceCheckUtils]: 36: Hoare triple {8044#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 5 |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 3))} assume 0 != main_~flag~0#1 % 256; {8044#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 5 |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 3))} is VALID [2022-02-21 03:11:46,326 INFO L290 TraceCheckUtils]: 37: Hoare triple {8044#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 5 |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 3))} assume 1 + main_~j~0#1 <= 2147483647; {8044#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 5 |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 3))} is VALID [2022-02-21 03:11:46,327 INFO L290 TraceCheckUtils]: 38: Hoare triple {8044#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 5 |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 3))} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {8054#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 3))} is VALID [2022-02-21 03:11:46,327 INFO L290 TraceCheckUtils]: 39: Hoare triple {8054#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 3))} assume !!(0 != main_#t~nondet6#1 % 256);havoc main_#t~nondet6#1;main_#t~post7#1 := main_~x~0#1; {8054#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 3))} is VALID [2022-02-21 03:11:46,328 INFO L290 TraceCheckUtils]: 40: Hoare triple {8054#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 3))} assume 1 + main_#t~post7#1 <= 2147483647; {8054#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 3))} is VALID [2022-02-21 03:11:46,328 INFO L290 TraceCheckUtils]: 41: Hoare triple {8054#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 3))} assume 1 + main_#t~post7#1 >= -2147483648;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~y~0#1; {8064#(and (<= |ULTIMATE.start_main_#t~post8#1| 3) (<= |ULTIMATE.start_main_~j~0#1| 9))} is VALID [2022-02-21 03:11:46,332 INFO L290 TraceCheckUtils]: 42: Hoare triple {8064#(and (<= |ULTIMATE.start_main_#t~post8#1| 3) (<= |ULTIMATE.start_main_~j~0#1| 9))} assume 1 + main_#t~post8#1 <= 2147483647; {8064#(and (<= |ULTIMATE.start_main_#t~post8#1| 3) (<= |ULTIMATE.start_main_~j~0#1| 9))} is VALID [2022-02-21 03:11:46,332 INFO L290 TraceCheckUtils]: 43: Hoare triple {8064#(and (<= |ULTIMATE.start_main_#t~post8#1| 3) (<= |ULTIMATE.start_main_~j~0#1| 9))} assume 1 + main_#t~post8#1 >= -2147483648;main_~y~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {8071#(and (<= |ULTIMATE.start_main_~j~0#1| 9) (<= |ULTIMATE.start_main_~y~0#1| 4))} is VALID [2022-02-21 03:11:46,333 INFO L290 TraceCheckUtils]: 44: Hoare triple {8071#(and (<= |ULTIMATE.start_main_~j~0#1| 9) (<= |ULTIMATE.start_main_~y~0#1| 4))} assume main_~i~0#1 + main_~x~0#1 <= 2147483647; {8071#(and (<= |ULTIMATE.start_main_~j~0#1| 9) (<= |ULTIMATE.start_main_~y~0#1| 4))} is VALID [2022-02-21 03:11:46,333 INFO L290 TraceCheckUtils]: 45: Hoare triple {8071#(and (<= |ULTIMATE.start_main_~j~0#1| 9) (<= |ULTIMATE.start_main_~y~0#1| 4))} assume main_~i~0#1 + main_~x~0#1 >= -2147483648;main_~i~0#1 := main_~i~0#1 + main_~x~0#1; {8071#(and (<= |ULTIMATE.start_main_~j~0#1| 9) (<= |ULTIMATE.start_main_~y~0#1| 4))} is VALID [2022-02-21 03:11:46,334 INFO L290 TraceCheckUtils]: 46: Hoare triple {8071#(and (<= |ULTIMATE.start_main_~j~0#1| 9) (<= |ULTIMATE.start_main_~y~0#1| 4))} assume !(main_~j~0#1 + main_~y~0#1 <= 2147483647); {7907#false} is VALID [2022-02-21 03:11:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:11:46,334 INFO L328 TraceCheckSpWp]: Computing backward predicates...