./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig7.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig7.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 20745b6559a0027241fed3a5cbed63a985f3358ae9d5e4871ad5e64eb23bcb25 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:05:27,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:05:27,556 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:05:27,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:05:27,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:05:27,592 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:05:27,593 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:05:27,595 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:05:27,596 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:05:27,599 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:05:27,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:05:27,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:05:27,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:05:27,602 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:05:27,603 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:05:27,606 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:05:27,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:05:27,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:05:27,609 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:05:27,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:05:27,613 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:05:27,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:05:27,615 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:05:27,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:05:27,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:05:27,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:05:27,621 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:05:27,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:05:27,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:05:27,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:05:27,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:05:27,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:05:27,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:05:27,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:05:27,626 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:05:27,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:05:27,627 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:05:27,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:05:27,628 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:05:27,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:05:27,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:05:27,630 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-02-21 03:05:27,653 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:05:27,653 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:05:27,654 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:05:27,654 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:05:27,654 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:05:27,654 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:05:27,655 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:05:27,655 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:05:27,655 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:05:27,655 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:05:27,656 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:05:27,656 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:05:27,656 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:05:27,657 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:05:27,657 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:05:27,657 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:05:27,657 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:05:27,657 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:05:27,657 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:05:27,657 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:05:27,658 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:05:27,658 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:05:27,658 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:05:27,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:05:27,658 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:05:27,658 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:05:27,659 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:05:27,659 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:05:27,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:05:27,660 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:05:27,660 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 20745b6559a0027241fed3a5cbed63a985f3358ae9d5e4871ad5e64eb23bcb25 [2022-02-21 03:05:27,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:05:27,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:05:27,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:05:27,919 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:05:27,919 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:05:27,920 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig7.c [2022-02-21 03:05:27,985 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce0ffa22a/e5c9b65b0e184b269745d86efd89bb70/FLAG0d7a5270a [2022-02-21 03:05:28,328 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:05:28,329 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig7.c [2022-02-21 03:05:28,333 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce0ffa22a/e5c9b65b0e184b269745d86efd89bb70/FLAG0d7a5270a [2022-02-21 03:05:28,341 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce0ffa22a/e5c9b65b0e184b269745d86efd89bb70 [2022-02-21 03:05:28,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:05:28,343 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:05:28,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:05:28,344 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:05:28,346 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:05:28,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:05:28" (1/1) ... [2022-02-21 03:05:28,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21707751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:28, skipping insertion in model container [2022-02-21 03:05:28,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:05:28" (1/1) ... [2022-02-21 03:05:28,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:05:28,359 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:05:28,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:05:28,502 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:05:28,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:05:28,543 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:05:28,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:28 WrapperNode [2022-02-21 03:05:28,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:05:28,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:05:28,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:05:28,545 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:05:28,552 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:05:28" (1/1) ... [2022-02-21 03:05:28,569 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:05:28" (1/1) ... [2022-02-21 03:05:28,604 INFO L137 Inliner]: procedures = 8, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2022-02-21 03:05:28,605 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:05:28,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:05:28,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:05:28,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:05:28,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:28" (1/1) ... [2022-02-21 03:05:28,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:28" (1/1) ... [2022-02-21 03:05:28,632 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:28" (1/1) ... [2022-02-21 03:05:28,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:28" (1/1) ... [2022-02-21 03:05:28,636 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:28" (1/1) ... [2022-02-21 03:05:28,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:28" (1/1) ... [2022-02-21 03:05:28,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:28" (1/1) ... [2022-02-21 03:05:28,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:05:28,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:05:28,666 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:05:28,667 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:05:28,667 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:28" (1/1) ... [2022-02-21 03:05:28,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:05:28,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:05:28,717 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:05:28,770 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:05:28,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:05:28,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:05:28,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:05:28,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:05:28,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:05:28,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:05:28,835 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:05:28,837 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:05:28,962 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:05:28,967 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:05:28,967 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:05:28,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:05:28 BoogieIcfgContainer [2022-02-21 03:05:28,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:05:28,969 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:05:28,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:05:28,972 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:05:28,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:05:28" (1/3) ... [2022-02-21 03:05:28,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514d6017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:05:28, skipping insertion in model container [2022-02-21 03:05:28,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:28" (2/3) ... [2022-02-21 03:05:28,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514d6017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:05:28, skipping insertion in model container [2022-02-21 03:05:28,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:05:28" (3/3) ... [2022-02-21 03:05:28,974 INFO L111 eAbstractionObserver]: Analyzing ICFG HeizmannHoenickeLeikePodelski-ATVA2013-Fig7.c [2022-02-21 03:05:28,977 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:05:28,978 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-02-21 03:05:29,008 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:05:29,013 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:05:29,013 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-21 03:05:29,024 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 23 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:05:29,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:05:29,027 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:29,054 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:05:29,055 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:05:29,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:29,066 INFO L85 PathProgramCache]: Analyzing trace with hash 889574220, now seen corresponding path program 1 times [2022-02-21 03:05:29,072 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:29,073 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285200542] [2022-02-21 03:05:29,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:29,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:29,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {27#true} is VALID [2022-02-21 03:05:29,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~post1#1, main_~j~0#1, main_#t~mem3#1, main_#t~mem4#1, main_~a_length~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~offset~0#1, main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a_length~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {27#true} is VALID [2022-02-21 03:05:29,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume !(main_~a_length~0#1 < 1);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * main_~a_length~0#1);main_~j~0#1 := 0; {29#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:05:29,241 INFO L290 TraceCheckUtils]: 3: Hoare triple {29#(= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 < main_~a_length~0#1);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet2#1; {29#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:05:29,242 INFO L290 TraceCheckUtils]: 4: Hoare triple {29#(= |ULTIMATE.start_main_~j~0#1| 0)} main_#t~post1#1 := main_~j~0#1; {30#(= |ULTIMATE.start_main_#t~post1#1| 0)} is VALID [2022-02-21 03:05:29,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#(= |ULTIMATE.start_main_#t~post1#1| 0)} assume !(1 + main_#t~post1#1 <= 2147483647); {28#false} is VALID [2022-02-21 03:05:29,243 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:05:29,244 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:29,244 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285200542] [2022-02-21 03:05:29,244 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285200542] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:29,245 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:29,245 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:05:29,246 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859192429] [2022-02-21 03:05:29,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:29,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-02-21 03:05:29,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:29,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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:05:29,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:29,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:05:29,263 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:29,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:05:29,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:05:29,287 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 23 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 has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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:05:29,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:29,365 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-02-21 03:05:29,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:05:29,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-02-21 03:05:29,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:29,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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:05:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-02-21 03:05:29,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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:05:29,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-02-21 03:05:29,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2022-02-21 03:05:29,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:29,431 INFO L225 Difference]: With dead ends: 60 [2022-02-21 03:05:29,431 INFO L226 Difference]: Without dead ends: 35 [2022-02-21 03:05:29,433 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:05:29,435 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 20 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:29,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 66 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:29,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-21 03:05:29,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 24. [2022-02-21 03:05:29,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:29,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 24 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 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:05:29,454 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 24 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 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:05:29,454 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 24 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 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:05:29,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:29,457 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-02-21 03:05:29,457 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-02-21 03:05:29,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:29,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:29,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 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 35 states. [2022-02-21 03:05:29,458 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 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 35 states. [2022-02-21 03:05:29,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:29,460 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-02-21 03:05:29,460 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-02-21 03:05:29,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:29,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:29,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:29,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:29,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 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:05:29,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-02-21 03:05:29,463 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 6 [2022-02-21 03:05:29,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:29,463 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-02-21 03:05:29,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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:05:29,470 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-02-21 03:05:29,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-21 03:05:29,470 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:29,471 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:05:29,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:05:29,471 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:05:29,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:29,472 INFO L85 PathProgramCache]: Analyzing trace with hash 180741427, now seen corresponding path program 1 times [2022-02-21 03:05:29,472 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:29,472 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764213477] [2022-02-21 03:05:29,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:29,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:29,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {200#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {200#true} is VALID [2022-02-21 03:05:29,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {200#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~post1#1, main_~j~0#1, main_#t~mem3#1, main_#t~mem4#1, main_~a_length~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~offset~0#1, main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a_length~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {200#true} is VALID [2022-02-21 03:05:29,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {200#true} assume !(main_~a_length~0#1 < 1);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * main_~a_length~0#1);main_~j~0#1 := 0; {202#(and (<= 1 |ULTIMATE.start_main_~a_length~0#1|) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:05:29,518 INFO L290 TraceCheckUtils]: 3: Hoare triple {202#(and (<= 1 |ULTIMATE.start_main_~a_length~0#1|) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_~j~0#1 < main_~a_length~0#1); {201#false} is VALID [2022-02-21 03:05:29,519 INFO L290 TraceCheckUtils]: 4: Hoare triple {201#false} main_~offset~0#1 := 1;main_~i~0#1 := 0; {201#false} is VALID [2022-02-21 03:05:29,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {201#false} assume !!(main_~i~0#1 < main_~a_length~0#1);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {201#false} is VALID [2022-02-21 03:05:29,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {201#false} assume !(main_#t~mem3#1 < 0);havoc main_#t~mem3#1; {201#false} is VALID [2022-02-21 03:05:29,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {201#false} assume !(main_~i~0#1 + main_~offset~0#1 <= 2147483647); {201#false} is VALID [2022-02-21 03:05:29,520 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:05:29,520 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:29,520 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764213477] [2022-02-21 03:05:29,520 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764213477] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:29,520 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:29,520 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:05:29,521 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689622891] [2022-02-21 03:05:29,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:29,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-21 03:05:29,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:29,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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:05:29,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:29,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:05:29,531 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:29,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:05:29,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:29,532 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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:05:29,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:29,568 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-02-21 03:05:29,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:05:29,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-21 03:05:29,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:29,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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:05:29,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-02-21 03:05:29,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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:05:29,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-02-21 03:05:29,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-02-21 03:05:29,601 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:05:29,603 INFO L225 Difference]: With dead ends: 35 [2022-02-21 03:05:29,603 INFO L226 Difference]: Without dead ends: 24 [2022-02-21 03:05:29,603 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:05:29,606 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:29,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 33 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:29,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-21 03:05:29,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-21 03:05:29,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:29,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 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:05:29,613 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 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:05:29,614 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 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:05:29,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:29,616 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-02-21 03:05:29,617 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-02-21 03:05:29,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:29,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:29,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 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 24 states. [2022-02-21 03:05:29,620 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 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 24 states. [2022-02-21 03:05:29,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:29,622 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-02-21 03:05:29,622 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-02-21 03:05:29,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:29,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:29,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:29,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:29,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 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:05:29,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-02-21 03:05:29,629 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 8 [2022-02-21 03:05:29,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:29,630 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-02-21 03:05:29,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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:05:29,630 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-02-21 03:05:29,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-21 03:05:29,631 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:29,631 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:05:29,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:05:29,632 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:05:29,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:29,633 INFO L85 PathProgramCache]: Analyzing trace with hash -869586168, now seen corresponding path program 1 times [2022-02-21 03:05:29,633 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:29,633 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26567364] [2022-02-21 03:05:29,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:29,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:29,694 INFO L290 TraceCheckUtils]: 0: Hoare triple {319#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {319#true} is VALID [2022-02-21 03:05:29,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {319#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~post1#1, main_~j~0#1, main_#t~mem3#1, main_#t~mem4#1, main_~a_length~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~offset~0#1, main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a_length~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {319#true} is VALID [2022-02-21 03:05:29,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {319#true} assume !(main_~a_length~0#1 < 1);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * main_~a_length~0#1);main_~j~0#1 := 0; {321#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:05:29,695 INFO L290 TraceCheckUtils]: 3: Hoare triple {321#(= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 < main_~a_length~0#1);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet2#1; {321#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:05:29,696 INFO L290 TraceCheckUtils]: 4: Hoare triple {321#(= |ULTIMATE.start_main_~j~0#1| 0)} main_#t~post1#1 := main_~j~0#1; {322#(= |ULTIMATE.start_main_#t~post1#1| 0)} is VALID [2022-02-21 03:05:29,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {322#(= |ULTIMATE.start_main_#t~post1#1| 0)} assume 1 + main_#t~post1#1 <= 2147483647; {322#(= |ULTIMATE.start_main_#t~post1#1| 0)} is VALID [2022-02-21 03:05:29,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {322#(= |ULTIMATE.start_main_#t~post1#1| 0)} assume 1 + main_#t~post1#1 >= -2147483648;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {323#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:05:29,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {323#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !!(main_~j~0#1 < main_~a_length~0#1);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet2#1; {323#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:05:29,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {323#(<= |ULTIMATE.start_main_~j~0#1| 1)} main_#t~post1#1 := main_~j~0#1; {324#(<= |ULTIMATE.start_main_#t~post1#1| 1)} is VALID [2022-02-21 03:05:29,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {324#(<= |ULTIMATE.start_main_#t~post1#1| 1)} assume !(1 + main_#t~post1#1 <= 2147483647); {320#false} is VALID [2022-02-21 03:05:29,700 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:05:29,700 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:29,701 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26567364] [2022-02-21 03:05:29,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26567364] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:05:29,701 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439894724] [2022-02-21 03:05:29,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:29,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:05:29,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:05:29,714 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:05:29,717 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:05:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:29,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:05:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:29,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:05:29,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {319#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {319#true} is VALID [2022-02-21 03:05:29,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {319#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~post1#1, main_~j~0#1, main_#t~mem3#1, main_#t~mem4#1, main_~a_length~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~offset~0#1, main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a_length~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {319#true} is VALID [2022-02-21 03:05:29,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {319#true} assume !(main_~a_length~0#1 < 1);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * main_~a_length~0#1);main_~j~0#1 := 0; {334#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:05:29,912 INFO L290 TraceCheckUtils]: 3: Hoare triple {334#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 < main_~a_length~0#1);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet2#1; {334#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:05:29,913 INFO L290 TraceCheckUtils]: 4: Hoare triple {334#(<= |ULTIMATE.start_main_~j~0#1| 0)} main_#t~post1#1 := main_~j~0#1; {341#(<= |ULTIMATE.start_main_#t~post1#1| 0)} is VALID [2022-02-21 03:05:29,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {341#(<= |ULTIMATE.start_main_#t~post1#1| 0)} assume 1 + main_#t~post1#1 <= 2147483647; {341#(<= |ULTIMATE.start_main_#t~post1#1| 0)} is VALID [2022-02-21 03:05:29,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {341#(<= |ULTIMATE.start_main_#t~post1#1| 0)} assume 1 + main_#t~post1#1 >= -2147483648;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {323#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:05:29,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {323#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !!(main_~j~0#1 < main_~a_length~0#1);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet2#1; {323#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:05:29,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {323#(<= |ULTIMATE.start_main_~j~0#1| 1)} main_#t~post1#1 := main_~j~0#1; {324#(<= |ULTIMATE.start_main_#t~post1#1| 1)} is VALID [2022-02-21 03:05:29,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {324#(<= |ULTIMATE.start_main_#t~post1#1| 1)} assume !(1 + main_#t~post1#1 <= 2147483647); {320#false} is VALID [2022-02-21 03:05:29,916 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:05:29,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:05:30,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {357#(<= |ULTIMATE.start_main_#t~post1#1| 2147483646)} assume !(1 + main_#t~post1#1 <= 2147483647); {320#false} is VALID [2022-02-21 03:05:30,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {361#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} main_#t~post1#1 := main_~j~0#1; {357#(<= |ULTIMATE.start_main_#t~post1#1| 2147483646)} is VALID [2022-02-21 03:05:30,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {361#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} assume !!(main_~j~0#1 < main_~a_length~0#1);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet2#1; {361#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} is VALID [2022-02-21 03:05:30,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {368#(<= |ULTIMATE.start_main_#t~post1#1| 2147483645)} assume 1 + main_#t~post1#1 >= -2147483648;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {361#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} is VALID [2022-02-21 03:05:30,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {368#(<= |ULTIMATE.start_main_#t~post1#1| 2147483645)} assume 1 + main_#t~post1#1 <= 2147483647; {368#(<= |ULTIMATE.start_main_#t~post1#1| 2147483645)} is VALID [2022-02-21 03:05:30,043 INFO L290 TraceCheckUtils]: 4: Hoare triple {375#(<= |ULTIMATE.start_main_~j~0#1| 2147483645)} main_#t~post1#1 := main_~j~0#1; {368#(<= |ULTIMATE.start_main_#t~post1#1| 2147483645)} is VALID [2022-02-21 03:05:30,044 INFO L290 TraceCheckUtils]: 3: Hoare triple {375#(<= |ULTIMATE.start_main_~j~0#1| 2147483645)} assume !!(main_~j~0#1 < main_~a_length~0#1);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet2#1; {375#(<= |ULTIMATE.start_main_~j~0#1| 2147483645)} is VALID [2022-02-21 03:05:30,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {319#true} assume !(main_~a_length~0#1 < 1);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * main_~a_length~0#1);main_~j~0#1 := 0; {375#(<= |ULTIMATE.start_main_~j~0#1| 2147483645)} is VALID [2022-02-21 03:05:30,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {319#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~post1#1, main_~j~0#1, main_#t~mem3#1, main_#t~mem4#1, main_~a_length~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~offset~0#1, main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a_length~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {319#true} is VALID [2022-02-21 03:05:30,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {319#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {319#true} is VALID [2022-02-21 03:05:30,045 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:05:30,046 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439894724] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:05:30,046 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:05:30,046 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-02-21 03:05:30,047 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379642176] [2022-02-21 03:05:30,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:05:30,047 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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:05:30,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:30,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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:05:30,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:30,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-21 03:05:30,067 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:30,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:05:30,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:05:30,068 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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:05:30,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:30,258 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2022-02-21 03:05:30,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-21 03:05:30,258 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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:05:30,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:30,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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:05:30,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2022-02-21 03:05:30,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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:05:30,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2022-02-21 03:05:30,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 79 transitions. [2022-02-21 03:05:30,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:30,319 INFO L225 Difference]: With dead ends: 73 [2022-02-21 03:05:30,319 INFO L226 Difference]: Without dead ends: 72 [2022-02-21 03:05:30,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 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:05:30,321 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 73 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:30,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 90 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:30,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-02-21 03:05:30,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 35. [2022-02-21 03:05:30,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:30,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 35 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 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:05:30,326 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 35 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 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:05:30,327 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 35 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 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:05:30,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:30,328 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2022-02-21 03:05:30,328 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-02-21 03:05:30,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:30,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:30,329 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 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 72 states. [2022-02-21 03:05:30,329 INFO L87 Difference]: Start difference. First operand has 35 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 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 72 states. [2022-02-21 03:05:30,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:30,331 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2022-02-21 03:05:30,331 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-02-21 03:05:30,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:30,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:30,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:30,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:30,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 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:05:30,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-02-21 03:05:30,333 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 10 [2022-02-21 03:05:30,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:30,333 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-02-21 03:05:30,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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:05:30,333 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-02-21 03:05:30,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-21 03:05:30,334 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:30,334 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2022-02-21 03:05:30,353 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:05:30,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:05:30,548 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:05:30,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:30,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1187367381, now seen corresponding path program 1 times [2022-02-21 03:05:30,549 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:30,549 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367229206] [2022-02-21 03:05:30,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:30,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:30,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {668#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {668#true} is VALID [2022-02-21 03:05:30,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {668#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~post1#1, main_~j~0#1, main_#t~mem3#1, main_#t~mem4#1, main_~a_length~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~offset~0#1, main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a_length~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {668#true} is VALID [2022-02-21 03:05:30,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {668#true} assume !(main_~a_length~0#1 < 1);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * main_~a_length~0#1);main_~j~0#1 := 0; {670#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:05:30,596 INFO L290 TraceCheckUtils]: 3: Hoare triple {670#(= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 < main_~a_length~0#1);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet2#1; {670#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:05:30,596 INFO L290 TraceCheckUtils]: 4: Hoare triple {670#(= |ULTIMATE.start_main_~j~0#1| 0)} main_#t~post1#1 := main_~j~0#1; {671#(= |ULTIMATE.start_main_#t~post1#1| 0)} is VALID [2022-02-21 03:05:30,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {671#(= |ULTIMATE.start_main_#t~post1#1| 0)} assume 1 + main_#t~post1#1 <= 2147483647; {671#(= |ULTIMATE.start_main_#t~post1#1| 0)} is VALID [2022-02-21 03:05:30,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {671#(= |ULTIMATE.start_main_#t~post1#1| 0)} assume 1 + main_#t~post1#1 >= -2147483648;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {672#(<= 1 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:05:30,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {672#(<= 1 |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~j~0#1 < main_~a_length~0#1);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet2#1; {672#(<= 1 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:05:30,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {672#(<= 1 |ULTIMATE.start_main_~j~0#1|)} main_#t~post1#1 := main_~j~0#1; {673#(<= 1 |ULTIMATE.start_main_#t~post1#1|)} is VALID [2022-02-21 03:05:30,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {673#(<= 1 |ULTIMATE.start_main_#t~post1#1|)} assume 1 + main_#t~post1#1 <= 2147483647; {673#(<= 1 |ULTIMATE.start_main_#t~post1#1|)} is VALID [2022-02-21 03:05:30,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {673#(<= 1 |ULTIMATE.start_main_#t~post1#1|)} assume !(1 + main_#t~post1#1 >= -2147483648); {669#false} is VALID [2022-02-21 03:05:30,601 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:05:30,602 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:30,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367229206] [2022-02-21 03:05:30,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367229206] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:05:30,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455686056] [2022-02-21 03:05:30,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:30,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:05:30,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:05:30,607 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:05:30,608 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:05:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:30,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:05:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:30,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:05:30,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {668#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {668#true} is VALID [2022-02-21 03:05:30,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {668#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~post1#1, main_~j~0#1, main_#t~mem3#1, main_#t~mem4#1, main_~a_length~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~offset~0#1, main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a_length~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {668#true} is VALID [2022-02-21 03:05:30,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {668#true} assume !(main_~a_length~0#1 < 1);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * main_~a_length~0#1);main_~j~0#1 := 0; {683#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:05:30,724 INFO L290 TraceCheckUtils]: 3: Hoare triple {683#(<= 0 |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~j~0#1 < main_~a_length~0#1);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet2#1; {683#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:05:30,724 INFO L290 TraceCheckUtils]: 4: Hoare triple {683#(<= 0 |ULTIMATE.start_main_~j~0#1|)} main_#t~post1#1 := main_~j~0#1; {690#(<= 0 |ULTIMATE.start_main_#t~post1#1|)} is VALID [2022-02-21 03:05:30,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {690#(<= 0 |ULTIMATE.start_main_#t~post1#1|)} assume 1 + main_#t~post1#1 <= 2147483647; {690#(<= 0 |ULTIMATE.start_main_#t~post1#1|)} is VALID [2022-02-21 03:05:30,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {690#(<= 0 |ULTIMATE.start_main_#t~post1#1|)} assume 1 + main_#t~post1#1 >= -2147483648;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {672#(<= 1 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:05:30,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {672#(<= 1 |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~j~0#1 < main_~a_length~0#1);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet2#1; {672#(<= 1 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:05:30,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {672#(<= 1 |ULTIMATE.start_main_~j~0#1|)} main_#t~post1#1 := main_~j~0#1; {673#(<= 1 |ULTIMATE.start_main_#t~post1#1|)} is VALID [2022-02-21 03:05:30,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {673#(<= 1 |ULTIMATE.start_main_#t~post1#1|)} assume 1 + main_#t~post1#1 <= 2147483647; {673#(<= 1 |ULTIMATE.start_main_#t~post1#1|)} is VALID [2022-02-21 03:05:30,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {673#(<= 1 |ULTIMATE.start_main_#t~post1#1|)} assume !(1 + main_#t~post1#1 >= -2147483648); {669#false} is VALID [2022-02-21 03:05:30,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:30,727 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:05:30,727 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455686056] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:30,727 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:05:30,727 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-02-21 03:05:30,727 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888062868] [2022-02-21 03:05:30,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:30,728 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:05:30,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:30,728 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:05:30,736 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:05:30,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:05:30,736 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:30,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:05:30,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:05:30,737 INFO L87 Difference]: Start difference. First operand 35 states and 41 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:05:30,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:30,838 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-02-21 03:05:30,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:05:30,838 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:05:30,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:30,838 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:05:30,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2022-02-21 03:05:30,839 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:05:30,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2022-02-21 03:05:30,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 25 transitions. [2022-02-21 03:05:30,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:30,862 INFO L225 Difference]: With dead ends: 35 [2022-02-21 03:05:30,862 INFO L226 Difference]: Without dead ends: 34 [2022-02-21 03:05:30,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 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:05:30,863 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 42 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:05:30,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 42 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:30,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-21 03:05:30,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-02-21 03:05:30,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:30,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 33 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:05:30,872 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 33 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:05:30,872 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 33 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:05:30,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:30,873 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-02-21 03:05:30,873 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-02-21 03:05:30,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:30,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:30,873 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 33 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 34 states. [2022-02-21 03:05:30,874 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 33 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 34 states. [2022-02-21 03:05:30,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:30,874 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-02-21 03:05:30,874 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-02-21 03:05:30,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:30,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:30,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:30,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:30,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 33 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:05:30,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-02-21 03:05:30,876 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 11 [2022-02-21 03:05:30,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:30,876 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-02-21 03:05:30,876 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:05:30,876 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-02-21 03:05:30,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-21 03:05:30,876 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:30,876 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:05:30,908 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:05:31,091 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,SelfDestructingSolverStorable3 [2022-02-21 03:05:31,092 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:05:31,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:31,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1844723183, now seen corresponding path program 1 times [2022-02-21 03:05:31,092 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:31,092 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703824269] [2022-02-21 03:05:31,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:31,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:31,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {861#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {861#true} is VALID [2022-02-21 03:05:31,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {861#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~post1#1, main_~j~0#1, main_#t~mem3#1, main_#t~mem4#1, main_~a_length~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~offset~0#1, main_~i~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a_length~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {861#true} is VALID [2022-02-21 03:05:31,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {861#true} assume !(main_~a_length~0#1 < 1);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * main_~a_length~0#1);main_~j~0#1 := 0; {861#true} is VALID [2022-02-21 03:05:31,131 INFO L290 TraceCheckUtils]: 3: Hoare triple {861#true} assume !!(main_~j~0#1 < main_~a_length~0#1);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet2#1; {861#true} is VALID [2022-02-21 03:05:31,132 INFO L290 TraceCheckUtils]: 4: Hoare triple {861#true} main_#t~post1#1 := main_~j~0#1; {861#true} is VALID [2022-02-21 03:05:31,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {861#true} assume 1 + main_#t~post1#1 <= 2147483647; {861#true} is VALID [2022-02-21 03:05:31,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {861#true} assume 1 + main_#t~post1#1 >= -2147483648;main_~j~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {861#true} is VALID [2022-02-21 03:05:31,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {861#true} assume !(main_~j~0#1 < main_~a_length~0#1); {861#true} is VALID [2022-02-21 03:05:31,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {861#true} main_~offset~0#1 := 1;main_~i~0#1 := 0; {863#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~offset~0#1|) 0))} is VALID [2022-02-21 03:05:31,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {863#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~offset~0#1|) 0))} assume !!(main_~i~0#1 < main_~a_length~0#1);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {863#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~offset~0#1|) 0))} is VALID [2022-02-21 03:05:31,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {863#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~offset~0#1|) 0))} assume !(main_#t~mem3#1 < 0);havoc main_#t~mem3#1; {863#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~offset~0#1|) 0))} is VALID [2022-02-21 03:05:31,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {863#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~offset~0#1|) 0))} assume !(main_~i~0#1 + main_~offset~0#1 <= 2147483647); {862#false} is VALID [2022-02-21 03:05:31,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:05:31,137 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:31,138 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703824269] [2022-02-21 03:05:31,138 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703824269] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:31,138 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:31,142 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:05:31,143 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230774708] [2022-02-21 03:05:31,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:31,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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:05:31,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:31,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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:05:31,158 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:05:31,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:05:31,159 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:31,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:05:31,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:31,160 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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:05:31,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:31,215 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-02-21 03:05:31,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:05:31,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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:05:31,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:31,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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:05:31,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-02-21 03:05:31,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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:05:31,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-02-21 03:05:31,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 30 transitions. [2022-02-21 03:05:31,252 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:05:31,253 INFO L225 Difference]: With dead ends: 44 [2022-02-21 03:05:31,253 INFO L226 Difference]: Without dead ends: 42 [2022-02-21 03:05:31,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:31,256 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 5 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:31,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 22 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:31,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-21 03:05:31,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2022-02-21 03:05:31,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:31,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 38 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 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:05:31,271 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 38 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 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:05:31,271 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 38 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 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:05:31,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:31,287 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-02-21 03:05:31,288 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-02-21 03:05:31,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:31,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:31,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 states. [2022-02-21 03:05:31,289 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 states. [2022-02-21 03:05:31,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:31,291 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-02-21 03:05:31,291 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-02-21 03:05:31,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:31,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:31,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:31,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:31,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 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:05:31,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-02-21 03:05:31,294 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 12 [2022-02-21 03:05:31,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:31,295 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-02-21 03:05:31,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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:05:31,295 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-02-21 03:05:31,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-21 03:05:31,295 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:31,296 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:05:31,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 03:05:31,296 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:05:31,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:31,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1042512047, now seen corresponding path program 1 times [2022-02-21 03:05:31,297 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:31,297 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856525745] [2022-02-21 03:05:31,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:31,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:05:31,343 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:05:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:05:31,381 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:05:31,399 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-21 03:05:31,400 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-02-21 03:05:31,401 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-02-21 03:05:31,402 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-02-21 03:05:31,402 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-02-21 03:05:31,402 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-02-21 03:05:31,404 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-02-21 03:05:31,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 03:05:31,408 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-21 03:05:31,410 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:05:31,467 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-21 03:05:31,467 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-21 03:05:31,467 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-21 03:05:31,467 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-21 03:05:31,467 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-21 03:05:31,467 WARN L170 areAnnotationChecker]: L17-5 has no Hoare annotation [2022-02-21 03:05:31,468 WARN L170 areAnnotationChecker]: L17-5 has no Hoare annotation [2022-02-21 03:05:31,468 WARN L170 areAnnotationChecker]: L17-5 has no Hoare annotation [2022-02-21 03:05:31,468 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:05:31,468 WARN L170 areAnnotationChecker]: L17-6 has no Hoare annotation [2022-02-21 03:05:31,468 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-02-21 03:05:31,468 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-21 03:05:31,468 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-21 03:05:31,468 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-21 03:05:31,468 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2022-02-21 03:05:31,468 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2022-02-21 03:05:31,468 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-02-21 03:05:31,469 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-21 03:05:31,469 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-21 03:05:31,469 WARN L170 areAnnotationChecker]: L17-4 has no Hoare annotation [2022-02-21 03:05:31,469 WARN L170 areAnnotationChecker]: L17-4 has no Hoare annotation [2022-02-21 03:05:31,469 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-21 03:05:31,469 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-21 03:05:31,469 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-21 03:05:31,469 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-21 03:05:31,469 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2022-02-21 03:05:31,469 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2022-02-21 03:05:31,470 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-02-21 03:05:31,470 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-02-21 03:05:31,470 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-21 03:05:31,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 03:05:31 BoogieIcfgContainer [2022-02-21 03:05:31,470 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 03:05:31,471 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:05:31,471 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:05:31,471 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:05:31,472 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:05:28" (3/4) ... [2022-02-21 03:05:31,473 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-21 03:05:31,528 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:05:31,529 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:05:31,530 INFO L158 Benchmark]: Toolchain (without parser) took 3186.35ms. Allocated memory was 96.5MB in the beginning and 127.9MB in the end (delta: 31.5MB). Free memory was 61.0MB in the beginning and 86.2MB in the end (delta: -25.3MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2022-02-21 03:05:31,530 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 77.7MB in the beginning and 77.6MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:05:31,530 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.23ms. Allocated memory is still 96.5MB. Free memory was 60.8MB in the beginning and 73.7MB in the end (delta: -12.9MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2022-02-21 03:05:31,530 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.12ms. Allocated memory is still 96.5MB. Free memory was 73.7MB in the beginning and 72.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:05:31,531 INFO L158 Benchmark]: Boogie Preprocessor took 47.51ms. Allocated memory is still 96.5MB. Free memory was 72.0MB in the beginning and 71.0MB in the end (delta: 986.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:05:31,531 INFO L158 Benchmark]: RCFGBuilder took 302.45ms. Allocated memory is still 96.5MB. Free memory was 71.0MB in the beginning and 59.5MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:05:31,531 INFO L158 Benchmark]: TraceAbstraction took 2501.08ms. Allocated memory was 96.5MB in the beginning and 127.9MB in the end (delta: 31.5MB). Free memory was 59.1MB in the beginning and 88.3MB in the end (delta: -29.3MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2022-02-21 03:05:31,531 INFO L158 Benchmark]: Witness Printer took 57.60ms. Allocated memory is still 127.9MB. Free memory was 88.3MB in the beginning and 86.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:05:31,533 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 77.7MB in the beginning and 77.6MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.23ms. Allocated memory is still 96.5MB. Free memory was 60.8MB in the beginning and 73.7MB in the end (delta: -12.9MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.12ms. Allocated memory is still 96.5MB. Free memory was 73.7MB in the beginning and 72.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.51ms. Allocated memory is still 96.5MB. Free memory was 72.0MB in the beginning and 71.0MB in the end (delta: 986.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 302.45ms. Allocated memory is still 96.5MB. Free memory was 71.0MB in the beginning and 59.5MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2501.08ms. Allocated memory was 96.5MB in the beginning and 127.9MB in the end (delta: 31.5MB). Free memory was 59.1MB in the beginning and 88.3MB in the end (delta: -29.3MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. * Witness Printer took 57.60ms. Allocated memory is still 127.9MB. Free memory was 88.3MB in the beginning and 86.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 26]: integer overflow possible integer overflow possible We found a FailurePath: [L12] int a_length = __VERIFIER_nondet_int(); [L13] COND FALSE !(a_length < 1) [L16] int a[a_length]; [L17] int j = 0; VAL [a={2:0}, a_length=1, j=0] [L17] COND TRUE j < a_length [L18] a[j] = __VERIFIER_nondet_int() [L17] j++ VAL [a={2:0}, a_length=1, j=1] [L17] COND FALSE !(j < a_length) VAL [a={2:0}, a_length=1, j=1] [L20] int offset = 1; [L21] int i = 0; VAL [a={2:0}, a_length=1, i=0, j=1, offset=1] [L22] COND TRUE i < a_length [L23] EXPR a[i] VAL [a={2:0}, a[i]=2147483647, a_length=1, i=0, j=1, offset=1] [L23] COND FALSE !(a[i] < 0) [L26] EXPR i + offset [L26] EXPR a[i] VAL [a={2:0}, a[i]=2147483647, a_length=1, i=0, j=1, offset=1] [L26] i + offset + a[i] VAL [a={2:0}, a[i]=2147483647, a_length=1, i=0, j=1, offset=1] - UnprovableResult [Line: 17]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 26]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 26]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 26]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119 mSDsluCounter, 253 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 168 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124 IncrementalHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 85 mSDtfsCounter, 124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=5, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 52 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 180 SizeOfPredicates, 4 NumberOfNonLiveVariables, 99 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 5/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-02-21 03:05:31,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)