./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/MutualRecursion_1a.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/MutualRecursion_1a.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 727b654585befeb7272249307a5de272b17c4e2d2d1afa67fd11f4eb185d7508 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:02:28,077 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:02:28,079 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:02:28,115 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:02:28,115 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:02:28,118 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:02:28,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:02:28,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:02:28,122 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:02:28,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:02:28,126 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:02:28,127 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:02:28,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:02:28,129 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:02:28,130 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:02:28,132 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:02:28,133 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:02:28,134 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:02:28,135 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:02:28,139 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:02:28,140 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:02:28,141 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:02:28,142 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:02:28,143 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:02:28,147 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:02:28,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:02:28,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:02:28,149 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:02:28,149 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:02:28,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:02:28,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:02:28,150 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:02:28,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:02:28,152 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:02:28,153 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:02:28,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:02:28,155 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:02:28,155 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:02:28,155 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:02:28,156 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:02:28,156 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:02:28,157 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:02:28,181 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:02:28,181 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:02:28,182 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:02:28,182 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:02:28,183 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:02:28,183 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:02:28,184 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:02:28,184 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:02:28,184 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:02:28,184 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:02:28,185 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:02:28,185 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:02:28,185 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:02:28,185 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:02:28,185 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:02:28,185 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:02:28,185 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:02:28,186 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:02:28,186 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:02:28,186 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:02:28,186 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:02:28,186 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:02:28,186 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:02:28,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:02:28,187 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:02:28,187 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:02:28,187 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:02:28,187 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:02:28,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:02:28,187 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:02:28,188 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 -> 727b654585befeb7272249307a5de272b17c4e2d2d1afa67fd11f4eb185d7508 [2022-02-21 03:02:28,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:02:28,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:02:28,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:02:28,432 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:02:28,432 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:02:28,433 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/MutualRecursion_1a.c [2022-02-21 03:02:28,490 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5dcf05e7/dd31e591c7e84c80b16d95a9cce73108/FLAG9917856d4 [2022-02-21 03:02:28,870 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:02:28,870 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/MutualRecursion_1a.c [2022-02-21 03:02:28,875 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5dcf05e7/dd31e591c7e84c80b16d95a9cce73108/FLAG9917856d4 [2022-02-21 03:02:28,883 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5dcf05e7/dd31e591c7e84c80b16d95a9cce73108 [2022-02-21 03:02:28,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:02:28,886 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:02:28,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:02:28,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:02:28,889 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:02:28,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:02:28" (1/1) ... [2022-02-21 03:02:28,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d51349c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:28, skipping insertion in model container [2022-02-21 03:02:28,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:02:28" (1/1) ... [2022-02-21 03:02:28,896 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:02:28,905 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:02:29,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:02:29,033 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:02:29,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:02:29,056 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:02:29,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:29 WrapperNode [2022-02-21 03:02:29,056 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:02:29,057 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:02:29,057 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:02:29,058 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:02:29,064 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:02:29" (1/1) ... [2022-02-21 03:02:29,067 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:02:29" (1/1) ... [2022-02-21 03:02:29,080 INFO L137 Inliner]: procedures = 6, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 8 [2022-02-21 03:02:29,081 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:02:29,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:02:29,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:02:29,082 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:02:29,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:29" (1/1) ... [2022-02-21 03:02:29,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:29" (1/1) ... [2022-02-21 03:02:29,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:29" (1/1) ... [2022-02-21 03:02:29,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:29" (1/1) ... [2022-02-21 03:02:29,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:29" (1/1) ... [2022-02-21 03:02:29,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:29" (1/1) ... [2022-02-21 03:02:29,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:29" (1/1) ... [2022-02-21 03:02:29,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:02:29,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:02:29,099 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:02:29,099 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:02:29,100 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:29" (1/1) ... [2022-02-21 03:02:29,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:02:29,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:29,181 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:02:29,200 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:02:29,228 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-02-21 03:02:29,228 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-02-21 03:02:29,228 INFO L130 BoogieDeclarations]: Found specification of procedure g [2022-02-21 03:02:29,229 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2022-02-21 03:02:29,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:02:29,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:02:29,268 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:02:29,269 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:02:29,463 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:02:29,469 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:02:29,469 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 03:02:29,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:02:29 BoogieIcfgContainer [2022-02-21 03:02:29,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:02:29,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:02:29,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:02:29,474 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:02:29,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:02:28" (1/3) ... [2022-02-21 03:02:29,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45416195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:02:29, skipping insertion in model container [2022-02-21 03:02:29,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:29" (2/3) ... [2022-02-21 03:02:29,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45416195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:02:29, skipping insertion in model container [2022-02-21 03:02:29,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:02:29" (3/3) ... [2022-02-21 03:02:29,476 INFO L111 eAbstractionObserver]: Analyzing ICFG MutualRecursion_1a.c [2022-02-21 03:02:29,482 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:02:29,482 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-02-21 03:02:29,540 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:02:29,544 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:02:29,545 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-02-21 03:02:29,567 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.48) internal successors, (37), 35 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:02:29,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:02:29,578 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:29,579 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:02:29,579 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2022-02-21 03:02:29,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:29,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2073143902, now seen corresponding path program 1 times [2022-02-21 03:02:29,590 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:29,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780267306] [2022-02-21 03:02:29,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:29,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:29,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#true} assume { :begin_inline_ULTIMATE.init } true; {46#true} is VALID [2022-02-21 03:02:29,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {48#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:02:29,783 INFO L272 TraceCheckUtils]: 2: Hoare triple {48#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} call main_#t~ret5#1 := g(main_~x~0#1); {49#(<= |g_#in~x| 2147483647)} is VALID [2022-02-21 03:02:29,785 INFO L290 TraceCheckUtils]: 3: Hoare triple {49#(<= |g_#in~x| 2147483647)} ~x := #in~x; {50#(<= g_~x 2147483647)} is VALID [2022-02-21 03:02:29,786 INFO L290 TraceCheckUtils]: 4: Hoare triple {50#(<= g_~x 2147483647)} assume !(~x <= 0); {50#(<= g_~x 2147483647)} is VALID [2022-02-21 03:02:29,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {50#(<= g_~x 2147483647)} assume !(~x - 1 <= 2147483647); {47#false} is VALID [2022-02-21 03:02:29,788 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:02:29,789 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:29,789 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780267306] [2022-02-21 03:02:29,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780267306] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:29,791 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:29,792 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:02:29,795 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958364178] [2022-02-21 03:02:29,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:29,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:02:29,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:29,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:29,812 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:02:29,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:02:29,814 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:29,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:02:29,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:02:29,833 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.48) internal successors, (37), 35 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:30,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:30,072 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-02-21 03:02:30,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:02:30,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:02:30,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:30,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:30,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-02-21 03:02:30,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:30,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-02-21 03:02:30,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2022-02-21 03:02:30,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:30,151 INFO L225 Difference]: With dead ends: 65 [2022-02-21 03:02:30,152 INFO L226 Difference]: Without dead ends: 57 [2022-02-21 03:02:30,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:02:30,157 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 34 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:30,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 151 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:30,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-21 03:02:30,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-02-21 03:02:30,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:30,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 51 states, 32 states have (on average 1.46875) internal successors, (47), 41 states have internal predecessors, (47), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:02:30,184 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 51 states, 32 states have (on average 1.46875) internal successors, (47), 41 states have internal predecessors, (47), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:02:30,184 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 51 states, 32 states have (on average 1.46875) internal successors, (47), 41 states have internal predecessors, (47), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:02:30,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:30,189 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-02-21 03:02:30,189 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-02-21 03:02:30,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:30,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:30,191 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 32 states have (on average 1.46875) internal successors, (47), 41 states have internal predecessors, (47), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 57 states. [2022-02-21 03:02:30,191 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.46875) internal successors, (47), 41 states have internal predecessors, (47), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 57 states. [2022-02-21 03:02:30,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:30,195 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-02-21 03:02:30,195 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-02-21 03:02:30,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:30,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:30,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:30,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:30,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.46875) internal successors, (47), 41 states have internal predecessors, (47), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:02:30,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2022-02-21 03:02:30,214 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 6 [2022-02-21 03:02:30,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:30,214 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-02-21 03:02:30,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:30,214 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-02-21 03:02:30,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 03:02:30,215 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:30,215 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:30,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:02:30,216 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2022-02-21 03:02:30,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:30,216 INFO L85 PathProgramCache]: Analyzing trace with hash -157048422, now seen corresponding path program 1 times [2022-02-21 03:02:30,216 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:30,217 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739318804] [2022-02-21 03:02:30,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:30,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:30,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {305#true} assume { :begin_inline_ULTIMATE.init } true; {305#true} is VALID [2022-02-21 03:02:30,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {305#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {305#true} is VALID [2022-02-21 03:02:30,234 INFO L272 TraceCheckUtils]: 2: Hoare triple {305#true} call main_#t~ret5#1 := g(main_~x~0#1); {305#true} is VALID [2022-02-21 03:02:30,234 INFO L290 TraceCheckUtils]: 3: Hoare triple {305#true} ~x := #in~x; {305#true} is VALID [2022-02-21 03:02:30,235 INFO L290 TraceCheckUtils]: 4: Hoare triple {305#true} assume !(~x <= 0); {307#(<= 1 g_~x)} is VALID [2022-02-21 03:02:30,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {307#(<= 1 g_~x)} assume ~x - 1 <= 2147483647; {307#(<= 1 g_~x)} is VALID [2022-02-21 03:02:30,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {307#(<= 1 g_~x)} assume !(~x - 1 >= -2147483648); {306#false} is VALID [2022-02-21 03:02:30,236 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:02:30,236 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:30,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739318804] [2022-02-21 03:02:30,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739318804] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:30,237 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:30,237 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:02:30,237 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137574181] [2022-02-21 03:02:30,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:30,238 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-21 03:02:30,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:30,238 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:30,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:30,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:02:30,244 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:30,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:02:30,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:02:30,245 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:30,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:30,306 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-02-21 03:02:30,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:02:30,307 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-21 03:02:30,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:30,307 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:30,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-02-21 03:02:30,311 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:30,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-02-21 03:02:30,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-02-21 03:02:30,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:30,349 INFO L225 Difference]: With dead ends: 53 [2022-02-21 03:02:30,350 INFO L226 Difference]: Without dead ends: 51 [2022-02-21 03:02:30,350 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:02:30,356 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:30,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 64 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:30,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-21 03:02:30,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2022-02-21 03:02:30,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:30,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 49 states, 32 states have (on average 1.34375) internal successors, (43), 39 states have internal predecessors, (43), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:02:30,379 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 49 states, 32 states have (on average 1.34375) internal successors, (43), 39 states have internal predecessors, (43), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:02:30,380 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 49 states, 32 states have (on average 1.34375) internal successors, (43), 39 states have internal predecessors, (43), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:02:30,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:30,384 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-02-21 03:02:30,384 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-02-21 03:02:30,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:30,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:30,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 32 states have (on average 1.34375) internal successors, (43), 39 states have internal predecessors, (43), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 51 states. [2022-02-21 03:02:30,385 INFO L87 Difference]: Start difference. First operand has 49 states, 32 states have (on average 1.34375) internal successors, (43), 39 states have internal predecessors, (43), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 51 states. [2022-02-21 03:02:30,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:30,403 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-02-21 03:02:30,403 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-02-21 03:02:30,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:30,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:30,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:30,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:30,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.34375) internal successors, (43), 39 states have internal predecessors, (43), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:02:30,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-02-21 03:02:30,410 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 7 [2022-02-21 03:02:30,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:30,410 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-02-21 03:02:30,410 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:30,411 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-02-21 03:02:30,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-21 03:02:30,413 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:30,413 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:30,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:02:30,414 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2022-02-21 03:02:30,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:30,414 INFO L85 PathProgramCache]: Analyzing trace with hash 496888160, now seen corresponding path program 1 times [2022-02-21 03:02:30,414 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:30,415 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198872422] [2022-02-21 03:02:30,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:30,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:30,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {534#true} assume { :begin_inline_ULTIMATE.init } true; {534#true} is VALID [2022-02-21 03:02:30,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {534#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {536#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:02:30,506 INFO L272 TraceCheckUtils]: 2: Hoare triple {536#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} call main_#t~ret5#1 := g(main_~x~0#1); {537#(<= |g_#in~x| 2147483647)} is VALID [2022-02-21 03:02:30,506 INFO L290 TraceCheckUtils]: 3: Hoare triple {537#(<= |g_#in~x| 2147483647)} ~x := #in~x; {538#(<= g_~x 2147483647)} is VALID [2022-02-21 03:02:30,507 INFO L290 TraceCheckUtils]: 4: Hoare triple {538#(<= g_~x 2147483647)} assume !(~x <= 0); {538#(<= g_~x 2147483647)} is VALID [2022-02-21 03:02:30,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#(<= g_~x 2147483647)} assume ~x - 1 <= 2147483647; {538#(<= g_~x 2147483647)} is VALID [2022-02-21 03:02:30,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {538#(<= g_~x 2147483647)} assume ~x - 1 >= -2147483648; {538#(<= g_~x 2147483647)} is VALID [2022-02-21 03:02:30,512 INFO L272 TraceCheckUtils]: 7: Hoare triple {538#(<= g_~x 2147483647)} call #t~ret2 := f(~x - 1); {539#(<= |f_#in~x| 2147483646)} is VALID [2022-02-21 03:02:30,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {539#(<= |f_#in~x| 2147483646)} ~x := #in~x; {540#(<= f_~x 2147483646)} is VALID [2022-02-21 03:02:30,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {540#(<= f_~x 2147483646)} assume !(~x <= 0); {540#(<= f_~x 2147483646)} is VALID [2022-02-21 03:02:30,514 INFO L272 TraceCheckUtils]: 10: Hoare triple {540#(<= f_~x 2147483646)} call #t~ret0 := g(~x); {541#(<= |g_#in~x| 2147483646)} is VALID [2022-02-21 03:02:30,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {541#(<= |g_#in~x| 2147483646)} ~x := #in~x; {542#(<= g_~x 2147483646)} is VALID [2022-02-21 03:02:30,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {542#(<= g_~x 2147483646)} assume !(~x <= 0); {542#(<= g_~x 2147483646)} is VALID [2022-02-21 03:02:30,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {542#(<= g_~x 2147483646)} assume !(~x - 1 <= 2147483647); {535#false} is VALID [2022-02-21 03:02:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:30,516 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:30,516 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198872422] [2022-02-21 03:02:30,516 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198872422] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:30,516 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:30,516 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-21 03:02:30,517 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420978995] [2022-02-21 03:02:30,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:30,517 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-21 03:02:30,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:30,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:30,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:30,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-21 03:02:30,526 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:30,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 03:02:30,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:02:30,527 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:30,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:30,901 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-02-21 03:02:30,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:02:30,901 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-21 03:02:30,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:30,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:30,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2022-02-21 03:02:30,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:30,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2022-02-21 03:02:30,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 63 transitions. [2022-02-21 03:02:30,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:30,960 INFO L225 Difference]: With dead ends: 67 [2022-02-21 03:02:30,961 INFO L226 Difference]: Without dead ends: 64 [2022-02-21 03:02:30,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:02:30,967 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 81 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:30,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 140 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:02:30,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-21 03:02:30,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2022-02-21 03:02:30,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:30,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 60 states, 43 states have (on average 1.255813953488372) internal successors, (54), 47 states have internal predecessors, (54), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:02:30,987 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 60 states, 43 states have (on average 1.255813953488372) internal successors, (54), 47 states have internal predecessors, (54), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:02:30,987 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 60 states, 43 states have (on average 1.255813953488372) internal successors, (54), 47 states have internal predecessors, (54), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:02:30,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:30,990 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2022-02-21 03:02:30,990 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2022-02-21 03:02:30,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:30,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:30,991 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 43 states have (on average 1.255813953488372) internal successors, (54), 47 states have internal predecessors, (54), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 64 states. [2022-02-21 03:02:30,991 INFO L87 Difference]: Start difference. First operand has 60 states, 43 states have (on average 1.255813953488372) internal successors, (54), 47 states have internal predecessors, (54), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 64 states. [2022-02-21 03:02:30,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:30,993 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2022-02-21 03:02:30,993 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2022-02-21 03:02:30,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:30,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:30,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:30,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:30,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.255813953488372) internal successors, (54), 47 states have internal predecessors, (54), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:02:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2022-02-21 03:02:30,997 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 14 [2022-02-21 03:02:30,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:30,997 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2022-02-21 03:02:30,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:30,997 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-02-21 03:02:30,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-21 03:02:30,998 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:30,998 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:30,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:02:30,998 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2022-02-21 03:02:30,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:30,999 INFO L85 PathProgramCache]: Analyzing trace with hash -552782201, now seen corresponding path program 1 times [2022-02-21 03:02:30,999 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:30,999 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132594098] [2022-02-21 03:02:31,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:31,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:31,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-21 03:02:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:31,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {834#true} ~x := #in~x; {834#true} is VALID [2022-02-21 03:02:31,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {834#true} assume ~x <= 0;#res := 0; {834#true} is VALID [2022-02-21 03:02:31,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {834#true} assume true; {834#true} is VALID [2022-02-21 03:02:31,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {834#true} {836#(<= 1 f_~x)} #49#return; {836#(<= 1 f_~x)} is VALID [2022-02-21 03:02:31,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {834#true} assume { :begin_inline_ULTIMATE.init } true; {834#true} is VALID [2022-02-21 03:02:31,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {834#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {834#true} is VALID [2022-02-21 03:02:31,030 INFO L272 TraceCheckUtils]: 2: Hoare triple {834#true} call main_#t~ret5#1 := g(main_~x~0#1); {834#true} is VALID [2022-02-21 03:02:31,030 INFO L290 TraceCheckUtils]: 3: Hoare triple {834#true} ~x := #in~x; {834#true} is VALID [2022-02-21 03:02:31,031 INFO L290 TraceCheckUtils]: 4: Hoare triple {834#true} assume !(~x <= 0); {834#true} is VALID [2022-02-21 03:02:31,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {834#true} assume ~x - 1 <= 2147483647; {834#true} is VALID [2022-02-21 03:02:31,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {834#true} assume ~x - 1 >= -2147483648; {834#true} is VALID [2022-02-21 03:02:31,031 INFO L272 TraceCheckUtils]: 7: Hoare triple {834#true} call #t~ret2 := f(~x - 1); {834#true} is VALID [2022-02-21 03:02:31,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {834#true} ~x := #in~x; {834#true} is VALID [2022-02-21 03:02:31,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {834#true} assume !(~x <= 0); {836#(<= 1 f_~x)} is VALID [2022-02-21 03:02:31,032 INFO L272 TraceCheckUtils]: 10: Hoare triple {836#(<= 1 f_~x)} call #t~ret0 := g(~x); {834#true} is VALID [2022-02-21 03:02:31,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {834#true} ~x := #in~x; {834#true} is VALID [2022-02-21 03:02:31,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {834#true} assume ~x <= 0;#res := 0; {834#true} is VALID [2022-02-21 03:02:31,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {834#true} assume true; {834#true} is VALID [2022-02-21 03:02:31,038 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {834#true} {836#(<= 1 f_~x)} #49#return; {836#(<= 1 f_~x)} is VALID [2022-02-21 03:02:31,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {836#(<= 1 f_~x)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {836#(<= 1 f_~x)} is VALID [2022-02-21 03:02:31,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {836#(<= 1 f_~x)} assume 1 + ~x <= 2147483647; {836#(<= 1 f_~x)} is VALID [2022-02-21 03:02:31,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {836#(<= 1 f_~x)} assume !(1 + ~x >= -2147483648); {835#false} is VALID [2022-02-21 03:02:31,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:02:31,039 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:31,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132594098] [2022-02-21 03:02:31,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132594098] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:31,040 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:31,040 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:02:31,040 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835432035] [2022-02-21 03:02:31,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:31,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-21 03:02:31,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:31,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:31,049 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:02:31,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:02:31,050 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:31,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:02:31,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:02:31,051 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:31,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:31,098 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2022-02-21 03:02:31,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:02:31,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-21 03:02:31,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:31,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:31,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-02-21 03:02:31,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:31,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-02-21 03:02:31,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 41 transitions. [2022-02-21 03:02:31,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:31,128 INFO L225 Difference]: With dead ends: 62 [2022-02-21 03:02:31,128 INFO L226 Difference]: Without dead ends: 61 [2022-02-21 03:02:31,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:02:31,129 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 7 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:31,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 64 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:31,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-02-21 03:02:31,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-02-21 03:02:31,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:31,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 59 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 46 states have internal predecessors, (53), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:02:31,150 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 59 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 46 states have internal predecessors, (53), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:02:31,150 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 59 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 46 states have internal predecessors, (53), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:02:31,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:31,153 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2022-02-21 03:02:31,153 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2022-02-21 03:02:31,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:31,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:31,154 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 46 states have internal predecessors, (53), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 61 states. [2022-02-21 03:02:31,154 INFO L87 Difference]: Start difference. First operand has 59 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 46 states have internal predecessors, (53), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 61 states. [2022-02-21 03:02:31,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:31,156 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2022-02-21 03:02:31,156 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2022-02-21 03:02:31,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:31,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:31,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:31,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:31,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 46 states have internal predecessors, (53), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:02:31,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2022-02-21 03:02:31,168 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 18 [2022-02-21 03:02:31,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:31,168 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2022-02-21 03:02:31,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:31,169 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2022-02-21 03:02:31,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-21 03:02:31,169 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:31,169 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:31,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:02:31,170 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2022-02-21 03:02:31,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:31,170 INFO L85 PathProgramCache]: Analyzing trace with hash 2114816930, now seen corresponding path program 1 times [2022-02-21 03:02:31,170 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:31,170 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150088186] [2022-02-21 03:02:31,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:31,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:31,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 03:02:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:31,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {1112#true} ~x := #in~x; {1112#true} is VALID [2022-02-21 03:02:31,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {1112#true} assume ~x <= 0;#res := 0; {1124#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:31,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {1124#(<= |f_#res| 0)} assume true; {1124#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:31,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1124#(<= |f_#res| 0)} {1112#true} #53#return; {1118#(<= |g_#t~ret2| 0)} is VALID [2022-02-21 03:02:31,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-21 03:02:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:31,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {1112#true} ~x := #in~x; {1112#true} is VALID [2022-02-21 03:02:31,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {1112#true} assume ~x <= 0;#res := 0; {1124#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:31,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {1124#(<= |f_#res| 0)} assume true; {1124#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:31,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1124#(<= |f_#res| 0)} {1118#(<= |g_#t~ret2| 0)} #55#return; {1123#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} is VALID [2022-02-21 03:02:31,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {1112#true} assume { :begin_inline_ULTIMATE.init } true; {1112#true} is VALID [2022-02-21 03:02:31,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {1112#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1112#true} is VALID [2022-02-21 03:02:31,239 INFO L272 TraceCheckUtils]: 2: Hoare triple {1112#true} call main_#t~ret5#1 := g(main_~x~0#1); {1112#true} is VALID [2022-02-21 03:02:31,239 INFO L290 TraceCheckUtils]: 3: Hoare triple {1112#true} ~x := #in~x; {1112#true} is VALID [2022-02-21 03:02:31,239 INFO L290 TraceCheckUtils]: 4: Hoare triple {1112#true} assume !(~x <= 0); {1112#true} is VALID [2022-02-21 03:02:31,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {1112#true} assume ~x - 1 <= 2147483647; {1112#true} is VALID [2022-02-21 03:02:31,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {1112#true} assume ~x - 1 >= -2147483648; {1112#true} is VALID [2022-02-21 03:02:31,240 INFO L272 TraceCheckUtils]: 7: Hoare triple {1112#true} call #t~ret2 := f(~x - 1); {1112#true} is VALID [2022-02-21 03:02:31,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {1112#true} ~x := #in~x; {1112#true} is VALID [2022-02-21 03:02:31,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {1112#true} assume ~x <= 0;#res := 0; {1124#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:31,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {1124#(<= |f_#res| 0)} assume true; {1124#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:31,242 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1124#(<= |f_#res| 0)} {1112#true} #53#return; {1118#(<= |g_#t~ret2| 0)} is VALID [2022-02-21 03:02:31,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {1118#(<= |g_#t~ret2| 0)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1118#(<= |g_#t~ret2| 0)} is VALID [2022-02-21 03:02:31,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {1118#(<= |g_#t~ret2| 0)} assume ~x - 2 <= 2147483647; {1118#(<= |g_#t~ret2| 0)} is VALID [2022-02-21 03:02:31,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {1118#(<= |g_#t~ret2| 0)} assume ~x - 2 >= -2147483648; {1118#(<= |g_#t~ret2| 0)} is VALID [2022-02-21 03:02:31,243 INFO L272 TraceCheckUtils]: 15: Hoare triple {1118#(<= |g_#t~ret2| 0)} call #t~ret3 := f(~x - 2); {1112#true} is VALID [2022-02-21 03:02:31,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {1112#true} ~x := #in~x; {1112#true} is VALID [2022-02-21 03:02:31,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {1112#true} assume ~x <= 0;#res := 0; {1124#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:31,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {1124#(<= |f_#res| 0)} assume true; {1124#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:31,244 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1124#(<= |f_#res| 0)} {1118#(<= |g_#t~ret2| 0)} #55#return; {1123#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} is VALID [2022-02-21 03:02:31,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {1123#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1123#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} is VALID [2022-02-21 03:02:31,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {1123#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} assume !(#t~ret2 + #t~ret3 <= 2147483647); {1113#false} is VALID [2022-02-21 03:02:31,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 03:02:31,246 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:31,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150088186] [2022-02-21 03:02:31,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150088186] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:31,246 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:31,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:02:31,246 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891804951] [2022-02-21 03:02:31,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:31,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-02-21 03:02:31,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:31,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:02:31,259 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:02:31,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:02:31,259 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:31,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:02:31,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:02:31,260 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:02:31,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:31,382 INFO L93 Difference]: Finished difference Result 94 states and 123 transitions. [2022-02-21 03:02:31,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:02:31,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-02-21 03:02:31,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:31,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:02:31,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-02-21 03:02:31,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:02:31,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-02-21 03:02:31,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-02-21 03:02:31,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:31,421 INFO L225 Difference]: With dead ends: 94 [2022-02-21 03:02:31,421 INFO L226 Difference]: Without dead ends: 93 [2022-02-21 03:02:31,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:02:31,422 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 8 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:31,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 131 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:31,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-21 03:02:31,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2022-02-21 03:02:31,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:31,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 79 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 60 states have internal predecessors, (69), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (20), 14 states have call predecessors, (20), 11 states have call successors, (20) [2022-02-21 03:02:31,450 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 79 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 60 states have internal predecessors, (69), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (20), 14 states have call predecessors, (20), 11 states have call successors, (20) [2022-02-21 03:02:31,451 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 79 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 60 states have internal predecessors, (69), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (20), 14 states have call predecessors, (20), 11 states have call successors, (20) [2022-02-21 03:02:31,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:31,453 INFO L93 Difference]: Finished difference Result 93 states and 120 transitions. [2022-02-21 03:02:31,453 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 120 transitions. [2022-02-21 03:02:31,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:31,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:31,454 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 60 states have internal predecessors, (69), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (20), 14 states have call predecessors, (20), 11 states have call successors, (20) Second operand 93 states. [2022-02-21 03:02:31,455 INFO L87 Difference]: Start difference. First operand has 79 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 60 states have internal predecessors, (69), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (20), 14 states have call predecessors, (20), 11 states have call successors, (20) Second operand 93 states. [2022-02-21 03:02:31,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:31,457 INFO L93 Difference]: Finished difference Result 93 states and 120 transitions. [2022-02-21 03:02:31,457 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 120 transitions. [2022-02-21 03:02:31,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:31,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:31,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:31,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:31,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 60 states have internal predecessors, (69), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (20), 14 states have call predecessors, (20), 11 states have call successors, (20) [2022-02-21 03:02:31,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 101 transitions. [2022-02-21 03:02:31,461 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 101 transitions. Word has length 22 [2022-02-21 03:02:31,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:31,461 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 101 transitions. [2022-02-21 03:02:31,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:02:31,461 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2022-02-21 03:02:31,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-21 03:02:31,462 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:31,462 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:31,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 03:02:31,462 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2022-02-21 03:02:31,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:31,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1134815458, now seen corresponding path program 1 times [2022-02-21 03:02:31,463 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:31,463 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361070935] [2022-02-21 03:02:31,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:31,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:31,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 03:02:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:31,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {1520#true} ~x := #in~x; {1520#true} is VALID [2022-02-21 03:02:31,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {1520#true} assume ~x <= 0;#res := 0; {1532#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:31,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {1532#(<= 0 |f_#res|)} assume true; {1532#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:31,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1532#(<= 0 |f_#res|)} {1520#true} #53#return; {1526#(<= 0 |g_#t~ret2|)} is VALID [2022-02-21 03:02:31,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-21 03:02:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:31,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {1520#true} ~x := #in~x; {1520#true} is VALID [2022-02-21 03:02:31,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {1520#true} assume ~x <= 0;#res := 0; {1532#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:31,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {1532#(<= 0 |f_#res|)} assume true; {1532#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:31,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1532#(<= 0 |f_#res|)} {1526#(<= 0 |g_#t~ret2|)} #55#return; {1531#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} is VALID [2022-02-21 03:02:31,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {1520#true} assume { :begin_inline_ULTIMATE.init } true; {1520#true} is VALID [2022-02-21 03:02:31,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {1520#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1520#true} is VALID [2022-02-21 03:02:31,528 INFO L272 TraceCheckUtils]: 2: Hoare triple {1520#true} call main_#t~ret5#1 := g(main_~x~0#1); {1520#true} is VALID [2022-02-21 03:02:31,528 INFO L290 TraceCheckUtils]: 3: Hoare triple {1520#true} ~x := #in~x; {1520#true} is VALID [2022-02-21 03:02:31,528 INFO L290 TraceCheckUtils]: 4: Hoare triple {1520#true} assume !(~x <= 0); {1520#true} is VALID [2022-02-21 03:02:31,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {1520#true} assume ~x - 1 <= 2147483647; {1520#true} is VALID [2022-02-21 03:02:31,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {1520#true} assume ~x - 1 >= -2147483648; {1520#true} is VALID [2022-02-21 03:02:31,529 INFO L272 TraceCheckUtils]: 7: Hoare triple {1520#true} call #t~ret2 := f(~x - 1); {1520#true} is VALID [2022-02-21 03:02:31,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {1520#true} ~x := #in~x; {1520#true} is VALID [2022-02-21 03:02:31,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {1520#true} assume ~x <= 0;#res := 0; {1532#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:31,529 INFO L290 TraceCheckUtils]: 10: Hoare triple {1532#(<= 0 |f_#res|)} assume true; {1532#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:31,530 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1532#(<= 0 |f_#res|)} {1520#true} #53#return; {1526#(<= 0 |g_#t~ret2|)} is VALID [2022-02-21 03:02:31,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {1526#(<= 0 |g_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1526#(<= 0 |g_#t~ret2|)} is VALID [2022-02-21 03:02:31,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {1526#(<= 0 |g_#t~ret2|)} assume ~x - 2 <= 2147483647; {1526#(<= 0 |g_#t~ret2|)} is VALID [2022-02-21 03:02:31,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {1526#(<= 0 |g_#t~ret2|)} assume ~x - 2 >= -2147483648; {1526#(<= 0 |g_#t~ret2|)} is VALID [2022-02-21 03:02:31,531 INFO L272 TraceCheckUtils]: 15: Hoare triple {1526#(<= 0 |g_#t~ret2|)} call #t~ret3 := f(~x - 2); {1520#true} is VALID [2022-02-21 03:02:31,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {1520#true} ~x := #in~x; {1520#true} is VALID [2022-02-21 03:02:31,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {1520#true} assume ~x <= 0;#res := 0; {1532#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:31,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {1532#(<= 0 |f_#res|)} assume true; {1532#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:31,533 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1532#(<= 0 |f_#res|)} {1526#(<= 0 |g_#t~ret2|)} #55#return; {1531#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} is VALID [2022-02-21 03:02:31,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {1531#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1531#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} is VALID [2022-02-21 03:02:31,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {1531#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} assume #t~ret2 + #t~ret3 <= 2147483647; {1531#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} is VALID [2022-02-21 03:02:31,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {1531#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} assume !(#t~ret2 + #t~ret3 >= -2147483648); {1521#false} is VALID [2022-02-21 03:02:31,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 03:02:31,534 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:31,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361070935] [2022-02-21 03:02:31,534 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361070935] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:31,534 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:31,534 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:02:31,534 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529311493] [2022-02-21 03:02:31,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:31,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-02-21 03:02:31,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:31,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:02:31,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:31,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:02:31,546 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:31,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:02:31,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:02:31,547 INFO L87 Difference]: Start difference. First operand 79 states and 101 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:02:31,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:31,668 INFO L93 Difference]: Finished difference Result 94 states and 120 transitions. [2022-02-21 03:02:31,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:02:31,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-02-21 03:02:31,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:31,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:02:31,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-02-21 03:02:31,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:02:31,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-02-21 03:02:31,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2022-02-21 03:02:31,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:31,715 INFO L225 Difference]: With dead ends: 94 [2022-02-21 03:02:31,715 INFO L226 Difference]: Without dead ends: 90 [2022-02-21 03:02:31,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:02:31,716 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:31,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 127 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:31,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-02-21 03:02:31,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 79. [2022-02-21 03:02:31,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:31,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 79 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (19), 13 states have call predecessors, (19), 11 states have call successors, (19) [2022-02-21 03:02:31,741 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 79 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (19), 13 states have call predecessors, (19), 11 states have call successors, (19) [2022-02-21 03:02:31,741 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 79 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (19), 13 states have call predecessors, (19), 11 states have call successors, (19) [2022-02-21 03:02:31,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:31,744 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2022-02-21 03:02:31,744 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2022-02-21 03:02:31,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:31,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:31,745 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (19), 13 states have call predecessors, (19), 11 states have call successors, (19) Second operand 90 states. [2022-02-21 03:02:31,746 INFO L87 Difference]: Start difference. First operand has 79 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (19), 13 states have call predecessors, (19), 11 states have call successors, (19) Second operand 90 states. [2022-02-21 03:02:31,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:31,748 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2022-02-21 03:02:31,749 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2022-02-21 03:02:31,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:31,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:31,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:31,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:31,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (19), 13 states have call predecessors, (19), 11 states have call successors, (19) [2022-02-21 03:02:31,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2022-02-21 03:02:31,752 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 23 [2022-02-21 03:02:31,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:31,753 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2022-02-21 03:02:31,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:02:31,753 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2022-02-21 03:02:31,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-21 03:02:31,754 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:31,754 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:31,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 03:02:31,754 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2022-02-21 03:02:31,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:31,755 INFO L85 PathProgramCache]: Analyzing trace with hash -90939109, now seen corresponding path program 1 times [2022-02-21 03:02:31,755 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:31,755 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123791901] [2022-02-21 03:02:31,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:31,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:31,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 03:02:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:31,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {1922#true} ~x := #in~x; {1922#true} is VALID [2022-02-21 03:02:31,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {1922#true} assume ~x <= 0;#res := 0; {1922#true} is VALID [2022-02-21 03:02:31,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {1922#true} assume true; {1922#true} is VALID [2022-02-21 03:02:31,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1922#true} {1922#true} #53#return; {1922#true} is VALID [2022-02-21 03:02:31,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-21 03:02:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:31,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {1922#true} ~x := #in~x; {1937#(= |g_#in~x| g_~x)} is VALID [2022-02-21 03:02:31,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {1937#(= |g_#in~x| g_~x)} assume ~x <= 0;#res := 0; {1938#(<= |g_#in~x| 0)} is VALID [2022-02-21 03:02:31,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {1938#(<= |g_#in~x| 0)} assume true; {1938#(<= |g_#in~x| 0)} is VALID [2022-02-21 03:02:31,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1938#(<= |g_#in~x| 0)} {1928#(<= 1 f_~x)} #49#return; {1923#false} is VALID [2022-02-21 03:02:31,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-21 03:02:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:31,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {1922#true} ~x := #in~x; {1922#true} is VALID [2022-02-21 03:02:31,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {1922#true} assume ~x <= 0;#res := 0; {1922#true} is VALID [2022-02-21 03:02:31,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {1922#true} assume true; {1922#true} is VALID [2022-02-21 03:02:31,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1922#true} {1923#false} #51#return; {1923#false} is VALID [2022-02-21 03:02:31,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {1922#true} assume { :begin_inline_ULTIMATE.init } true; {1922#true} is VALID [2022-02-21 03:02:31,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {1922#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1922#true} is VALID [2022-02-21 03:02:31,806 INFO L272 TraceCheckUtils]: 2: Hoare triple {1922#true} call main_#t~ret5#1 := g(main_~x~0#1); {1922#true} is VALID [2022-02-21 03:02:31,806 INFO L290 TraceCheckUtils]: 3: Hoare triple {1922#true} ~x := #in~x; {1922#true} is VALID [2022-02-21 03:02:31,806 INFO L290 TraceCheckUtils]: 4: Hoare triple {1922#true} assume !(~x <= 0); {1922#true} is VALID [2022-02-21 03:02:31,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {1922#true} assume ~x - 1 <= 2147483647; {1922#true} is VALID [2022-02-21 03:02:31,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {1922#true} assume ~x - 1 >= -2147483648; {1922#true} is VALID [2022-02-21 03:02:31,807 INFO L272 TraceCheckUtils]: 7: Hoare triple {1922#true} call #t~ret2 := f(~x - 1); {1922#true} is VALID [2022-02-21 03:02:31,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {1922#true} ~x := #in~x; {1922#true} is VALID [2022-02-21 03:02:31,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {1922#true} assume ~x <= 0;#res := 0; {1922#true} is VALID [2022-02-21 03:02:31,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {1922#true} assume true; {1922#true} is VALID [2022-02-21 03:02:31,808 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1922#true} {1922#true} #53#return; {1922#true} is VALID [2022-02-21 03:02:31,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {1922#true} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1922#true} is VALID [2022-02-21 03:02:31,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {1922#true} assume ~x - 2 <= 2147483647; {1922#true} is VALID [2022-02-21 03:02:31,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {1922#true} assume ~x - 2 >= -2147483648; {1922#true} is VALID [2022-02-21 03:02:31,808 INFO L272 TraceCheckUtils]: 15: Hoare triple {1922#true} call #t~ret3 := f(~x - 2); {1922#true} is VALID [2022-02-21 03:02:31,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {1922#true} ~x := #in~x; {1922#true} is VALID [2022-02-21 03:02:31,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {1922#true} assume !(~x <= 0); {1928#(<= 1 f_~x)} is VALID [2022-02-21 03:02:31,809 INFO L272 TraceCheckUtils]: 18: Hoare triple {1928#(<= 1 f_~x)} call #t~ret0 := g(~x); {1922#true} is VALID [2022-02-21 03:02:31,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {1922#true} ~x := #in~x; {1937#(= |g_#in~x| g_~x)} is VALID [2022-02-21 03:02:31,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {1937#(= |g_#in~x| g_~x)} assume ~x <= 0;#res := 0; {1938#(<= |g_#in~x| 0)} is VALID [2022-02-21 03:02:31,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {1938#(<= |g_#in~x| 0)} assume true; {1938#(<= |g_#in~x| 0)} is VALID [2022-02-21 03:02:31,810 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1938#(<= |g_#in~x| 0)} {1928#(<= 1 f_~x)} #49#return; {1923#false} is VALID [2022-02-21 03:02:31,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {1923#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1923#false} is VALID [2022-02-21 03:02:31,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {1923#false} assume 1 + ~x <= 2147483647; {1923#false} is VALID [2022-02-21 03:02:31,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {1923#false} assume 1 + ~x >= -2147483648; {1923#false} is VALID [2022-02-21 03:02:31,811 INFO L272 TraceCheckUtils]: 26: Hoare triple {1923#false} call #t~ret1 := g(1 + ~x); {1922#true} is VALID [2022-02-21 03:02:31,811 INFO L290 TraceCheckUtils]: 27: Hoare triple {1922#true} ~x := #in~x; {1922#true} is VALID [2022-02-21 03:02:31,811 INFO L290 TraceCheckUtils]: 28: Hoare triple {1922#true} assume ~x <= 0;#res := 0; {1922#true} is VALID [2022-02-21 03:02:31,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {1922#true} assume true; {1922#true} is VALID [2022-02-21 03:02:31,812 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1922#true} {1923#false} #51#return; {1923#false} is VALID [2022-02-21 03:02:31,812 INFO L290 TraceCheckUtils]: 31: Hoare triple {1923#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1923#false} is VALID [2022-02-21 03:02:31,812 INFO L290 TraceCheckUtils]: 32: Hoare triple {1923#false} assume !(#t~ret0 + #t~ret1 <= 2147483647); {1923#false} is VALID [2022-02-21 03:02:31,812 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-21 03:02:31,812 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:31,812 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123791901] [2022-02-21 03:02:31,812 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123791901] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:02:31,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541559673] [2022-02-21 03:02:31,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:31,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:31,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:31,814 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:02:31,836 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:02:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:31,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:02:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:31,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:02:32,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {1922#true} assume { :begin_inline_ULTIMATE.init } true; {1922#true} is VALID [2022-02-21 03:02:32,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {1922#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1922#true} is VALID [2022-02-21 03:02:32,100 INFO L272 TraceCheckUtils]: 2: Hoare triple {1922#true} call main_#t~ret5#1 := g(main_~x~0#1); {1922#true} is VALID [2022-02-21 03:02:32,100 INFO L290 TraceCheckUtils]: 3: Hoare triple {1922#true} ~x := #in~x; {1922#true} is VALID [2022-02-21 03:02:32,100 INFO L290 TraceCheckUtils]: 4: Hoare triple {1922#true} assume !(~x <= 0); {1922#true} is VALID [2022-02-21 03:02:32,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {1922#true} assume ~x - 1 <= 2147483647; {1922#true} is VALID [2022-02-21 03:02:32,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {1922#true} assume ~x - 1 >= -2147483648; {1922#true} is VALID [2022-02-21 03:02:32,101 INFO L272 TraceCheckUtils]: 7: Hoare triple {1922#true} call #t~ret2 := f(~x - 1); {1922#true} is VALID [2022-02-21 03:02:32,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {1922#true} ~x := #in~x; {1966#(<= |f_#in~x| f_~x)} is VALID [2022-02-21 03:02:32,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {1966#(<= |f_#in~x| f_~x)} assume ~x <= 0;#res := 0; {1970#(<= |f_#in~x| 0)} is VALID [2022-02-21 03:02:32,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {1970#(<= |f_#in~x| 0)} assume true; {1970#(<= |f_#in~x| 0)} is VALID [2022-02-21 03:02:32,103 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1970#(<= |f_#in~x| 0)} {1922#true} #53#return; {1977#(<= g_~x 1)} is VALID [2022-02-21 03:02:32,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {1977#(<= g_~x 1)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1977#(<= g_~x 1)} is VALID [2022-02-21 03:02:32,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {1977#(<= g_~x 1)} assume ~x - 2 <= 2147483647; {1977#(<= g_~x 1)} is VALID [2022-02-21 03:02:32,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {1977#(<= g_~x 1)} assume ~x - 2 >= -2147483648; {1977#(<= g_~x 1)} is VALID [2022-02-21 03:02:32,104 INFO L272 TraceCheckUtils]: 15: Hoare triple {1977#(<= g_~x 1)} call #t~ret3 := f(~x - 2); {1990#(<= (+ |f_#in~x| 1) 0)} is VALID [2022-02-21 03:02:32,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {1990#(<= (+ |f_#in~x| 1) 0)} ~x := #in~x; {1994#(<= (+ f_~x 1) 0)} is VALID [2022-02-21 03:02:32,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {1994#(<= (+ f_~x 1) 0)} assume !(~x <= 0); {1923#false} is VALID [2022-02-21 03:02:32,105 INFO L272 TraceCheckUtils]: 18: Hoare triple {1923#false} call #t~ret0 := g(~x); {1923#false} is VALID [2022-02-21 03:02:32,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {1923#false} ~x := #in~x; {1923#false} is VALID [2022-02-21 03:02:32,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {1923#false} assume ~x <= 0;#res := 0; {1923#false} is VALID [2022-02-21 03:02:32,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {1923#false} assume true; {1923#false} is VALID [2022-02-21 03:02:32,106 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1923#false} {1923#false} #49#return; {1923#false} is VALID [2022-02-21 03:02:32,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {1923#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1923#false} is VALID [2022-02-21 03:02:32,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {1923#false} assume 1 + ~x <= 2147483647; {1923#false} is VALID [2022-02-21 03:02:32,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {1923#false} assume 1 + ~x >= -2147483648; {1923#false} is VALID [2022-02-21 03:02:32,106 INFO L272 TraceCheckUtils]: 26: Hoare triple {1923#false} call #t~ret1 := g(1 + ~x); {1923#false} is VALID [2022-02-21 03:02:32,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {1923#false} ~x := #in~x; {1923#false} is VALID [2022-02-21 03:02:32,107 INFO L290 TraceCheckUtils]: 28: Hoare triple {1923#false} assume ~x <= 0;#res := 0; {1923#false} is VALID [2022-02-21 03:02:32,107 INFO L290 TraceCheckUtils]: 29: Hoare triple {1923#false} assume true; {1923#false} is VALID [2022-02-21 03:02:32,107 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1923#false} {1923#false} #51#return; {1923#false} is VALID [2022-02-21 03:02:32,107 INFO L290 TraceCheckUtils]: 31: Hoare triple {1923#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1923#false} is VALID [2022-02-21 03:02:32,107 INFO L290 TraceCheckUtils]: 32: Hoare triple {1923#false} assume !(#t~ret0 + #t~ret1 <= 2147483647); {1923#false} is VALID [2022-02-21 03:02:32,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 03:02:32,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:02:32,333 INFO L290 TraceCheckUtils]: 32: Hoare triple {1923#false} assume !(#t~ret0 + #t~ret1 <= 2147483647); {1923#false} is VALID [2022-02-21 03:02:32,333 INFO L290 TraceCheckUtils]: 31: Hoare triple {1923#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1923#false} is VALID [2022-02-21 03:02:32,334 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1922#true} {1923#false} #51#return; {1923#false} is VALID [2022-02-21 03:02:32,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {1922#true} assume true; {1922#true} is VALID [2022-02-21 03:02:32,334 INFO L290 TraceCheckUtils]: 28: Hoare triple {1922#true} assume ~x <= 0;#res := 0; {1922#true} is VALID [2022-02-21 03:02:32,334 INFO L290 TraceCheckUtils]: 27: Hoare triple {1922#true} ~x := #in~x; {1922#true} is VALID [2022-02-21 03:02:32,334 INFO L272 TraceCheckUtils]: 26: Hoare triple {1923#false} call #t~ret1 := g(1 + ~x); {1922#true} is VALID [2022-02-21 03:02:32,334 INFO L290 TraceCheckUtils]: 25: Hoare triple {1923#false} assume 1 + ~x >= -2147483648; {1923#false} is VALID [2022-02-21 03:02:32,334 INFO L290 TraceCheckUtils]: 24: Hoare triple {1923#false} assume 1 + ~x <= 2147483647; {1923#false} is VALID [2022-02-21 03:02:32,334 INFO L290 TraceCheckUtils]: 23: Hoare triple {1923#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1923#false} is VALID [2022-02-21 03:02:32,334 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1922#true} {1923#false} #49#return; {1923#false} is VALID [2022-02-21 03:02:32,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {1922#true} assume true; {1922#true} is VALID [2022-02-21 03:02:32,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {1922#true} assume ~x <= 0;#res := 0; {1922#true} is VALID [2022-02-21 03:02:32,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {1922#true} ~x := #in~x; {1922#true} is VALID [2022-02-21 03:02:32,337 INFO L272 TraceCheckUtils]: 18: Hoare triple {1923#false} call #t~ret0 := g(~x); {1922#true} is VALID [2022-02-21 03:02:32,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {2088#(<= f_~x 0)} assume !(~x <= 0); {1923#false} is VALID [2022-02-21 03:02:32,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {1970#(<= |f_#in~x| 0)} ~x := #in~x; {2088#(<= f_~x 0)} is VALID [2022-02-21 03:02:32,339 INFO L272 TraceCheckUtils]: 15: Hoare triple {2095#(<= g_~x 2)} call #t~ret3 := f(~x - 2); {1970#(<= |f_#in~x| 0)} is VALID [2022-02-21 03:02:32,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {2095#(<= g_~x 2)} assume ~x - 2 >= -2147483648; {2095#(<= g_~x 2)} is VALID [2022-02-21 03:02:32,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {2095#(<= g_~x 2)} assume ~x - 2 <= 2147483647; {2095#(<= g_~x 2)} is VALID [2022-02-21 03:02:32,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {2095#(<= g_~x 2)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2095#(<= g_~x 2)} is VALID [2022-02-21 03:02:32,340 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2111#(<= |f_#in~x| 1)} {1922#true} #53#return; {2095#(<= g_~x 2)} is VALID [2022-02-21 03:02:32,341 INFO L290 TraceCheckUtils]: 10: Hoare triple {2111#(<= |f_#in~x| 1)} assume true; {2111#(<= |f_#in~x| 1)} is VALID [2022-02-21 03:02:32,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {2118#(or (not (<= f_~x 0)) (<= |f_#in~x| 1))} assume ~x <= 0;#res := 0; {2111#(<= |f_#in~x| 1)} is VALID [2022-02-21 03:02:32,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {1922#true} ~x := #in~x; {2118#(or (not (<= f_~x 0)) (<= |f_#in~x| 1))} is VALID [2022-02-21 03:02:32,342 INFO L272 TraceCheckUtils]: 7: Hoare triple {1922#true} call #t~ret2 := f(~x - 1); {1922#true} is VALID [2022-02-21 03:02:32,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {1922#true} assume ~x - 1 >= -2147483648; {1922#true} is VALID [2022-02-21 03:02:32,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {1922#true} assume ~x - 1 <= 2147483647; {1922#true} is VALID [2022-02-21 03:02:32,342 INFO L290 TraceCheckUtils]: 4: Hoare triple {1922#true} assume !(~x <= 0); {1922#true} is VALID [2022-02-21 03:02:32,342 INFO L290 TraceCheckUtils]: 3: Hoare triple {1922#true} ~x := #in~x; {1922#true} is VALID [2022-02-21 03:02:32,342 INFO L272 TraceCheckUtils]: 2: Hoare triple {1922#true} call main_#t~ret5#1 := g(main_~x~0#1); {1922#true} is VALID [2022-02-21 03:02:32,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {1922#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1922#true} is VALID [2022-02-21 03:02:32,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {1922#true} assume { :begin_inline_ULTIMATE.init } true; {1922#true} is VALID [2022-02-21 03:02:32,343 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-21 03:02:32,343 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541559673] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:02:32,343 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:02:32,343 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 14 [2022-02-21 03:02:32,343 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902384329] [2022-02-21 03:02:32,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:02:32,344 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 5 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 33 [2022-02-21 03:02:32,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:32,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 5 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-21 03:02:32,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:32,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-21 03:02:32,377 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:32,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 03:02:32,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:02:32,378 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 5 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-21 03:02:32,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:32,719 INFO L93 Difference]: Finished difference Result 124 states and 157 transitions. [2022-02-21 03:02:32,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:02:32,719 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 5 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 33 [2022-02-21 03:02:32,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:32,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 5 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-21 03:02:32,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 75 transitions. [2022-02-21 03:02:32,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 5 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-21 03:02:32,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 75 transitions. [2022-02-21 03:02:32,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 75 transitions. [2022-02-21 03:02:32,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:32,776 INFO L225 Difference]: With dead ends: 124 [2022-02-21 03:02:32,776 INFO L226 Difference]: Without dead ends: 0 [2022-02-21 03:02:32,779 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-02-21 03:02:32,779 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 40 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:32,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 140 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:02:32,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-21 03:02:32,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-21 03:02:32,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:32,780 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:02:32,780 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:02:32,780 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:02:32,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:32,780 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:02:32,780 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:02:32,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:32,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:32,780 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:02:32,780 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:02:32,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:32,781 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:02:32,781 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:02:32,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:32,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:32,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:32,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:32,782 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:02:32,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 03:02:32,782 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2022-02-21 03:02:32,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:32,782 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:02:32,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 5 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-21 03:02:32,782 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:02:32,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:32,784 INFO L764 garLoopResultBuilder]: Registering result SAFE for location fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2022-02-21 03:02:32,784 INFO L764 garLoopResultBuilder]: Registering result SAFE for location fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2022-02-21 03:02:32,785 INFO L764 garLoopResultBuilder]: Registering result SAFE for location fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2022-02-21 03:02:32,785 INFO L764 garLoopResultBuilder]: Registering result SAFE for location fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2022-02-21 03:02:32,785 INFO L764 garLoopResultBuilder]: Registering result SAFE for location gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2022-02-21 03:02:32,785 INFO L764 garLoopResultBuilder]: Registering result SAFE for location gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2022-02-21 03:02:32,785 INFO L764 garLoopResultBuilder]: Registering result SAFE for location gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2022-02-21 03:02:32,785 INFO L764 garLoopResultBuilder]: Registering result SAFE for location gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2022-02-21 03:02:32,785 INFO L764 garLoopResultBuilder]: Registering result SAFE for location gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2022-02-21 03:02:32,785 INFO L764 garLoopResultBuilder]: Registering result SAFE for location gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2022-02-21 03:02:32,802 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:02:33,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:33,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-21 03:02:33,124 INFO L858 garLoopResultBuilder]: For program point fFINAL(lines 11 15) no Hoare annotation was computed. [2022-02-21 03:02:33,125 INFO L854 garLoopResultBuilder]: At program point L14(line 14) the Hoare annotation is: (and (or (not (<= |f_#in~x| 2147483646)) (and (<= f_~x 2147483646) (<= |f_#in~x| f_~x) (<= 1 f_~x))) (not (<= (+ |f_#in~x| 1) 0))) [2022-02-21 03:02:33,125 INFO L858 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-02-21 03:02:33,125 INFO L858 garLoopResultBuilder]: For program point L14-1(line 14) no Hoare annotation was computed. [2022-02-21 03:02:33,125 INFO L858 garLoopResultBuilder]: For program point L14-2(line 14) no Hoare annotation was computed. [2022-02-21 03:02:33,125 INFO L858 garLoopResultBuilder]: For program point L14-3(line 14) no Hoare annotation was computed. [2022-02-21 03:02:33,125 INFO L854 garLoopResultBuilder]: At program point L14-4(line 14) the Hoare annotation is: (and (or (not (<= |f_#in~x| 2147483646)) (and (<= f_~x 2147483646) (<= |f_#in~x| 1) (<= 1 f_~x))) (not (<= (+ |f_#in~x| 1) 0))) [2022-02-21 03:02:33,125 INFO L858 garLoopResultBuilder]: For program point L14-5(line 14) no Hoare annotation was computed. [2022-02-21 03:02:33,125 INFO L858 garLoopResultBuilder]: For program point fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-02-21 03:02:33,125 INFO L858 garLoopResultBuilder]: For program point fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-02-21 03:02:33,125 INFO L858 garLoopResultBuilder]: For program point L14-6(line 14) no Hoare annotation was computed. [2022-02-21 03:02:33,126 INFO L858 garLoopResultBuilder]: For program point fEXIT(lines 11 15) no Hoare annotation was computed. [2022-02-21 03:02:33,126 INFO L858 garLoopResultBuilder]: For program point L14-7(line 14) no Hoare annotation was computed. [2022-02-21 03:02:33,126 INFO L861 garLoopResultBuilder]: At program point fENTRY(lines 11 15) the Hoare annotation is: true [2022-02-21 03:02:33,126 INFO L858 garLoopResultBuilder]: For program point fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-02-21 03:02:33,126 INFO L858 garLoopResultBuilder]: For program point fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-02-21 03:02:33,126 INFO L858 garLoopResultBuilder]: For program point gFINAL(lines 17 21) no Hoare annotation was computed. [2022-02-21 03:02:33,126 INFO L858 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-02-21 03:02:33,126 INFO L858 garLoopResultBuilder]: For program point L19(lines 19 20) no Hoare annotation was computed. [2022-02-21 03:02:33,126 INFO L858 garLoopResultBuilder]: For program point L20-1(line 20) no Hoare annotation was computed. [2022-02-21 03:02:33,126 INFO L854 garLoopResultBuilder]: At program point L20-2(line 20) the Hoare annotation is: (or (not (<= |g_#in~x| 2147483647)) (and (= |g_#in~x| g_~x) (<= 1 g_~x))) [2022-02-21 03:02:33,126 INFO L858 garLoopResultBuilder]: For program point L20-3(line 20) no Hoare annotation was computed. [2022-02-21 03:02:33,126 INFO L858 garLoopResultBuilder]: For program point L20-4(line 20) no Hoare annotation was computed. [2022-02-21 03:02:33,126 INFO L858 garLoopResultBuilder]: For program point L20-5(line 20) no Hoare annotation was computed. [2022-02-21 03:02:33,126 INFO L854 garLoopResultBuilder]: At program point L20-6(line 20) the Hoare annotation is: (or (and (<= g_~x 1) (= |g_#in~x| g_~x) (<= 1 g_~x) (<= |g_#t~ret2| 0) (<= 0 |g_#t~ret2|)) (not (<= |g_#in~x| 2147483647))) [2022-02-21 03:02:33,126 INFO L858 garLoopResultBuilder]: For program point L20-7(line 20) no Hoare annotation was computed. [2022-02-21 03:02:33,126 INFO L858 garLoopResultBuilder]: For program point L20-8(line 20) no Hoare annotation was computed. [2022-02-21 03:02:33,127 INFO L858 garLoopResultBuilder]: For program point L20-9(line 20) no Hoare annotation was computed. [2022-02-21 03:02:33,127 INFO L858 garLoopResultBuilder]: For program point gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-02-21 03:02:33,127 INFO L858 garLoopResultBuilder]: For program point gEXIT(lines 17 21) no Hoare annotation was computed. [2022-02-21 03:02:33,127 INFO L858 garLoopResultBuilder]: For program point gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-02-21 03:02:33,127 INFO L861 garLoopResultBuilder]: At program point gENTRY(lines 17 21) the Hoare annotation is: true [2022-02-21 03:02:33,127 INFO L858 garLoopResultBuilder]: For program point gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-02-21 03:02:33,127 INFO L858 garLoopResultBuilder]: For program point gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-02-21 03:02:33,127 INFO L858 garLoopResultBuilder]: For program point gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-02-21 03:02:33,127 INFO L858 garLoopResultBuilder]: For program point gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-02-21 03:02:33,127 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-21 03:02:33,127 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-21 03:02:33,127 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-21 03:02:33,127 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-21 03:02:33,127 INFO L854 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (<= |ULTIMATE.start_main_~x~0#1| 2147483647) [2022-02-21 03:02:33,127 INFO L858 garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed. [2022-02-21 03:02:33,127 INFO L858 garLoopResultBuilder]: For program point L24(lines 24 27) no Hoare annotation was computed. [2022-02-21 03:02:33,129 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:33,130 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:02:33,133 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-21 03:02:33,133 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-21 03:02:33,133 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-21 03:02:33,133 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-21 03:02:33,133 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-21 03:02:33,133 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-21 03:02:33,133 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-21 03:02:33,133 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-21 03:02:33,133 WARN L170 areAnnotationChecker]: fFINAL has no Hoare annotation [2022-02-21 03:02:33,133 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2022-02-21 03:02:33,133 WARN L170 areAnnotationChecker]: gFINAL has no Hoare annotation [2022-02-21 03:02:33,133 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-21 03:02:33,133 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-21 03:02:33,133 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-21 03:02:33,133 WARN L170 areAnnotationChecker]: fEXIT has no Hoare annotation [2022-02-21 03:02:33,133 WARN L170 areAnnotationChecker]: fEXIT has no Hoare annotation [2022-02-21 03:02:33,133 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2022-02-21 03:02:33,133 WARN L170 areAnnotationChecker]: gEXIT has no Hoare annotation [2022-02-21 03:02:33,133 WARN L170 areAnnotationChecker]: gEXIT has no Hoare annotation [2022-02-21 03:02:33,134 WARN L170 areAnnotationChecker]: gEXIT has no Hoare annotation [2022-02-21 03:02:33,134 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-21 03:02:33,134 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-21 03:02:33,134 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-21 03:02:33,134 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2022-02-21 03:02:33,134 WARN L170 areAnnotationChecker]: L20-7 has no Hoare annotation [2022-02-21 03:02:33,134 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-02-21 03:02:33,134 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-02-21 03:02:33,134 WARN L170 areAnnotationChecker]: L14-5 has no Hoare annotation [2022-02-21 03:02:33,134 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2022-02-21 03:02:33,134 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-21 03:02:33,134 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2022-02-21 03:02:33,134 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2022-02-21 03:02:33,134 WARN L170 areAnnotationChecker]: L20-8 has no Hoare annotation [2022-02-21 03:02:33,134 WARN L170 areAnnotationChecker]: L20-8 has no Hoare annotation [2022-02-21 03:02:33,134 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2022-02-21 03:02:33,134 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2022-02-21 03:02:33,134 WARN L170 areAnnotationChecker]: L14-6 has no Hoare annotation [2022-02-21 03:02:33,134 WARN L170 areAnnotationChecker]: L14-6 has no Hoare annotation [2022-02-21 03:02:33,134 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:02:33,134 WARN L170 areAnnotationChecker]: L20-5 has no Hoare annotation [2022-02-21 03:02:33,134 WARN L170 areAnnotationChecker]: L20-5 has no Hoare annotation [2022-02-21 03:02:33,134 WARN L170 areAnnotationChecker]: L20-9 has no Hoare annotation [2022-02-21 03:02:33,134 WARN L170 areAnnotationChecker]: L20-9 has no Hoare annotation [2022-02-21 03:02:33,135 WARN L170 areAnnotationChecker]: L14-5 has no Hoare annotation [2022-02-21 03:02:33,135 WARN L170 areAnnotationChecker]: L14-7 has no Hoare annotation [2022-02-21 03:02:33,135 WARN L170 areAnnotationChecker]: L14-7 has no Hoare annotation [2022-02-21 03:02:33,135 WARN L170 areAnnotationChecker]: L20-7 has no Hoare annotation [2022-02-21 03:02:33,135 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-21 03:02:33,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 03:02:33 BoogieIcfgContainer [2022-02-21 03:02:33,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 03:02:33,136 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:02:33,136 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:02:33,136 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:02:33,136 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:02:29" (3/4) ... [2022-02-21 03:02:33,138 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-21 03:02:33,142 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2022-02-21 03:02:33,142 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2022-02-21 03:02:33,145 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-02-21 03:02:33,145 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-02-21 03:02:33,145 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-21 03:02:33,168 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:02:33,168 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:02:33,169 INFO L158 Benchmark]: Toolchain (without parser) took 4283.17ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 58.4MB in the beginning and 112.1MB in the end (delta: -53.7MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. [2022-02-21 03:02:33,169 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 94.4MB. Free memory was 74.8MB in the beginning and 74.7MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:02:33,169 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.57ms. Allocated memory is still 94.4MB. Free memory was 58.2MB in the beginning and 71.8MB in the end (delta: -13.6MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2022-02-21 03:02:33,170 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.43ms. Allocated memory is still 94.4MB. Free memory was 71.8MB in the beginning and 70.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:02:33,170 INFO L158 Benchmark]: Boogie Preprocessor took 17.15ms. Allocated memory is still 94.4MB. Free memory was 70.5MB in the beginning and 69.6MB in the end (delta: 898.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:02:33,170 INFO L158 Benchmark]: RCFGBuilder took 371.46ms. Allocated memory is still 94.4MB. Free memory was 69.6MB in the beginning and 57.7MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:02:33,170 INFO L158 Benchmark]: TraceAbstraction took 3663.56ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 57.1MB in the beginning and 47.7MB in the end (delta: 9.4MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. [2022-02-21 03:02:33,170 INFO L158 Benchmark]: Witness Printer took 32.77ms. Allocated memory is still 136.3MB. Free memory was 47.7MB in the beginning and 112.1MB in the end (delta: -64.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:02:33,171 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 was 74.8MB in the beginning and 74.7MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 169.57ms. Allocated memory is still 94.4MB. Free memory was 58.2MB in the beginning and 71.8MB in the end (delta: -13.6MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.43ms. Allocated memory is still 94.4MB. Free memory was 71.8MB in the beginning and 70.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.15ms. Allocated memory is still 94.4MB. Free memory was 70.5MB in the beginning and 69.6MB in the end (delta: 898.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 371.46ms. Allocated memory is still 94.4MB. Free memory was 69.6MB in the beginning and 57.7MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3663.56ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 57.1MB in the beginning and 47.7MB in the end (delta: 9.4MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. * Witness Printer took 32.77ms. Allocated memory is still 136.3MB. Free memory was 47.7MB in the beginning and 112.1MB in the end (delta: -64.4MB). 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: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: 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: 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: 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: 20]: 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 3 procedures, 43 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 197 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 188 mSDsluCounter, 817 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 586 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 362 IncrementalHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 231 mSDtfsCounter, 362 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=5, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 39 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 55 PreInvPairs, 61 NumberOfFragments, 82 HoareAnnotationTreeSize, 55 FomulaSimplifications, 30 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 66 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 329 SizeOfPredicates, 2 NumberOfNonLiveVariables, 68 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 38/43 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 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-21 03:02:33,200 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