./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-cousot9.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/AliasDarteFeautrierGonnord-SAS2010-cousot9.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 82f10acf23a705ed9ee52063aab9490fd4596871d88518858bc1e47422aca9cc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:03:38,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:03:38,210 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:03:38,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:03:38,228 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:03:38,229 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:03:38,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:03:38,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:03:38,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:03:38,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:03:38,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:03:38,237 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:03:38,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:03:38,239 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:03:38,240 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:03:38,241 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:03:38,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:03:38,243 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:03:38,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:03:38,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:03:38,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:03:38,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:03:38,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:03:38,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:03:38,257 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:03:38,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:03:38,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:03:38,261 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:03:38,262 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:03:38,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:03:38,263 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:03:38,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:03:38,265 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:03:38,265 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:03:38,266 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:03:38,266 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:03:38,267 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:03:38,267 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:03:38,267 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:03:38,268 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:03:38,269 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:03:38,269 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:03:38,283 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:03:38,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:03:38,285 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:03:38,285 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:03:38,286 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:03:38,286 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:03:38,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:03:38,287 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:03:38,287 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:03:38,287 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:03:38,288 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:03:38,288 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:03:38,288 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:03:38,288 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:03:38,288 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:03:38,289 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:03:38,289 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:03:38,289 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:03:38,289 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:03:38,289 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:03:38,289 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:03:38,289 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:03:38,290 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:03:38,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:03:38,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:03:38,290 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:03:38,290 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:03:38,290 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:03:38,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:03:38,291 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:03:38,291 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 -> 82f10acf23a705ed9ee52063aab9490fd4596871d88518858bc1e47422aca9cc [2022-02-21 03:03:38,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:03:38,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:03:38,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:03:38,471 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:03:38,472 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:03:38,473 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-cousot9.c [2022-02-21 03:03:38,517 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa0bc48f3/a0572760b4484e34a1bb18eed8198dd8/FLAG8961e286e [2022-02-21 03:03:38,897 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:03:38,898 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-cousot9.c [2022-02-21 03:03:38,905 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa0bc48f3/a0572760b4484e34a1bb18eed8198dd8/FLAG8961e286e [2022-02-21 03:03:38,920 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa0bc48f3/a0572760b4484e34a1bb18eed8198dd8 [2022-02-21 03:03:38,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:03:38,925 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:03:38,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:03:38,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:03:38,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:03:38,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:03:38" (1/1) ... [2022-02-21 03:03:38,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ddce61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:38, skipping insertion in model container [2022-02-21 03:03:38,934 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:03:38" (1/1) ... [2022-02-21 03:03:38,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:03:38,953 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:03:39,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:03:39,082 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:03:39,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:03:39,102 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:03:39,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:39 WrapperNode [2022-02-21 03:03:39,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:03:39,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:03:39,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:03:39,104 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:03:39,111 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:03:39" (1/1) ... [2022-02-21 03:03:39,115 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:03:39" (1/1) ... [2022-02-21 03:03:39,137 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2022-02-21 03:03:39,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:03:39,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:03:39,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:03:39,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:03:39,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:39" (1/1) ... [2022-02-21 03:03:39,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:39" (1/1) ... [2022-02-21 03:03:39,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:39" (1/1) ... [2022-02-21 03:03:39,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:39" (1/1) ... [2022-02-21 03:03:39,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:39" (1/1) ... [2022-02-21 03:03:39,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:39" (1/1) ... [2022-02-21 03:03:39,157 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:39" (1/1) ... [2022-02-21 03:03:39,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:03:39,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:03:39,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:03:39,163 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:03:39,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:39" (1/1) ... [2022-02-21 03:03:39,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:03:39,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:39,187 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:03:39,192 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:03:39,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:03:39,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:03:39,267 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:03:39,270 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:03:39,432 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:03:39,437 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:03:39,437 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:03:39,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:03:39 BoogieIcfgContainer [2022-02-21 03:03:39,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:03:39,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:03:39,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:03:39,448 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:03:39,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:03:38" (1/3) ... [2022-02-21 03:03:39,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414996d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:03:39, skipping insertion in model container [2022-02-21 03:03:39,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:39" (2/3) ... [2022-02-21 03:03:39,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414996d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:03:39, skipping insertion in model container [2022-02-21 03:03:39,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:03:39" (3/3) ... [2022-02-21 03:03:39,450 INFO L111 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-cousot9.c [2022-02-21 03:03:39,454 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:03:39,454 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-21 03:03:39,512 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:03:39,527 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:03:39,535 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-21 03:03:39,550 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:39,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:03:39,560 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:39,561 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:03:39,572 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:03:39,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:39,576 INFO L85 PathProgramCache]: Analyzing trace with hash 28699945, now seen corresponding path program 1 times [2022-02-21 03:03:39,583 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:39,590 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941619154] [2022-02-21 03:03:39,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:39,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:39,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:39,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {19#true} assume { :begin_inline_ULTIMATE.init } true; {19#true} is VALID [2022-02-21 03:03:39,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~j~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~N~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := main_~N~0#1; {21#(<= |ULTIMATE.start_main_~i~0#1| 2147483647)} is VALID [2022-02-21 03:03:39,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#(<= |ULTIMATE.start_main_~i~0#1| 2147483647)} assume !!(main_~i~0#1 > 0); {21#(<= |ULTIMATE.start_main_~i~0#1| 2147483647)} is VALID [2022-02-21 03:03:39,742 INFO L290 TraceCheckUtils]: 3: Hoare triple {21#(<= |ULTIMATE.start_main_~i~0#1| 2147483647)} assume !(main_~j~0#1 > 0);main_~j~0#1 := main_~N~0#1; {21#(<= |ULTIMATE.start_main_~i~0#1| 2147483647)} is VALID [2022-02-21 03:03:39,743 INFO L290 TraceCheckUtils]: 4: Hoare triple {21#(<= |ULTIMATE.start_main_~i~0#1| 2147483647)} assume !(main_~i~0#1 - 1 <= 2147483647); {20#false} is VALID [2022-02-21 03:03:39,744 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:03:39,744 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:39,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941619154] [2022-02-21 03:03:39,745 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941619154] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:39,745 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:39,745 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:39,746 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011542091] [2022-02-21 03:03:39,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:39,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:03:39,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:39,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:39,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:39,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:39,766 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:39,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:39,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:39,782 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:39,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:39,826 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-02-21 03:03:39,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:39,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:03:39,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:39,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:39,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-02-21 03:03:39,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:39,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-02-21 03:03:39,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 21 transitions. [2022-02-21 03:03:39,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:39,861 INFO L225 Difference]: With dead ends: 20 [2022-02-21 03:03:39,861 INFO L226 Difference]: Without dead ends: 11 [2022-02-21 03:03:39,863 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:03:39,866 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:39,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 12 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:39,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-02-21 03:03:39,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-02-21 03:03:39,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:39,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand has 11 states, 8 states have (on average 1.5) internal successors, (12), 10 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:03:39,887 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand has 11 states, 8 states have (on average 1.5) internal successors, (12), 10 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:03:39,887 INFO L87 Difference]: Start difference. First operand 11 states. Second operand has 11 states, 8 states have (on average 1.5) internal successors, (12), 10 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:03:39,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:39,889 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-02-21 03:03:39,889 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-02-21 03:03:39,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:39,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:39,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 8 states have (on average 1.5) internal successors, (12), 10 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) Second operand 11 states. [2022-02-21 03:03:39,890 INFO L87 Difference]: Start difference. First operand has 11 states, 8 states have (on average 1.5) internal successors, (12), 10 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) Second operand 11 states. [2022-02-21 03:03:39,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:39,891 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-02-21 03:03:39,891 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-02-21 03:03:39,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:39,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:39,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:39,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:39,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 1.5) internal successors, (12), 10 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:03:39,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-02-21 03:03:39,894 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 5 [2022-02-21 03:03:39,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:39,894 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-02-21 03:03:39,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:39,894 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-02-21 03:03:39,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:03:39,895 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:39,895 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:03:39,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:03:39,896 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:03:39,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:39,896 INFO L85 PathProgramCache]: Analyzing trace with hash 28699753, now seen corresponding path program 1 times [2022-02-21 03:03:39,897 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:39,897 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505265094] [2022-02-21 03:03:39,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:39,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:39,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {81#true} assume { :begin_inline_ULTIMATE.init } true; {81#true} is VALID [2022-02-21 03:03:39,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {81#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~j~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~N~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := main_~N~0#1; {83#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} is VALID [2022-02-21 03:03:39,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {83#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} assume !!(main_~i~0#1 > 0); {83#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} is VALID [2022-02-21 03:03:39,919 INFO L290 TraceCheckUtils]: 3: Hoare triple {83#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} assume main_~j~0#1 > 0; {83#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} is VALID [2022-02-21 03:03:39,920 INFO L290 TraceCheckUtils]: 4: Hoare triple {83#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} assume !(main_~j~0#1 - 1 <= 2147483647); {82#false} is VALID [2022-02-21 03:03:39,920 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:03:39,920 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:39,920 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505265094] [2022-02-21 03:03:39,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505265094] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:39,921 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:39,921 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:39,921 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276742449] [2022-02-21 03:03:39,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:39,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:03:39,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:39,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:39,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:39,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:39,928 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:39,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:39,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:39,929 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:39,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:39,969 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-21 03:03:39,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:39,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:03:39,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:39,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:39,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2022-02-21 03:03:39,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:39,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2022-02-21 03:03:39,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 19 transitions. [2022-02-21 03:03:40,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:40,006 INFO L225 Difference]: With dead ends: 16 [2022-02-21 03:03:40,006 INFO L226 Difference]: Without dead ends: 15 [2022-02-21 03:03:40,006 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:03:40,011 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:40,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 12 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:40,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-21 03:03:40,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-21 03:03:40,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:40,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:40,021 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:40,021 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:40,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:40,022 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2022-02-21 03:03:40,022 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2022-02-21 03:03:40,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:40,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:40,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states. [2022-02-21 03:03:40,023 INFO L87 Difference]: Start difference. First operand has 15 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states. [2022-02-21 03:03:40,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:40,024 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2022-02-21 03:03:40,024 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2022-02-21 03:03:40,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:40,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:40,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:40,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:40,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:40,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2022-02-21 03:03:40,026 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 5 [2022-02-21 03:03:40,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:40,026 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-02-21 03:03:40,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:40,027 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2022-02-21 03:03:40,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:03:40,027 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:40,027 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:03:40,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:03:40,028 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:03:40,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:40,029 INFO L85 PathProgramCache]: Analyzing trace with hash 889698349, now seen corresponding path program 1 times [2022-02-21 03:03:40,029 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:40,029 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120237565] [2022-02-21 03:03:40,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:40,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:40,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#true} assume { :begin_inline_ULTIMATE.init } true; {151#true} is VALID [2022-02-21 03:03:40,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~j~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~N~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := main_~N~0#1; {151#true} is VALID [2022-02-21 03:03:40,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {151#true} assume !!(main_~i~0#1 > 0); {153#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:03:40,051 INFO L290 TraceCheckUtils]: 3: Hoare triple {153#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~j~0#1 > 0);main_~j~0#1 := main_~N~0#1; {153#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:03:40,052 INFO L290 TraceCheckUtils]: 4: Hoare triple {153#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume main_~i~0#1 - 1 <= 2147483647; {153#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:03:40,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {153#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 - 1 >= -2147483648); {152#false} is VALID [2022-02-21 03:03:40,052 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:03:40,053 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:40,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120237565] [2022-02-21 03:03:40,053 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120237565] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:40,053 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:40,053 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:40,053 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278830017] [2022-02-21 03:03:40,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:40,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:03:40,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:40,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:03:40,059 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:03:40,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:40,060 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:40,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:40,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:40,061 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:03:40,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:40,104 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-21 03:03:40,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:40,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:03:40,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:40,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:03:40,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2022-02-21 03:03:40,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:03:40,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2022-02-21 03:03:40,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 13 transitions. [2022-02-21 03:03:40,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:40,120 INFO L225 Difference]: With dead ends: 17 [2022-02-21 03:03:40,120 INFO L226 Difference]: Without dead ends: 16 [2022-02-21 03:03:40,121 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:03:40,122 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 5 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:40,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 10 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:40,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-21 03:03:40,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2022-02-21 03:03:40,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:40,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 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:03:40,133 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 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:03:40,133 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 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:03:40,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:40,135 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-21 03:03:40,135 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-21 03:03:40,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:40,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:40,136 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 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 16 states. [2022-02-21 03:03:40,137 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 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 16 states. [2022-02-21 03:03:40,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:40,138 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-21 03:03:40,138 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-21 03:03:40,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:40,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:40,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:40,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:40,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 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:03:40,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2022-02-21 03:03:40,139 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 6 [2022-02-21 03:03:40,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:40,140 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2022-02-21 03:03:40,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:03:40,140 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2022-02-21 03:03:40,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:03:40,140 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:40,140 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:03:40,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:03:40,141 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:03:40,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:40,141 INFO L85 PathProgramCache]: Analyzing trace with hash 889692391, now seen corresponding path program 1 times [2022-02-21 03:03:40,141 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:40,141 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417983580] [2022-02-21 03:03:40,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:40,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:40,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {225#true} assume { :begin_inline_ULTIMATE.init } true; {225#true} is VALID [2022-02-21 03:03:40,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {225#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~j~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~N~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := main_~N~0#1; {225#true} is VALID [2022-02-21 03:03:40,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {225#true} assume !!(main_~i~0#1 > 0); {225#true} is VALID [2022-02-21 03:03:40,161 INFO L290 TraceCheckUtils]: 3: Hoare triple {225#true} assume main_~j~0#1 > 0; {227#(<= 1 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:03:40,161 INFO L290 TraceCheckUtils]: 4: Hoare triple {227#(<= 1 |ULTIMATE.start_main_~j~0#1|)} assume main_~j~0#1 - 1 <= 2147483647; {227#(<= 1 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:03:40,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {227#(<= 1 |ULTIMATE.start_main_~j~0#1|)} assume !(main_~j~0#1 - 1 >= -2147483648); {226#false} is VALID [2022-02-21 03:03:40,162 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:03:40,162 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:40,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417983580] [2022-02-21 03:03:40,162 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417983580] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:40,162 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:40,162 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:40,162 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790796311] [2022-02-21 03:03:40,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:40,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:03:40,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:40,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:03:40,168 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:03:40,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:40,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:40,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:40,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:40,179 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:03:40,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:40,196 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2022-02-21 03:03:40,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:40,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:03:40,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:40,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:03:40,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-21 03:03:40,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:03:40,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-21 03:03:40,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2022-02-21 03:03:40,205 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:03:40,206 INFO L225 Difference]: With dead ends: 14 [2022-02-21 03:03:40,206 INFO L226 Difference]: Without dead ends: 13 [2022-02-21 03:03:40,206 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:03:40,207 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:40,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 11 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:40,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-02-21 03:03:40,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-21 03:03:40,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:40,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:40,212 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:40,213 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:40,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:40,213 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-02-21 03:03:40,213 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-21 03:03:40,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:40,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:40,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states. [2022-02-21 03:03:40,214 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states. [2022-02-21 03:03:40,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:40,215 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-02-21 03:03:40,215 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-21 03:03:40,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:40,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:40,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:40,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:40,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:40,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-02-21 03:03:40,216 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 6 [2022-02-21 03:03:40,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:40,216 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-02-21 03:03:40,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:03:40,216 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-21 03:03:40,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:03:40,217 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:40,217 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:40,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:03:40,217 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:03:40,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:40,218 INFO L85 PathProgramCache]: Analyzing trace with hash 760372254, now seen corresponding path program 1 times [2022-02-21 03:03:40,218 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:40,218 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882294384] [2022-02-21 03:03:40,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:40,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:40,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {287#true} assume { :begin_inline_ULTIMATE.init } true; {287#true} is VALID [2022-02-21 03:03:40,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {287#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~j~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~N~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := main_~N~0#1; {289#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:40,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {289#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume !!(main_~i~0#1 > 0); {289#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:40,248 INFO L290 TraceCheckUtils]: 3: Hoare triple {289#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume !(main_~j~0#1 > 0);main_~j~0#1 := main_~N~0#1; {290#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} is VALID [2022-02-21 03:03:40,248 INFO L290 TraceCheckUtils]: 4: Hoare triple {290#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} assume main_~i~0#1 - 1 <= 2147483647; {290#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} is VALID [2022-02-21 03:03:40,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {290#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} assume main_~i~0#1 - 1 >= -2147483648;main_~i~0#1 := main_~i~0#1 - 1; {290#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} is VALID [2022-02-21 03:03:40,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {290#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} assume !!(main_~i~0#1 > 0); {290#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} is VALID [2022-02-21 03:03:40,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {290#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} assume main_~j~0#1 > 0; {290#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} is VALID [2022-02-21 03:03:40,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {290#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} assume !(main_~j~0#1 - 1 <= 2147483647); {288#false} is VALID [2022-02-21 03:03:40,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:40,250 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:40,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882294384] [2022-02-21 03:03:40,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882294384] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:40,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341275257] [2022-02-21 03:03:40,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:40,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:40,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:40,253 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:03:40,254 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:03:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:40,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:03:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:40,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:40,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {287#true} assume { :begin_inline_ULTIMATE.init } true; {287#true} is VALID [2022-02-21 03:03:40,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {287#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~j~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~N~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := main_~N~0#1; {289#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:40,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {289#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume !!(main_~i~0#1 > 0); {289#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:40,393 INFO L290 TraceCheckUtils]: 3: Hoare triple {289#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume !(main_~j~0#1 > 0);main_~j~0#1 := main_~N~0#1; {290#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} is VALID [2022-02-21 03:03:40,393 INFO L290 TraceCheckUtils]: 4: Hoare triple {290#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} assume main_~i~0#1 - 1 <= 2147483647; {290#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} is VALID [2022-02-21 03:03:40,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {290#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} assume main_~i~0#1 - 1 >= -2147483648;main_~i~0#1 := main_~i~0#1 - 1; {290#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} is VALID [2022-02-21 03:03:40,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {290#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} assume !!(main_~i~0#1 > 0); {290#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} is VALID [2022-02-21 03:03:40,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {290#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} assume main_~j~0#1 > 0; {290#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} is VALID [2022-02-21 03:03:40,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {290#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} assume !(main_~j~0#1 - 1 <= 2147483647); {288#false} is VALID [2022-02-21 03:03:40,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:40,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:40,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {318#(<= |ULTIMATE.start_main_~j~0#1| 2147483648)} assume !(main_~j~0#1 - 1 <= 2147483647); {288#false} is VALID [2022-02-21 03:03:40,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {318#(<= |ULTIMATE.start_main_~j~0#1| 2147483648)} assume main_~j~0#1 > 0; {318#(<= |ULTIMATE.start_main_~j~0#1| 2147483648)} is VALID [2022-02-21 03:03:40,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {318#(<= |ULTIMATE.start_main_~j~0#1| 2147483648)} assume !!(main_~i~0#1 > 0); {318#(<= |ULTIMATE.start_main_~j~0#1| 2147483648)} is VALID [2022-02-21 03:03:40,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {318#(<= |ULTIMATE.start_main_~j~0#1| 2147483648)} assume main_~i~0#1 - 1 >= -2147483648;main_~i~0#1 := main_~i~0#1 - 1; {318#(<= |ULTIMATE.start_main_~j~0#1| 2147483648)} is VALID [2022-02-21 03:03:40,460 INFO L290 TraceCheckUtils]: 4: Hoare triple {318#(<= |ULTIMATE.start_main_~j~0#1| 2147483648)} assume main_~i~0#1 - 1 <= 2147483647; {318#(<= |ULTIMATE.start_main_~j~0#1| 2147483648)} is VALID [2022-02-21 03:03:40,461 INFO L290 TraceCheckUtils]: 3: Hoare triple {334#(<= |ULTIMATE.start_main_~N~0#1| 2147483648)} assume !(main_~j~0#1 > 0);main_~j~0#1 := main_~N~0#1; {318#(<= |ULTIMATE.start_main_~j~0#1| 2147483648)} is VALID [2022-02-21 03:03:40,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {334#(<= |ULTIMATE.start_main_~N~0#1| 2147483648)} assume !!(main_~i~0#1 > 0); {334#(<= |ULTIMATE.start_main_~N~0#1| 2147483648)} is VALID [2022-02-21 03:03:40,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {287#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~j~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~N~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := main_~N~0#1; {334#(<= |ULTIMATE.start_main_~N~0#1| 2147483648)} is VALID [2022-02-21 03:03:40,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {287#true} assume { :begin_inline_ULTIMATE.init } true; {287#true} is VALID [2022-02-21 03:03:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:40,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341275257] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:40,463 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:40,463 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-21 03:03:40,464 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426682818] [2022-02-21 03:03:40,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:40,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:03:40,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:40,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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:03:40,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:40,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:03:40,475 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:40,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:03:40,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:03:40,476 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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:03:40,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:40,507 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-02-21 03:03:40,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:40,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:03:40,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:40,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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:03:40,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2022-02-21 03:03:40,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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:03:40,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2022-02-21 03:03:40,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 10 transitions. [2022-02-21 03:03:40,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:40,517 INFO L225 Difference]: With dead ends: 13 [2022-02-21 03:03:40,517 INFO L226 Difference]: Without dead ends: 0 [2022-02-21 03:03:40,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:03:40,518 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 5 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:40,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 9 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:40,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-21 03:03:40,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-21 03:03:40,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:40,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:40,519 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:40,520 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:40,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:40,520 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:03:40,520 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:03:40,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:40,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:40,520 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-21 03:03:40,520 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-21 03:03:40,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:40,521 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:03:40,521 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:03:40,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:40,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:40,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:40,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:40,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:40,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 03:03:40,522 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2022-02-21 03:03:40,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:40,522 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:03:40,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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:03:40,522 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:03:40,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:40,524 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-02-21 03:03:40,525 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-02-21 03:03:40,525 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-02-21 03:03:40,525 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-02-21 03:03:40,545 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:03:40,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:40,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-21 03:03:40,776 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-02-21 03:03:40,776 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-21 03:03:40,776 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2022-02-21 03:03:40,776 INFO L858 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2022-02-21 03:03:40,776 INFO L858 garLoopResultBuilder]: For program point L23-1(line 23) no Hoare annotation was computed. [2022-02-21 03:03:40,776 INFO L858 garLoopResultBuilder]: For program point L19(lines 19 24) no Hoare annotation was computed. [2022-02-21 03:03:40,777 INFO L854 garLoopResultBuilder]: At program point L19-2(lines 18 25) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~i~0#1| 2147483647) (<= |ULTIMATE.start_main_~j~0#1| 2147483647) (<= |ULTIMATE.start_main_~N~0#1| 2147483647)) [2022-02-21 03:03:40,777 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-21 03:03:40,777 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-02-21 03:03:40,777 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2022-02-21 03:03:40,777 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-21 03:03:40,777 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-21 03:03:40,777 INFO L854 garLoopResultBuilder]: At program point L26(lines 13 27) the Hoare annotation is: (<= |ULTIMATE.start_main_~i~0#1| 2147483647) [2022-02-21 03:03:40,777 INFO L858 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-02-21 03:03:40,777 INFO L858 garLoopResultBuilder]: For program point L20-1(line 20) no Hoare annotation was computed. [2022-02-21 03:03:40,777 INFO L858 garLoopResultBuilder]: For program point L18-2(lines 18 25) no Hoare annotation was computed. [2022-02-21 03:03:40,779 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-21 03:03:40,780 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:03:40,782 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-21 03:03:40,782 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-21 03:03:40,782 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-21 03:03:40,782 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-21 03:03:40,782 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-21 03:03:40,782 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-21 03:03:40,782 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-21 03:03:40,782 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-21 03:03:40,782 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:03:40,782 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-21 03:03:40,782 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-21 03:03:40,782 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-21 03:03:40,783 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-21 03:03:40,783 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:03:40,783 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-21 03:03:40,783 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-21 03:03:40,783 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-21 03:03:40,783 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-21 03:03:40,783 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:03:40,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 03:03:40 BoogieIcfgContainer [2022-02-21 03:03:40,788 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 03:03:40,789 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:03:40,789 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:03:40,789 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:03:40,789 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:03:39" (3/4) ... [2022-02-21 03:03:40,791 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-21 03:03:40,797 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-21 03:03:40,797 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-02-21 03:03:40,797 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-21 03:03:40,814 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:03:40,814 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:03:40,815 INFO L158 Benchmark]: Toolchain (without parser) took 1890.23ms. Allocated memory was 94.4MB in the beginning and 151.0MB in the end (delta: 56.6MB). Free memory was 66.0MB in the beginning and 105.4MB in the end (delta: -39.4MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2022-02-21 03:03:40,815 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 94.4MB. Free memory is still 51.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:03:40,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.94ms. Allocated memory is still 94.4MB. Free memory was 65.8MB in the beginning and 71.4MB in the end (delta: -5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:03:40,816 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.50ms. Allocated memory is still 94.4MB. Free memory was 71.4MB in the beginning and 69.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:03:40,816 INFO L158 Benchmark]: Boogie Preprocessor took 22.21ms. Allocated memory is still 94.4MB. Free memory was 69.9MB in the beginning and 68.9MB in the end (delta: 945.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:03:40,816 INFO L158 Benchmark]: RCFGBuilder took 282.43ms. Allocated memory is still 94.4MB. Free memory was 68.9MB in the beginning and 59.4MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:03:40,816 INFO L158 Benchmark]: TraceAbstraction took 1342.54ms. Allocated memory was 94.4MB in the beginning and 151.0MB in the end (delta: 56.6MB). Free memory was 58.8MB in the beginning and 107.5MB in the end (delta: -48.7MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2022-02-21 03:03:40,816 INFO L158 Benchmark]: Witness Printer took 25.65ms. Allocated memory is still 151.0MB. Free memory was 107.5MB in the beginning and 105.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:03:40,817 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 94.4MB. Free memory is still 51.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 175.94ms. Allocated memory is still 94.4MB. Free memory was 65.8MB in the beginning and 71.4MB in the end (delta: -5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.50ms. Allocated memory is still 94.4MB. Free memory was 71.4MB in the beginning and 69.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.21ms. Allocated memory is still 94.4MB. Free memory was 69.9MB in the beginning and 68.9MB in the end (delta: 945.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 282.43ms. Allocated memory is still 94.4MB. Free memory was 68.9MB in the beginning and 59.4MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1342.54ms. Allocated memory was 94.4MB in the beginning and 151.0MB in the end (delta: 56.6MB). Free memory was 58.8MB in the beginning and 107.5MB in the end (delta: -48.7MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Witness Printer took 25.65ms. Allocated memory is still 151.0MB. Free memory was 107.5MB in the beginning and 105.4MB 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 - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30 IncrementalHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 39 mSDtfsCounter, 30 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 15, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 13 HoareAnnotationTreeSize, 2 FomulaSimplifications, 8 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 26 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 106 SizeOfPredicates, 1 NumberOfNonLiveVariables, 20 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 0/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (i <= 2147483647 && j <= 2147483647) && N <= 2147483647 - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: i <= 2147483647 RESULT: Ultimate proved your program to be correct! [2022-02-21 03:03:40,855 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 Result: TRUE