./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/MutualRecursion_1b.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_1b.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 ae72b099a35703f32ba85203e91200ae10b1da6ed5d35f42555b4b072fd32a75 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:02:28,179 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:02:28,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:02:28,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:02:28,209 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:02:28,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:02:28,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:02:28,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:02:28,217 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:02:28,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:02:28,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:02:28,221 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:02:28,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:02:28,226 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:02:28,227 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:02:28,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:02:28,231 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:02:28,232 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:02:28,235 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:02:28,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:02:28,240 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:02:28,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:02:28,242 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:02:28,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:02:28,249 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:02:28,252 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:02:28,252 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:02:28,253 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:02:28,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:02:28,255 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:02:28,255 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:02:28,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:02:28,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:02:28,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:02:28,258 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:02:28,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:02:28,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:02:28,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:02:28,259 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:02:28,260 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:02:28,260 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:02:28,261 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,296 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:02:28,296 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:02:28,297 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:02:28,297 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:02:28,298 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:02:28,298 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:02:28,298 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:02:28,298 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:02:28,299 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:02:28,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:02:28,299 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:02:28,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:02:28,300 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:02:28,300 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:02:28,300 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:02:28,300 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:02:28,300 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:02:28,300 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:02:28,301 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:02:28,301 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:02:28,301 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:02:28,301 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:02:28,301 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:02:28,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:02:28,301 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:02:28,302 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:02:28,302 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:02:28,302 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:02:28,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:02:28,302 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:02:28,302 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 -> ae72b099a35703f32ba85203e91200ae10b1da6ed5d35f42555b4b072fd32a75 [2022-02-21 03:02:28,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:02:28,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:02:28,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:02:28,526 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:02:28,527 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:02:28,528 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/MutualRecursion_1b.c [2022-02-21 03:02:28,575 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc3f34917/77dc60b2b331408fb12b5266245fd227/FLAG678af9cf6 [2022-02-21 03:02:28,868 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:02:28,869 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/MutualRecursion_1b.c [2022-02-21 03:02:28,876 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc3f34917/77dc60b2b331408fb12b5266245fd227/FLAG678af9cf6 [2022-02-21 03:02:29,304 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc3f34917/77dc60b2b331408fb12b5266245fd227 [2022-02-21 03:02:29,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:02:29,308 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:02:29,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:02:29,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:02:29,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:02:29,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:02:29" (1/1) ... [2022-02-21 03:02:29,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44fa7e36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:29, skipping insertion in model container [2022-02-21 03:02:29,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:02:29" (1/1) ... [2022-02-21 03:02:29,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:02:29,330 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:02:29,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:02:29,473 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:02:29,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:02:29,497 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:02:29,498 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,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:02:29,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:02:29,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:02:29,500 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:02:29,506 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,511 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,525 INFO L137 Inliner]: procedures = 6, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 8 [2022-02-21 03:02:29,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:02:29,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:02:29,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:02:29,526 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:02:29,532 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,532 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,533 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,533 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,539 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,541 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,541 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,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:02:29,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:02:29,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:02:29,549 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:02:29,550 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,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:02:29,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:29,571 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,575 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,602 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-02-21 03:02:29,602 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-02-21 03:02:29,603 INFO L130 BoogieDeclarations]: Found specification of procedure g [2022-02-21 03:02:29,603 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2022-02-21 03:02:29,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:02:29,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:02:29,641 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:02:29,642 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:02:29,858 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:02:29,864 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:02:29,865 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 03:02:29,866 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,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:02:29,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:02:29,867 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:02:29,870 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:02:29,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:02:29" (1/3) ... [2022-02-21 03:02:29,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b154d4 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,871 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,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b154d4 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,871 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,872 INFO L111 eAbstractionObserver]: Analyzing ICFG MutualRecursion_1b.c [2022-02-21 03:02:29,876 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:02:29,877 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-02-21 03:02:29,922 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:02:29,927 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,927 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-02-21 03:02:29,944 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,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:02:29,952 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:29,952 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:02:29,953 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,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:29,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2073143902, now seen corresponding path program 1 times [2022-02-21 03:02:29,962 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:29,962 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110783260] [2022-02-21 03:02:29,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:29,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:30,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#true} assume { :begin_inline_ULTIMATE.init } true; {46#true} is VALID [2022-02-21 03:02:30,128 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:30,130 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:30,132 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:30,133 INFO L290 TraceCheckUtils]: 4: Hoare triple {50#(<= g_~x 2147483647)} assume !(~x <= 0); {50#(<= g_~x 2147483647)} is VALID [2022-02-21 03:02:30,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {50#(<= g_~x 2147483647)} assume !(~x - 2 <= 2147483647); {47#false} is VALID [2022-02-21 03:02:30,135 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,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:30,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110783260] [2022-02-21 03:02:30,136 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110783260] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:30,137 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:30,137 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:02:30,138 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341253755] [2022-02-21 03:02:30,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:30,143 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,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:30,146 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:30,156 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:30,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:02:30,158 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:30,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:02:30,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:02:30,190 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,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:30,447 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-02-21 03:02:30,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:02:30,447 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,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:30,448 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,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-02-21 03:02:30,459 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,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-02-21 03:02:30,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2022-02-21 03:02:30,517 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,525 INFO L225 Difference]: With dead ends: 65 [2022-02-21 03:02:30,525 INFO L226 Difference]: Without dead ends: 57 [2022-02-21 03:02:30,527 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,530 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,530 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,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-21 03:02:30,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-02-21 03:02:30,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:30,558 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,559 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,560 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,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:30,565 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-02-21 03:02:30,565 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-02-21 03:02:30,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:30,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:30,566 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,567 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,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:30,585 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-02-21 03:02:30,585 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-02-21 03:02:30,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:30,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:30,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:30,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:30,591 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,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2022-02-21 03:02:30,597 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 6 [2022-02-21 03:02:30,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:30,597 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-02-21 03:02:30,597 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,598 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-02-21 03:02:30,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 03:02:30,599 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:30,599 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:30,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:02:30,600 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,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:30,602 INFO L85 PathProgramCache]: Analyzing trace with hash -157048422, now seen corresponding path program 1 times [2022-02-21 03:02:30,602 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:30,603 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233402301] [2022-02-21 03:02:30,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:30,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:30,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {305#true} assume { :begin_inline_ULTIMATE.init } true; {305#true} is VALID [2022-02-21 03:02:30,627 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,627 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,627 INFO L290 TraceCheckUtils]: 3: Hoare triple {305#true} ~x := #in~x; {305#true} is VALID [2022-02-21 03:02:30,628 INFO L290 TraceCheckUtils]: 4: Hoare triple {305#true} assume !(~x <= 0); {307#(<= 1 g_~x)} is VALID [2022-02-21 03:02:30,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {307#(<= 1 g_~x)} assume ~x - 2 <= 2147483647; {307#(<= 1 g_~x)} is VALID [2022-02-21 03:02:30,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {307#(<= 1 g_~x)} assume !(~x - 2 >= -2147483648); {306#false} is VALID [2022-02-21 03:02:30,629 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,629 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:30,632 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233402301] [2022-02-21 03:02:30,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233402301] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:30,633 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:30,633 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:02:30,633 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861493113] [2022-02-21 03:02:30,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:30,644 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,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:30,644 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,649 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,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:02:30,649 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:30,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:02:30,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:02:30,652 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,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:30,713 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-02-21 03:02:30,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:02:30,714 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,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:30,714 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,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-02-21 03:02:30,716 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,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-02-21 03:02:30,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-02-21 03:02:30,747 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,750 INFO L225 Difference]: With dead ends: 53 [2022-02-21 03:02:30,750 INFO L226 Difference]: Without dead ends: 51 [2022-02-21 03:02:30,750 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,754 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,755 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,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-21 03:02:30,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2022-02-21 03:02:30,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:30,775 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,775 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,777 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,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:30,781 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-02-21 03:02:30,781 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-02-21 03:02:30,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:30,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:30,786 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,786 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,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:30,790 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-02-21 03:02:30,791 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-02-21 03:02:30,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:30,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:30,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:30,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:30,791 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,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-02-21 03:02:30,793 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 7 [2022-02-21 03:02:30,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:30,793 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-02-21 03:02:30,793 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,793 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-02-21 03:02:30,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-21 03:02:30,794 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:30,794 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:30,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:02:30,794 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,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:30,795 INFO L85 PathProgramCache]: Analyzing trace with hash 496888160, now seen corresponding path program 1 times [2022-02-21 03:02:30,795 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:30,795 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631359546] [2022-02-21 03:02:30,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:30,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:30,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {534#true} assume { :begin_inline_ULTIMATE.init } true; {534#true} is VALID [2022-02-21 03:02:30,869 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,870 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,870 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,871 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,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#(<= g_~x 2147483647)} assume ~x - 2 <= 2147483647; {538#(<= g_~x 2147483647)} is VALID [2022-02-21 03:02:30,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {538#(<= g_~x 2147483647)} assume ~x - 2 >= -2147483648; {538#(<= g_~x 2147483647)} is VALID [2022-02-21 03:02:30,873 INFO L272 TraceCheckUtils]: 7: Hoare triple {538#(<= g_~x 2147483647)} call #t~ret2 := f(~x - 2); {539#(<= |f_#in~x| 2147483645)} is VALID [2022-02-21 03:02:30,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {539#(<= |f_#in~x| 2147483645)} ~x := #in~x; {540#(<= f_~x 2147483645)} is VALID [2022-02-21 03:02:30,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {540#(<= f_~x 2147483645)} assume !(~x <= 0); {540#(<= f_~x 2147483645)} is VALID [2022-02-21 03:02:30,875 INFO L272 TraceCheckUtils]: 10: Hoare triple {540#(<= f_~x 2147483645)} call #t~ret0 := g(~x); {541#(<= |g_#in~x| 2147483645)} is VALID [2022-02-21 03:02:30,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {541#(<= |g_#in~x| 2147483645)} ~x := #in~x; {542#(<= g_~x 2147483645)} is VALID [2022-02-21 03:02:30,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {542#(<= g_~x 2147483645)} assume !(~x <= 0); {542#(<= g_~x 2147483645)} is VALID [2022-02-21 03:02:30,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {542#(<= g_~x 2147483645)} assume !(~x - 2 <= 2147483647); {535#false} is VALID [2022-02-21 03:02:30,876 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,876 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:30,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631359546] [2022-02-21 03:02:30,877 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631359546] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:30,877 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:30,877 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-21 03:02:30,877 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434768060] [2022-02-21 03:02:30,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:30,878 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,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:30,878 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,887 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,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-21 03:02:30,887 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:30,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 03:02:30,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:02:30,888 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:31,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:31,240 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-02-21 03:02:31,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:02:31,241 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:31,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:31,241 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:31,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2022-02-21 03:02:31,243 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:31,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2022-02-21 03:02:31,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 63 transitions. [2022-02-21 03:02:31,291 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:31,293 INFO L225 Difference]: With dead ends: 67 [2022-02-21 03:02:31,293 INFO L226 Difference]: Without dead ends: 64 [2022-02-21 03:02:31,293 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:31,294 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:31,294 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:31,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-21 03:02:31,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2022-02-21 03:02:31,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:31,313 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:31,313 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:31,313 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:31,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:31,331 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2022-02-21 03:02:31,331 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2022-02-21 03:02:31,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:31,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:31,332 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:31,333 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:31,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:31,335 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2022-02-21 03:02:31,335 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2022-02-21 03:02:31,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:31,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:31,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:31,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:31,336 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:31,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2022-02-21 03:02:31,338 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 14 [2022-02-21 03:02:31,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:31,338 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2022-02-21 03:02:31,338 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:31,338 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-02-21 03:02:31,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-21 03:02:31,339 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:31,339 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:31,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:02:31,339 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:31,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:31,340 INFO L85 PathProgramCache]: Analyzing trace with hash -552782201, now seen corresponding path program 1 times [2022-02-21 03:02:31,340 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:31,340 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723550918] [2022-02-21 03:02:31,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:31,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:31,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-21 03:02:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:31,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {834#true} ~x := #in~x; {834#true} is VALID [2022-02-21 03:02:31,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {834#true} assume ~x <= 0;#res := 0; {834#true} is VALID [2022-02-21 03:02:31,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {834#true} assume true; {834#true} is VALID [2022-02-21 03:02:31,385 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,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {834#true} assume { :begin_inline_ULTIMATE.init } true; {834#true} is VALID [2022-02-21 03:02:31,385 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,385 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,386 INFO L290 TraceCheckUtils]: 3: Hoare triple {834#true} ~x := #in~x; {834#true} is VALID [2022-02-21 03:02:31,386 INFO L290 TraceCheckUtils]: 4: Hoare triple {834#true} assume !(~x <= 0); {834#true} is VALID [2022-02-21 03:02:31,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {834#true} assume ~x - 2 <= 2147483647; {834#true} is VALID [2022-02-21 03:02:31,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {834#true} assume ~x - 2 >= -2147483648; {834#true} is VALID [2022-02-21 03:02:31,386 INFO L272 TraceCheckUtils]: 7: Hoare triple {834#true} call #t~ret2 := f(~x - 2); {834#true} is VALID [2022-02-21 03:02:31,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {834#true} ~x := #in~x; {834#true} is VALID [2022-02-21 03:02:31,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {834#true} assume !(~x <= 0); {836#(<= 1 f_~x)} is VALID [2022-02-21 03:02:31,387 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,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {834#true} ~x := #in~x; {834#true} is VALID [2022-02-21 03:02:31,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {834#true} assume ~x <= 0;#res := 0; {834#true} is VALID [2022-02-21 03:02:31,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {834#true} assume true; {834#true} is VALID [2022-02-21 03:02:31,388 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,389 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,389 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,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {836#(<= 1 f_~x)} assume !(1 + ~x >= -2147483648); {835#false} is VALID [2022-02-21 03:02:31,390 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,390 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:31,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723550918] [2022-02-21 03:02:31,390 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723550918] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:31,390 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:31,390 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:02:31,391 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598519556] [2022-02-21 03:02:31,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:31,391 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,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:31,392 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,403 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,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:02:31,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:31,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:02:31,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:02:31,405 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,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:31,455 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2022-02-21 03:02:31,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:02:31,456 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,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:31,456 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,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-02-21 03:02:31,457 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,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-02-21 03:02:31,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 41 transitions. [2022-02-21 03:02:31,483 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,484 INFO L225 Difference]: With dead ends: 62 [2022-02-21 03:02:31,484 INFO L226 Difference]: Without dead ends: 61 [2022-02-21 03:02:31,484 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,485 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,486 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,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-02-21 03:02:31,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-02-21 03:02:31,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:31,513 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,514 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,514 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,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:31,521 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2022-02-21 03:02:31,521 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2022-02-21 03:02:31,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:31,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:31,522 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,523 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,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:31,525 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2022-02-21 03:02:31,525 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2022-02-21 03:02:31,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:31,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:31,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:31,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:31,527 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,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2022-02-21 03:02:31,529 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 18 [2022-02-21 03:02:31,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:31,529 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2022-02-21 03:02:31,529 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,529 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2022-02-21 03:02:31,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-21 03:02:31,530 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:31,530 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,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:02:31,530 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,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:31,530 INFO L85 PathProgramCache]: Analyzing trace with hash 2114816930, now seen corresponding path program 1 times [2022-02-21 03:02:31,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:31,530 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392018187] [2022-02-21 03:02:31,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:31,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:31,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 03:02:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:31,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {1112#true} ~x := #in~x; {1112#true} is VALID [2022-02-21 03:02:31,591 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,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {1124#(<= |f_#res| 0)} assume true; {1124#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:31,592 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,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-21 03:02:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:31,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {1112#true} ~x := #in~x; {1112#true} is VALID [2022-02-21 03:02:31,604 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,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {1124#(<= |f_#res| 0)} assume true; {1124#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:31,608 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,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {1112#true} assume { :begin_inline_ULTIMATE.init } true; {1112#true} is VALID [2022-02-21 03:02:31,609 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,609 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,609 INFO L290 TraceCheckUtils]: 3: Hoare triple {1112#true} ~x := #in~x; {1112#true} is VALID [2022-02-21 03:02:31,609 INFO L290 TraceCheckUtils]: 4: Hoare triple {1112#true} assume !(~x <= 0); {1112#true} is VALID [2022-02-21 03:02:31,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {1112#true} assume ~x - 2 <= 2147483647; {1112#true} is VALID [2022-02-21 03:02:31,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {1112#true} assume ~x - 2 >= -2147483648; {1112#true} is VALID [2022-02-21 03:02:31,610 INFO L272 TraceCheckUtils]: 7: Hoare triple {1112#true} call #t~ret2 := f(~x - 2); {1112#true} is VALID [2022-02-21 03:02:31,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {1112#true} ~x := #in~x; {1112#true} is VALID [2022-02-21 03:02:31,610 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,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {1124#(<= |f_#res| 0)} assume true; {1124#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:31,611 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,611 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,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {1118#(<= |g_#t~ret2| 0)} assume ~x - 3 <= 2147483647; {1118#(<= |g_#t~ret2| 0)} is VALID [2022-02-21 03:02:31,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {1118#(<= |g_#t~ret2| 0)} assume ~x - 3 >= -2147483648; {1118#(<= |g_#t~ret2| 0)} is VALID [2022-02-21 03:02:31,612 INFO L272 TraceCheckUtils]: 15: Hoare triple {1118#(<= |g_#t~ret2| 0)} call #t~ret3 := f(~x - 3); {1112#true} is VALID [2022-02-21 03:02:31,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {1112#true} ~x := #in~x; {1112#true} is VALID [2022-02-21 03:02:31,613 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,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {1124#(<= |f_#res| 0)} assume true; {1124#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:31,614 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,614 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,615 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,615 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,615 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:31,615 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392018187] [2022-02-21 03:02:31,615 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392018187] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:31,615 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:31,616 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:02:31,616 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59605841] [2022-02-21 03:02:31,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:31,616 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,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:31,617 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,631 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,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:02:31,632 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:31,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:02:31,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:02:31,632 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,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:31,792 INFO L93 Difference]: Finished difference Result 94 states and 123 transitions. [2022-02-21 03:02:31,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:02:31,792 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,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:31,793 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,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-02-21 03:02:31,794 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,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-02-21 03:02:31,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-02-21 03:02:31,831 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,833 INFO L225 Difference]: With dead ends: 94 [2022-02-21 03:02:31,834 INFO L226 Difference]: Without dead ends: 93 [2022-02-21 03:02:31,834 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,835 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,835 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,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-21 03:02:31,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2022-02-21 03:02:31,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:31,859 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,859 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,859 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,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:31,863 INFO L93 Difference]: Finished difference Result 93 states and 120 transitions. [2022-02-21 03:02:31,863 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 120 transitions. [2022-02-21 03:02:31,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:31,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:31,864 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,864 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,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:31,867 INFO L93 Difference]: Finished difference Result 93 states and 120 transitions. [2022-02-21 03:02:31,868 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 120 transitions. [2022-02-21 03:02:31,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:31,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:31,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:31,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:31,869 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,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 101 transitions. [2022-02-21 03:02:31,871 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 101 transitions. Word has length 22 [2022-02-21 03:02:31,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:31,871 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 101 transitions. [2022-02-21 03:02:31,872 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,872 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2022-02-21 03:02:31,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-21 03:02:31,872 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:31,872 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,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 03:02:31,873 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,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:31,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1134815458, now seen corresponding path program 1 times [2022-02-21 03:02:31,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:31,874 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856594721] [2022-02-21 03:02:31,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:31,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:31,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 03:02:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:31,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {1520#true} ~x := #in~x; {1520#true} is VALID [2022-02-21 03:02:31,924 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,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {1532#(<= 0 |f_#res|)} assume true; {1532#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:31,925 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,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-21 03:02:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:31,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {1520#true} ~x := #in~x; {1520#true} is VALID [2022-02-21 03:02:31,938 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,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {1532#(<= 0 |f_#res|)} assume true; {1532#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:31,940 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,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {1520#true} assume { :begin_inline_ULTIMATE.init } true; {1520#true} is VALID [2022-02-21 03:02:31,940 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,940 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,942 INFO L290 TraceCheckUtils]: 3: Hoare triple {1520#true} ~x := #in~x; {1520#true} is VALID [2022-02-21 03:02:31,942 INFO L290 TraceCheckUtils]: 4: Hoare triple {1520#true} assume !(~x <= 0); {1520#true} is VALID [2022-02-21 03:02:31,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {1520#true} assume ~x - 2 <= 2147483647; {1520#true} is VALID [2022-02-21 03:02:31,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {1520#true} assume ~x - 2 >= -2147483648; {1520#true} is VALID [2022-02-21 03:02:31,942 INFO L272 TraceCheckUtils]: 7: Hoare triple {1520#true} call #t~ret2 := f(~x - 2); {1520#true} is VALID [2022-02-21 03:02:31,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {1520#true} ~x := #in~x; {1520#true} is VALID [2022-02-21 03:02:31,943 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,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {1532#(<= 0 |f_#res|)} assume true; {1532#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:31,945 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,945 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,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {1526#(<= 0 |g_#t~ret2|)} assume ~x - 3 <= 2147483647; {1526#(<= 0 |g_#t~ret2|)} is VALID [2022-02-21 03:02:31,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {1526#(<= 0 |g_#t~ret2|)} assume ~x - 3 >= -2147483648; {1526#(<= 0 |g_#t~ret2|)} is VALID [2022-02-21 03:02:31,946 INFO L272 TraceCheckUtils]: 15: Hoare triple {1526#(<= 0 |g_#t~ret2|)} call #t~ret3 := f(~x - 3); {1520#true} is VALID [2022-02-21 03:02:31,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {1520#true} ~x := #in~x; {1520#true} is VALID [2022-02-21 03:02:31,948 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,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {1532#(<= 0 |f_#res|)} assume true; {1532#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:31,949 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,950 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,950 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,951 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,951 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,951 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:31,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856594721] [2022-02-21 03:02:31,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856594721] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:31,951 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:31,951 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:02:31,951 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474842146] [2022-02-21 03:02:31,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:31,952 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,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:31,952 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,963 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,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:02:31,964 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:31,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:02:31,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:02:31,965 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:32,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:32,068 INFO L93 Difference]: Finished difference Result 94 states and 120 transitions. [2022-02-21 03:02:32,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:02:32,068 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:32,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:32,069 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:32,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-02-21 03:02:32,070 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:32,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-02-21 03:02:32,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2022-02-21 03:02:32,105 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:32,107 INFO L225 Difference]: With dead ends: 94 [2022-02-21 03:02:32,107 INFO L226 Difference]: Without dead ends: 90 [2022-02-21 03:02:32,107 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:32,108 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:32,108 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:32,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-02-21 03:02:32,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 79. [2022-02-21 03:02:32,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:32,133 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:32,133 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:32,134 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:32,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:32,137 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2022-02-21 03:02:32,137 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2022-02-21 03:02:32,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:32,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:32,138 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:32,138 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:32,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:32,141 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2022-02-21 03:02:32,141 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2022-02-21 03:02:32,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:32,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:32,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:32,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:32,142 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:32,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2022-02-21 03:02:32,144 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 23 [2022-02-21 03:02:32,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:32,145 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2022-02-21 03:02:32,145 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:32,145 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2022-02-21 03:02:32,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-21 03:02:32,146 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:32,146 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:32,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 03:02:32,159 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:32,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:32,160 INFO L85 PathProgramCache]: Analyzing trace with hash -90939109, now seen corresponding path program 1 times [2022-02-21 03:02:32,160 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:32,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006044611] [2022-02-21 03:02:32,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:32,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:32,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 03:02:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:32,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {1922#true} ~x := #in~x; {1922#true} is VALID [2022-02-21 03:02:32,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {1922#true} assume ~x <= 0;#res := 0; {1922#true} is VALID [2022-02-21 03:02:32,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {1922#true} assume true; {1922#true} is VALID [2022-02-21 03:02:32,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1922#true} {1922#true} #53#return; {1922#true} is VALID [2022-02-21 03:02:32,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-21 03:02:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:32,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {1922#true} ~x := #in~x; {1937#(= |g_#in~x| g_~x)} is VALID [2022-02-21 03:02:32,224 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:32,224 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:32,225 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:32,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-21 03:02:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:32,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {1922#true} ~x := #in~x; {1922#true} is VALID [2022-02-21 03:02:32,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {1922#true} assume ~x <= 0;#res := 0; {1922#true} is VALID [2022-02-21 03:02:32,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {1922#true} assume true; {1922#true} is VALID [2022-02-21 03:02:32,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1922#true} {1923#false} #51#return; {1923#false} is VALID [2022-02-21 03:02:32,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {1922#true} assume { :begin_inline_ULTIMATE.init } true; {1922#true} is VALID [2022-02-21 03:02:32,230 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,230 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,230 INFO L290 TraceCheckUtils]: 3: Hoare triple {1922#true} ~x := #in~x; {1922#true} is VALID [2022-02-21 03:02:32,230 INFO L290 TraceCheckUtils]: 4: Hoare triple {1922#true} assume !(~x <= 0); {1922#true} is VALID [2022-02-21 03:02:32,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {1922#true} assume ~x - 2 <= 2147483647; {1922#true} is VALID [2022-02-21 03:02:32,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {1922#true} assume ~x - 2 >= -2147483648; {1922#true} is VALID [2022-02-21 03:02:32,231 INFO L272 TraceCheckUtils]: 7: Hoare triple {1922#true} call #t~ret2 := f(~x - 2); {1922#true} is VALID [2022-02-21 03:02:32,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {1922#true} ~x := #in~x; {1922#true} is VALID [2022-02-21 03:02:32,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {1922#true} assume ~x <= 0;#res := 0; {1922#true} is VALID [2022-02-21 03:02:32,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {1922#true} assume true; {1922#true} is VALID [2022-02-21 03:02:32,231 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1922#true} {1922#true} #53#return; {1922#true} is VALID [2022-02-21 03:02:32,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {1922#true} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1922#true} is VALID [2022-02-21 03:02:32,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {1922#true} assume ~x - 3 <= 2147483647; {1922#true} is VALID [2022-02-21 03:02:32,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {1922#true} assume ~x - 3 >= -2147483648; {1922#true} is VALID [2022-02-21 03:02:32,231 INFO L272 TraceCheckUtils]: 15: Hoare triple {1922#true} call #t~ret3 := f(~x - 3); {1922#true} is VALID [2022-02-21 03:02:32,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {1922#true} ~x := #in~x; {1922#true} is VALID [2022-02-21 03:02:32,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {1922#true} assume !(~x <= 0); {1928#(<= 1 f_~x)} is VALID [2022-02-21 03:02:32,232 INFO L272 TraceCheckUtils]: 18: Hoare triple {1928#(<= 1 f_~x)} call #t~ret0 := g(~x); {1922#true} is VALID [2022-02-21 03:02:32,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {1922#true} ~x := #in~x; {1937#(= |g_#in~x| g_~x)} is VALID [2022-02-21 03:02:32,233 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:32,233 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:32,234 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:32,234 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,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {1923#false} assume 1 + ~x <= 2147483647; {1923#false} is VALID [2022-02-21 03:02:32,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {1923#false} assume 1 + ~x >= -2147483648; {1923#false} is VALID [2022-02-21 03:02:32,234 INFO L272 TraceCheckUtils]: 26: Hoare triple {1923#false} call #t~ret1 := g(1 + ~x); {1922#true} is VALID [2022-02-21 03:02:32,234 INFO L290 TraceCheckUtils]: 27: Hoare triple {1922#true} ~x := #in~x; {1922#true} is VALID [2022-02-21 03:02:32,234 INFO L290 TraceCheckUtils]: 28: Hoare triple {1922#true} assume ~x <= 0;#res := 0; {1922#true} is VALID [2022-02-21 03:02:32,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {1922#true} assume true; {1922#true} is VALID [2022-02-21 03:02:32,234 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1922#true} {1923#false} #51#return; {1923#false} is VALID [2022-02-21 03:02:32,234 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,235 INFO L290 TraceCheckUtils]: 32: Hoare triple {1923#false} assume !(#t~ret0 + #t~ret1 <= 2147483647); {1923#false} is VALID [2022-02-21 03:02:32,235 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:32,235 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:32,235 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006044611] [2022-02-21 03:02:32,235 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006044611] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:02:32,235 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108879880] [2022-02-21 03:02:32,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:32,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:32,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:32,237 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:32,242 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:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:32,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:02:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:32,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:02:32,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {1922#true} assume { :begin_inline_ULTIMATE.init } true; {1922#true} is VALID [2022-02-21 03:02:32,525 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,525 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,525 INFO L290 TraceCheckUtils]: 3: Hoare triple {1922#true} ~x := #in~x; {1922#true} is VALID [2022-02-21 03:02:32,525 INFO L290 TraceCheckUtils]: 4: Hoare triple {1922#true} assume !(~x <= 0); {1922#true} is VALID [2022-02-21 03:02:32,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {1922#true} assume ~x - 2 <= 2147483647; {1922#true} is VALID [2022-02-21 03:02:32,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {1922#true} assume ~x - 2 >= -2147483648; {1922#true} is VALID [2022-02-21 03:02:32,526 INFO L272 TraceCheckUtils]: 7: Hoare triple {1922#true} call #t~ret2 := f(~x - 2); {1922#true} is VALID [2022-02-21 03:02:32,529 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,529 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,530 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,530 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1970#(<= |f_#in~x| 0)} {1922#true} #53#return; {1977#(<= g_~x 2)} is VALID [2022-02-21 03:02:32,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {1977#(<= g_~x 2)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1977#(<= g_~x 2)} is VALID [2022-02-21 03:02:32,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {1977#(<= g_~x 2)} assume ~x - 3 <= 2147483647; {1977#(<= g_~x 2)} is VALID [2022-02-21 03:02:32,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {1977#(<= g_~x 2)} assume ~x - 3 >= -2147483648; {1977#(<= g_~x 2)} is VALID [2022-02-21 03:02:32,532 INFO L272 TraceCheckUtils]: 15: Hoare triple {1977#(<= g_~x 2)} call #t~ret3 := f(~x - 3); {1990#(<= (+ |f_#in~x| 1) 0)} is VALID [2022-02-21 03:02:32,532 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,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {1994#(<= (+ f_~x 1) 0)} assume !(~x <= 0); {1923#false} is VALID [2022-02-21 03:02:32,533 INFO L272 TraceCheckUtils]: 18: Hoare triple {1923#false} call #t~ret0 := g(~x); {1923#false} is VALID [2022-02-21 03:02:32,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {1923#false} ~x := #in~x; {1923#false} is VALID [2022-02-21 03:02:32,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {1923#false} assume ~x <= 0;#res := 0; {1923#false} is VALID [2022-02-21 03:02:32,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {1923#false} assume true; {1923#false} is VALID [2022-02-21 03:02:32,544 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1923#false} {1923#false} #49#return; {1923#false} is VALID [2022-02-21 03:02:32,544 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,544 INFO L290 TraceCheckUtils]: 24: Hoare triple {1923#false} assume 1 + ~x <= 2147483647; {1923#false} is VALID [2022-02-21 03:02:32,544 INFO L290 TraceCheckUtils]: 25: Hoare triple {1923#false} assume 1 + ~x >= -2147483648; {1923#false} is VALID [2022-02-21 03:02:32,544 INFO L272 TraceCheckUtils]: 26: Hoare triple {1923#false} call #t~ret1 := g(1 + ~x); {1923#false} is VALID [2022-02-21 03:02:32,544 INFO L290 TraceCheckUtils]: 27: Hoare triple {1923#false} ~x := #in~x; {1923#false} is VALID [2022-02-21 03:02:32,545 INFO L290 TraceCheckUtils]: 28: Hoare triple {1923#false} assume ~x <= 0;#res := 0; {1923#false} is VALID [2022-02-21 03:02:32,545 INFO L290 TraceCheckUtils]: 29: Hoare triple {1923#false} assume true; {1923#false} is VALID [2022-02-21 03:02:32,545 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1923#false} {1923#false} #51#return; {1923#false} is VALID [2022-02-21 03:02:32,545 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,545 INFO L290 TraceCheckUtils]: 32: Hoare triple {1923#false} assume !(#t~ret0 + #t~ret1 <= 2147483647); {1923#false} is VALID [2022-02-21 03:02:32,545 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,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:02:32,787 INFO L290 TraceCheckUtils]: 32: Hoare triple {1923#false} assume !(#t~ret0 + #t~ret1 <= 2147483647); {1923#false} is VALID [2022-02-21 03:02:32,788 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,788 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1922#true} {1923#false} #51#return; {1923#false} is VALID [2022-02-21 03:02:32,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {1922#true} assume true; {1922#true} is VALID [2022-02-21 03:02:32,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {1922#true} assume ~x <= 0;#res := 0; {1922#true} is VALID [2022-02-21 03:02:32,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {1922#true} ~x := #in~x; {1922#true} is VALID [2022-02-21 03:02:32,789 INFO L272 TraceCheckUtils]: 26: Hoare triple {1923#false} call #t~ret1 := g(1 + ~x); {1922#true} is VALID [2022-02-21 03:02:32,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {1923#false} assume 1 + ~x >= -2147483648; {1923#false} is VALID [2022-02-21 03:02:32,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {1923#false} assume 1 + ~x <= 2147483647; {1923#false} is VALID [2022-02-21 03:02:32,789 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,789 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1922#true} {1923#false} #49#return; {1923#false} is VALID [2022-02-21 03:02:32,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {1922#true} assume true; {1922#true} is VALID [2022-02-21 03:02:32,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {1922#true} assume ~x <= 0;#res := 0; {1922#true} is VALID [2022-02-21 03:02:32,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {1922#true} ~x := #in~x; {1922#true} is VALID [2022-02-21 03:02:32,790 INFO L272 TraceCheckUtils]: 18: Hoare triple {1923#false} call #t~ret0 := g(~x); {1922#true} is VALID [2022-02-21 03:02:32,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {2088#(<= f_~x 0)} assume !(~x <= 0); {1923#false} is VALID [2022-02-21 03:02:32,791 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,791 INFO L272 TraceCheckUtils]: 15: Hoare triple {2095#(<= g_~x 3)} call #t~ret3 := f(~x - 3); {1970#(<= |f_#in~x| 0)} is VALID [2022-02-21 03:02:32,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {2095#(<= g_~x 3)} assume ~x - 3 >= -2147483648; {2095#(<= g_~x 3)} is VALID [2022-02-21 03:02:32,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {2095#(<= g_~x 3)} assume ~x - 3 <= 2147483647; {2095#(<= g_~x 3)} is VALID [2022-02-21 03:02:32,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {2095#(<= g_~x 3)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2095#(<= g_~x 3)} is VALID [2022-02-21 03:02:32,793 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2111#(<= |f_#in~x| 1)} {1922#true} #53#return; {2095#(<= g_~x 3)} is VALID [2022-02-21 03:02:32,793 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,794 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,794 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,794 INFO L272 TraceCheckUtils]: 7: Hoare triple {1922#true} call #t~ret2 := f(~x - 2); {1922#true} is VALID [2022-02-21 03:02:32,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {1922#true} assume ~x - 2 >= -2147483648; {1922#true} is VALID [2022-02-21 03:02:32,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {1922#true} assume ~x - 2 <= 2147483647; {1922#true} is VALID [2022-02-21 03:02:32,795 INFO L290 TraceCheckUtils]: 4: Hoare triple {1922#true} assume !(~x <= 0); {1922#true} is VALID [2022-02-21 03:02:32,795 INFO L290 TraceCheckUtils]: 3: Hoare triple {1922#true} ~x := #in~x; {1922#true} is VALID [2022-02-21 03:02:32,795 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,795 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,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {1922#true} assume { :begin_inline_ULTIMATE.init } true; {1922#true} is VALID [2022-02-21 03:02:32,795 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,796 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108879880] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:02:32,796 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:02:32,796 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 14 [2022-02-21 03:02:32,796 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188112110] [2022-02-21 03:02:32,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:02:32,797 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,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:32,798 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,832 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,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-21 03:02:32,833 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:32,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 03:02:32,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:02:32,834 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:33,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:33,469 INFO L93 Difference]: Finished difference Result 194 states and 256 transitions. [2022-02-21 03:02:33,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-21 03:02:33,470 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:33,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:33,470 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:33,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 122 transitions. [2022-02-21 03:02:33,473 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:33,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 122 transitions. [2022-02-21 03:02:33,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 122 transitions. [2022-02-21 03:02:33,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:33,564 INFO L225 Difference]: With dead ends: 194 [2022-02-21 03:02:33,564 INFO L226 Difference]: Without dead ends: 119 [2022-02-21 03:02:33,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-02-21 03:02:33,566 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 92 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:33,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 226 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:02:33,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-02-21 03:02:33,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2022-02-21 03:02:33,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:33,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 100 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 77 states have internal predecessors, (85), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (25), 16 states have call predecessors, (25), 13 states have call successors, (25) [2022-02-21 03:02:33,616 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 100 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 77 states have internal predecessors, (85), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (25), 16 states have call predecessors, (25), 13 states have call successors, (25) [2022-02-21 03:02:33,616 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 100 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 77 states have internal predecessors, (85), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (25), 16 states have call predecessors, (25), 13 states have call successors, (25) [2022-02-21 03:02:33,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:33,619 INFO L93 Difference]: Finished difference Result 119 states and 144 transitions. [2022-02-21 03:02:33,619 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 144 transitions. [2022-02-21 03:02:33,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:33,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:33,620 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 77 states have internal predecessors, (85), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (25), 16 states have call predecessors, (25), 13 states have call successors, (25) Second operand 119 states. [2022-02-21 03:02:33,621 INFO L87 Difference]: Start difference. First operand has 100 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 77 states have internal predecessors, (85), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (25), 16 states have call predecessors, (25), 13 states have call successors, (25) Second operand 119 states. [2022-02-21 03:02:33,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:33,624 INFO L93 Difference]: Finished difference Result 119 states and 144 transitions. [2022-02-21 03:02:33,624 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 144 transitions. [2022-02-21 03:02:33,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:33,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:33,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:33,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:33,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 77 states have internal predecessors, (85), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (25), 16 states have call predecessors, (25), 13 states have call successors, (25) [2022-02-21 03:02:33,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 124 transitions. [2022-02-21 03:02:33,628 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 124 transitions. Word has length 33 [2022-02-21 03:02:33,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:33,629 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 124 transitions. [2022-02-21 03:02:33,629 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:33,629 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions. [2022-02-21 03:02:33,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-02-21 03:02:33,631 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:33,631 INFO L514 BasicCegarLoop]: trace histogram [8, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:33,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-21 03:02:33,847 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,848 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2022-02-21 03:02:33,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:33,848 INFO L85 PathProgramCache]: Analyzing trace with hash -561043184, now seen corresponding path program 1 times [2022-02-21 03:02:33,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:33,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137867191] [2022-02-21 03:02:33,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:33,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:33,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-21 03:02:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:33,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 03:02:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:33,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {2745#true} ~x := #in~x; {2745#true} is VALID [2022-02-21 03:02:33,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {2745#true} assume ~x <= 0;#res := 0; {2745#true} is VALID [2022-02-21 03:02:33,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {2745#true} assume true; {2745#true} is VALID [2022-02-21 03:02:33,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2745#true} {2745#true} #53#return; {2745#true} is VALID [2022-02-21 03:02:33,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:02:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:33,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {2745#true} ~x := #in~x; {2745#true} is VALID [2022-02-21 03:02:33,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {2745#true} assume ~x <= 0;#res := 0; {2745#true} is VALID [2022-02-21 03:02:33,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {2745#true} assume true; {2745#true} is VALID [2022-02-21 03:02:33,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2745#true} {2745#true} #55#return; {2745#true} is VALID [2022-02-21 03:02:33,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {2745#true} ~x := #in~x; {2745#true} is VALID [2022-02-21 03:02:33,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {2745#true} assume !(~x <= 0); {2745#true} is VALID [2022-02-21 03:02:33,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {2745#true} assume ~x - 2 <= 2147483647; {2745#true} is VALID [2022-02-21 03:02:33,967 INFO L290 TraceCheckUtils]: 3: Hoare triple {2745#true} assume ~x - 2 >= -2147483648; {2745#true} is VALID [2022-02-21 03:02:33,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {2745#true} call #t~ret2 := f(~x - 2); {2745#true} is VALID [2022-02-21 03:02:33,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {2745#true} ~x := #in~x; {2745#true} is VALID [2022-02-21 03:02:33,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {2745#true} assume ~x <= 0;#res := 0; {2745#true} is VALID [2022-02-21 03:02:33,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {2745#true} assume true; {2745#true} is VALID [2022-02-21 03:02:33,968 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2745#true} {2745#true} #53#return; {2745#true} is VALID [2022-02-21 03:02:33,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {2745#true} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2745#true} is VALID [2022-02-21 03:02:33,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {2745#true} assume ~x - 3 <= 2147483647; {2745#true} is VALID [2022-02-21 03:02:33,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {2745#true} assume ~x - 3 >= -2147483648; {2745#true} is VALID [2022-02-21 03:02:33,969 INFO L272 TraceCheckUtils]: 12: Hoare triple {2745#true} call #t~ret3 := f(~x - 3); {2745#true} is VALID [2022-02-21 03:02:33,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {2745#true} ~x := #in~x; {2745#true} is VALID [2022-02-21 03:02:33,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {2745#true} assume ~x <= 0;#res := 0; {2745#true} is VALID [2022-02-21 03:02:33,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {2745#true} assume true; {2745#true} is VALID [2022-02-21 03:02:33,970 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2745#true} {2745#true} #55#return; {2745#true} is VALID [2022-02-21 03:02:33,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {2745#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2745#true} is VALID [2022-02-21 03:02:33,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {2745#true} assume #t~ret2 + #t~ret3 <= 2147483647; {2745#true} is VALID [2022-02-21 03:02:33,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {2745#true} assume #t~ret2 + #t~ret3 >= -2147483648;#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {2745#true} is VALID [2022-02-21 03:02:33,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {2745#true} assume true; {2745#true} is VALID [2022-02-21 03:02:33,972 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2745#true} {2745#true} #49#return; {2745#true} is VALID [2022-02-21 03:02:33,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-02-21 03:02:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:34,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 03:02:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:34,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {2745#true} ~x := #in~x; {2745#true} is VALID [2022-02-21 03:02:34,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {2745#true} assume ~x <= 0;#res := 0; {2834#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:34,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {2834#(<= |f_#res| 0)} assume true; {2834#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:34,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2834#(<= |f_#res| 0)} {2745#true} #53#return; {2827#(<= |g_#t~ret2| 0)} is VALID [2022-02-21 03:02:34,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:02:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:34,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {2745#true} ~x := #in~x; {2745#true} is VALID [2022-02-21 03:02:34,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {2745#true} assume ~x <= 0;#res := 0; {2834#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:34,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {2834#(<= |f_#res| 0)} assume true; {2834#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:34,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2834#(<= |f_#res| 0)} {2827#(<= |g_#t~ret2| 0)} #55#return; {2832#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} is VALID [2022-02-21 03:02:34,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {2745#true} ~x := #in~x; {2745#true} is VALID [2022-02-21 03:02:34,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {2745#true} assume !(~x <= 0); {2745#true} is VALID [2022-02-21 03:02:34,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {2745#true} assume ~x - 2 <= 2147483647; {2745#true} is VALID [2022-02-21 03:02:34,027 INFO L290 TraceCheckUtils]: 3: Hoare triple {2745#true} assume ~x - 2 >= -2147483648; {2745#true} is VALID [2022-02-21 03:02:34,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {2745#true} call #t~ret2 := f(~x - 2); {2745#true} is VALID [2022-02-21 03:02:34,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {2745#true} ~x := #in~x; {2745#true} is VALID [2022-02-21 03:02:34,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {2745#true} assume ~x <= 0;#res := 0; {2834#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:34,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {2834#(<= |f_#res| 0)} assume true; {2834#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:34,028 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2834#(<= |f_#res| 0)} {2745#true} #53#return; {2827#(<= |g_#t~ret2| 0)} is VALID [2022-02-21 03:02:34,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {2827#(<= |g_#t~ret2| 0)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2827#(<= |g_#t~ret2| 0)} is VALID [2022-02-21 03:02:34,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {2827#(<= |g_#t~ret2| 0)} assume ~x - 3 <= 2147483647; {2827#(<= |g_#t~ret2| 0)} is VALID [2022-02-21 03:02:34,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {2827#(<= |g_#t~ret2| 0)} assume ~x - 3 >= -2147483648; {2827#(<= |g_#t~ret2| 0)} is VALID [2022-02-21 03:02:34,030 INFO L272 TraceCheckUtils]: 12: Hoare triple {2827#(<= |g_#t~ret2| 0)} call #t~ret3 := f(~x - 3); {2745#true} is VALID [2022-02-21 03:02:34,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {2745#true} ~x := #in~x; {2745#true} is VALID [2022-02-21 03:02:34,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {2745#true} assume ~x <= 0;#res := 0; {2834#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:34,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {2834#(<= |f_#res| 0)} assume true; {2834#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:34,031 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2834#(<= |f_#res| 0)} {2827#(<= |g_#t~ret2| 0)} #55#return; {2832#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} is VALID [2022-02-21 03:02:34,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {2832#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2832#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} is VALID [2022-02-21 03:02:34,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {2832#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} assume #t~ret2 + #t~ret3 <= 2147483647; {2832#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} is VALID [2022-02-21 03:02:34,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {2832#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} assume #t~ret2 + #t~ret3 >= -2147483648;#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {2833#(<= |g_#res| 0)} is VALID [2022-02-21 03:02:34,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {2833#(<= |g_#res| 0)} assume true; {2833#(<= |g_#res| 0)} is VALID [2022-02-21 03:02:34,033 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2833#(<= |g_#res| 0)} {2745#true} #49#return; {2791#(<= |f_#t~ret0| 0)} is VALID [2022-02-21 03:02:34,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-02-21 03:02:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:34,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 03:02:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:34,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {2745#true} ~x := #in~x; {2745#true} is VALID [2022-02-21 03:02:34,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {2745#true} assume ~x <= 0;#res := 0; {2834#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:34,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {2834#(<= |f_#res| 0)} assume true; {2834#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:34,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2834#(<= |f_#res| 0)} {2745#true} #53#return; {2827#(<= |g_#t~ret2| 0)} is VALID [2022-02-21 03:02:34,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:02:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:34,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {2745#true} ~x := #in~x; {2745#true} is VALID [2022-02-21 03:02:34,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {2745#true} assume ~x <= 0;#res := 0; {2834#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:34,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {2834#(<= |f_#res| 0)} assume true; {2834#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:34,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2834#(<= |f_#res| 0)} {2827#(<= |g_#t~ret2| 0)} #55#return; {2832#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} is VALID [2022-02-21 03:02:34,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {2745#true} ~x := #in~x; {2745#true} is VALID [2022-02-21 03:02:34,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {2745#true} assume !(~x <= 0); {2745#true} is VALID [2022-02-21 03:02:34,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {2745#true} assume ~x - 2 <= 2147483647; {2745#true} is VALID [2022-02-21 03:02:34,076 INFO L290 TraceCheckUtils]: 3: Hoare triple {2745#true} assume ~x - 2 >= -2147483648; {2745#true} is VALID [2022-02-21 03:02:34,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {2745#true} call #t~ret2 := f(~x - 2); {2745#true} is VALID [2022-02-21 03:02:34,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {2745#true} ~x := #in~x; {2745#true} is VALID [2022-02-21 03:02:34,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {2745#true} assume ~x <= 0;#res := 0; {2834#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:34,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {2834#(<= |f_#res| 0)} assume true; {2834#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:34,078 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2834#(<= |f_#res| 0)} {2745#true} #53#return; {2827#(<= |g_#t~ret2| 0)} is VALID [2022-02-21 03:02:34,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {2827#(<= |g_#t~ret2| 0)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2827#(<= |g_#t~ret2| 0)} is VALID [2022-02-21 03:02:34,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {2827#(<= |g_#t~ret2| 0)} assume ~x - 3 <= 2147483647; {2827#(<= |g_#t~ret2| 0)} is VALID [2022-02-21 03:02:34,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {2827#(<= |g_#t~ret2| 0)} assume ~x - 3 >= -2147483648; {2827#(<= |g_#t~ret2| 0)} is VALID [2022-02-21 03:02:34,079 INFO L272 TraceCheckUtils]: 12: Hoare triple {2827#(<= |g_#t~ret2| 0)} call #t~ret3 := f(~x - 3); {2745#true} is VALID [2022-02-21 03:02:34,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {2745#true} ~x := #in~x; {2745#true} is VALID [2022-02-21 03:02:34,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {2745#true} assume ~x <= 0;#res := 0; {2834#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:34,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {2834#(<= |f_#res| 0)} assume true; {2834#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:34,081 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2834#(<= |f_#res| 0)} {2827#(<= |g_#t~ret2| 0)} #55#return; {2832#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} is VALID [2022-02-21 03:02:34,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {2832#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2832#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} is VALID [2022-02-21 03:02:34,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {2832#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} assume #t~ret2 + #t~ret3 <= 2147483647; {2832#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} is VALID [2022-02-21 03:02:34,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {2832#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} assume #t~ret2 + #t~ret3 >= -2147483648;#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {2833#(<= |g_#res| 0)} is VALID [2022-02-21 03:02:34,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {2833#(<= |g_#res| 0)} assume true; {2833#(<= |g_#res| 0)} is VALID [2022-02-21 03:02:34,083 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2833#(<= |g_#res| 0)} {2791#(<= |f_#t~ret0| 0)} #51#return; {2814#(<= (+ |f_#t~ret1| |f_#t~ret0|) 0)} is VALID [2022-02-21 03:02:34,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {2745#true} assume { :begin_inline_ULTIMATE.init } true; {2745#true} is VALID [2022-02-21 03:02:34,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {2745#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; {2745#true} is VALID [2022-02-21 03:02:34,084 INFO L272 TraceCheckUtils]: 2: Hoare triple {2745#true} call main_#t~ret5#1 := g(main_~x~0#1); {2745#true} is VALID [2022-02-21 03:02:34,084 INFO L290 TraceCheckUtils]: 3: Hoare triple {2745#true} ~x := #in~x; {2745#true} is VALID [2022-02-21 03:02:34,084 INFO L290 TraceCheckUtils]: 4: Hoare triple {2745#true} assume !(~x <= 0); {2745#true} is VALID [2022-02-21 03:02:34,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {2745#true} assume ~x - 2 <= 2147483647; {2745#true} is VALID [2022-02-21 03:02:34,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {2745#true} assume ~x - 2 >= -2147483648; {2745#true} is VALID [2022-02-21 03:02:34,084 INFO L272 TraceCheckUtils]: 7: Hoare triple {2745#true} call #t~ret2 := f(~x - 2); {2745#true} is VALID [2022-02-21 03:02:34,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {2745#true} ~x := #in~x; {2745#true} is VALID [2022-02-21 03:02:34,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {2745#true} assume !(~x <= 0); {2745#true} is VALID [2022-02-21 03:02:34,085 INFO L272 TraceCheckUtils]: 10: Hoare triple {2745#true} call #t~ret0 := g(~x); {2745#true} is VALID [2022-02-21 03:02:34,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {2745#true} ~x := #in~x; {2745#true} is VALID [2022-02-21 03:02:34,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {2745#true} assume !(~x <= 0); {2745#true} is VALID [2022-02-21 03:02:34,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {2745#true} assume ~x - 2 <= 2147483647; {2745#true} is VALID [2022-02-21 03:02:34,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {2745#true} assume ~x - 2 >= -2147483648; {2745#true} is VALID [2022-02-21 03:02:34,085 INFO L272 TraceCheckUtils]: 15: Hoare triple {2745#true} call #t~ret2 := f(~x - 2); {2745#true} is VALID [2022-02-21 03:02:34,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {2745#true} ~x := #in~x; {2745#true} is VALID [2022-02-21 03:02:34,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {2745#true} assume ~x <= 0;#res := 0; {2745#true} is VALID [2022-02-21 03:02:34,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {2745#true} assume true; {2745#true} is VALID [2022-02-21 03:02:34,086 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2745#true} {2745#true} #53#return; {2745#true} is VALID [2022-02-21 03:02:34,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {2745#true} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2745#true} is VALID [2022-02-21 03:02:34,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {2745#true} assume ~x - 3 <= 2147483647; {2745#true} is VALID [2022-02-21 03:02:34,086 INFO L290 TraceCheckUtils]: 22: Hoare triple {2745#true} assume ~x - 3 >= -2147483648; {2745#true} is VALID [2022-02-21 03:02:34,087 INFO L272 TraceCheckUtils]: 23: Hoare triple {2745#true} call #t~ret3 := f(~x - 3); {2745#true} is VALID [2022-02-21 03:02:34,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {2745#true} ~x := #in~x; {2745#true} is VALID [2022-02-21 03:02:34,087 INFO L290 TraceCheckUtils]: 25: Hoare triple {2745#true} assume ~x <= 0;#res := 0; {2745#true} is VALID [2022-02-21 03:02:34,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {2745#true} assume true; {2745#true} is VALID [2022-02-21 03:02:34,087 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2745#true} {2745#true} #55#return; {2745#true} is VALID [2022-02-21 03:02:34,087 INFO L290 TraceCheckUtils]: 28: Hoare triple {2745#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2745#true} is VALID [2022-02-21 03:02:34,088 INFO L290 TraceCheckUtils]: 29: Hoare triple {2745#true} assume #t~ret2 + #t~ret3 <= 2147483647; {2745#true} is VALID [2022-02-21 03:02:34,088 INFO L290 TraceCheckUtils]: 30: Hoare triple {2745#true} assume #t~ret2 + #t~ret3 >= -2147483648;#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {2745#true} is VALID [2022-02-21 03:02:34,088 INFO L290 TraceCheckUtils]: 31: Hoare triple {2745#true} assume true; {2745#true} is VALID [2022-02-21 03:02:34,088 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2745#true} {2745#true} #49#return; {2745#true} is VALID [2022-02-21 03:02:34,088 INFO L290 TraceCheckUtils]: 33: Hoare triple {2745#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2745#true} is VALID [2022-02-21 03:02:34,088 INFO L290 TraceCheckUtils]: 34: Hoare triple {2745#true} assume 1 + ~x <= 2147483647; {2745#true} is VALID [2022-02-21 03:02:34,088 INFO L290 TraceCheckUtils]: 35: Hoare triple {2745#true} assume 1 + ~x >= -2147483648; {2745#true} is VALID [2022-02-21 03:02:34,089 INFO L272 TraceCheckUtils]: 36: Hoare triple {2745#true} call #t~ret1 := g(1 + ~x); {2745#true} is VALID [2022-02-21 03:02:34,089 INFO L290 TraceCheckUtils]: 37: Hoare triple {2745#true} ~x := #in~x; {2745#true} is VALID [2022-02-21 03:02:34,089 INFO L290 TraceCheckUtils]: 38: Hoare triple {2745#true} assume !(~x <= 0); {2745#true} is VALID [2022-02-21 03:02:34,089 INFO L290 TraceCheckUtils]: 39: Hoare triple {2745#true} assume ~x - 2 <= 2147483647; {2745#true} is VALID [2022-02-21 03:02:34,089 INFO L290 TraceCheckUtils]: 40: Hoare triple {2745#true} assume ~x - 2 >= -2147483648; {2745#true} is VALID [2022-02-21 03:02:34,089 INFO L272 TraceCheckUtils]: 41: Hoare triple {2745#true} call #t~ret2 := f(~x - 2); {2745#true} is VALID [2022-02-21 03:02:34,089 INFO L290 TraceCheckUtils]: 42: Hoare triple {2745#true} ~x := #in~x; {2745#true} is VALID [2022-02-21 03:02:34,090 INFO L290 TraceCheckUtils]: 43: Hoare triple {2745#true} assume !(~x <= 0); {2745#true} is VALID [2022-02-21 03:02:34,090 INFO L272 TraceCheckUtils]: 44: Hoare triple {2745#true} call #t~ret0 := g(~x); {2745#true} is VALID [2022-02-21 03:02:34,090 INFO L290 TraceCheckUtils]: 45: Hoare triple {2745#true} ~x := #in~x; {2745#true} is VALID [2022-02-21 03:02:34,090 INFO L290 TraceCheckUtils]: 46: Hoare triple {2745#true} assume !(~x <= 0); {2745#true} is VALID [2022-02-21 03:02:34,090 INFO L290 TraceCheckUtils]: 47: Hoare triple {2745#true} assume ~x - 2 <= 2147483647; {2745#true} is VALID [2022-02-21 03:02:34,090 INFO L290 TraceCheckUtils]: 48: Hoare triple {2745#true} assume ~x - 2 >= -2147483648; {2745#true} is VALID [2022-02-21 03:02:34,090 INFO L272 TraceCheckUtils]: 49: Hoare triple {2745#true} call #t~ret2 := f(~x - 2); {2745#true} is VALID [2022-02-21 03:02:34,091 INFO L290 TraceCheckUtils]: 50: Hoare triple {2745#true} ~x := #in~x; {2745#true} is VALID [2022-02-21 03:02:34,091 INFO L290 TraceCheckUtils]: 51: Hoare triple {2745#true} assume ~x <= 0;#res := 0; {2834#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:34,091 INFO L290 TraceCheckUtils]: 52: Hoare triple {2834#(<= |f_#res| 0)} assume true; {2834#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:34,092 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {2834#(<= |f_#res| 0)} {2745#true} #53#return; {2827#(<= |g_#t~ret2| 0)} is VALID [2022-02-21 03:02:34,092 INFO L290 TraceCheckUtils]: 54: Hoare triple {2827#(<= |g_#t~ret2| 0)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2827#(<= |g_#t~ret2| 0)} is VALID [2022-02-21 03:02:34,093 INFO L290 TraceCheckUtils]: 55: Hoare triple {2827#(<= |g_#t~ret2| 0)} assume ~x - 3 <= 2147483647; {2827#(<= |g_#t~ret2| 0)} is VALID [2022-02-21 03:02:34,093 INFO L290 TraceCheckUtils]: 56: Hoare triple {2827#(<= |g_#t~ret2| 0)} assume ~x - 3 >= -2147483648; {2827#(<= |g_#t~ret2| 0)} is VALID [2022-02-21 03:02:34,093 INFO L272 TraceCheckUtils]: 57: Hoare triple {2827#(<= |g_#t~ret2| 0)} call #t~ret3 := f(~x - 3); {2745#true} is VALID [2022-02-21 03:02:34,093 INFO L290 TraceCheckUtils]: 58: Hoare triple {2745#true} ~x := #in~x; {2745#true} is VALID [2022-02-21 03:02:34,093 INFO L290 TraceCheckUtils]: 59: Hoare triple {2745#true} assume ~x <= 0;#res := 0; {2834#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:34,094 INFO L290 TraceCheckUtils]: 60: Hoare triple {2834#(<= |f_#res| 0)} assume true; {2834#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:34,094 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {2834#(<= |f_#res| 0)} {2827#(<= |g_#t~ret2| 0)} #55#return; {2832#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} is VALID [2022-02-21 03:02:34,095 INFO L290 TraceCheckUtils]: 62: Hoare triple {2832#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2832#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} is VALID [2022-02-21 03:02:34,095 INFO L290 TraceCheckUtils]: 63: Hoare triple {2832#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} assume #t~ret2 + #t~ret3 <= 2147483647; {2832#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} is VALID [2022-02-21 03:02:34,096 INFO L290 TraceCheckUtils]: 64: Hoare triple {2832#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} assume #t~ret2 + #t~ret3 >= -2147483648;#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {2833#(<= |g_#res| 0)} is VALID [2022-02-21 03:02:34,096 INFO L290 TraceCheckUtils]: 65: Hoare triple {2833#(<= |g_#res| 0)} assume true; {2833#(<= |g_#res| 0)} is VALID [2022-02-21 03:02:34,097 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {2833#(<= |g_#res| 0)} {2745#true} #49#return; {2791#(<= |f_#t~ret0| 0)} is VALID [2022-02-21 03:02:34,097 INFO L290 TraceCheckUtils]: 67: Hoare triple {2791#(<= |f_#t~ret0| 0)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2791#(<= |f_#t~ret0| 0)} is VALID [2022-02-21 03:02:34,097 INFO L290 TraceCheckUtils]: 68: Hoare triple {2791#(<= |f_#t~ret0| 0)} assume 1 + ~x <= 2147483647; {2791#(<= |f_#t~ret0| 0)} is VALID [2022-02-21 03:02:34,097 INFO L290 TraceCheckUtils]: 69: Hoare triple {2791#(<= |f_#t~ret0| 0)} assume 1 + ~x >= -2147483648; {2791#(<= |f_#t~ret0| 0)} is VALID [2022-02-21 03:02:34,098 INFO L272 TraceCheckUtils]: 70: Hoare triple {2791#(<= |f_#t~ret0| 0)} call #t~ret1 := g(1 + ~x); {2745#true} is VALID [2022-02-21 03:02:34,098 INFO L290 TraceCheckUtils]: 71: Hoare triple {2745#true} ~x := #in~x; {2745#true} is VALID [2022-02-21 03:02:34,098 INFO L290 TraceCheckUtils]: 72: Hoare triple {2745#true} assume !(~x <= 0); {2745#true} is VALID [2022-02-21 03:02:34,098 INFO L290 TraceCheckUtils]: 73: Hoare triple {2745#true} assume ~x - 2 <= 2147483647; {2745#true} is VALID [2022-02-21 03:02:34,098 INFO L290 TraceCheckUtils]: 74: Hoare triple {2745#true} assume ~x - 2 >= -2147483648; {2745#true} is VALID [2022-02-21 03:02:34,098 INFO L272 TraceCheckUtils]: 75: Hoare triple {2745#true} call #t~ret2 := f(~x - 2); {2745#true} is VALID [2022-02-21 03:02:34,098 INFO L290 TraceCheckUtils]: 76: Hoare triple {2745#true} ~x := #in~x; {2745#true} is VALID [2022-02-21 03:02:34,099 INFO L290 TraceCheckUtils]: 77: Hoare triple {2745#true} assume ~x <= 0;#res := 0; {2834#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:34,099 INFO L290 TraceCheckUtils]: 78: Hoare triple {2834#(<= |f_#res| 0)} assume true; {2834#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:34,100 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {2834#(<= |f_#res| 0)} {2745#true} #53#return; {2827#(<= |g_#t~ret2| 0)} is VALID [2022-02-21 03:02:34,100 INFO L290 TraceCheckUtils]: 80: Hoare triple {2827#(<= |g_#t~ret2| 0)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2827#(<= |g_#t~ret2| 0)} is VALID [2022-02-21 03:02:34,100 INFO L290 TraceCheckUtils]: 81: Hoare triple {2827#(<= |g_#t~ret2| 0)} assume ~x - 3 <= 2147483647; {2827#(<= |g_#t~ret2| 0)} is VALID [2022-02-21 03:02:34,101 INFO L290 TraceCheckUtils]: 82: Hoare triple {2827#(<= |g_#t~ret2| 0)} assume ~x - 3 >= -2147483648; {2827#(<= |g_#t~ret2| 0)} is VALID [2022-02-21 03:02:34,101 INFO L272 TraceCheckUtils]: 83: Hoare triple {2827#(<= |g_#t~ret2| 0)} call #t~ret3 := f(~x - 3); {2745#true} is VALID [2022-02-21 03:02:34,101 INFO L290 TraceCheckUtils]: 84: Hoare triple {2745#true} ~x := #in~x; {2745#true} is VALID [2022-02-21 03:02:34,101 INFO L290 TraceCheckUtils]: 85: Hoare triple {2745#true} assume ~x <= 0;#res := 0; {2834#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:34,101 INFO L290 TraceCheckUtils]: 86: Hoare triple {2834#(<= |f_#res| 0)} assume true; {2834#(<= |f_#res| 0)} is VALID [2022-02-21 03:02:34,102 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {2834#(<= |f_#res| 0)} {2827#(<= |g_#t~ret2| 0)} #55#return; {2832#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} is VALID [2022-02-21 03:02:34,103 INFO L290 TraceCheckUtils]: 88: Hoare triple {2832#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2832#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} is VALID [2022-02-21 03:02:34,103 INFO L290 TraceCheckUtils]: 89: Hoare triple {2832#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} assume #t~ret2 + #t~ret3 <= 2147483647; {2832#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} is VALID [2022-02-21 03:02:34,103 INFO L290 TraceCheckUtils]: 90: Hoare triple {2832#(<= (+ |g_#t~ret3| |g_#t~ret2|) 0)} assume #t~ret2 + #t~ret3 >= -2147483648;#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {2833#(<= |g_#res| 0)} is VALID [2022-02-21 03:02:34,104 INFO L290 TraceCheckUtils]: 91: Hoare triple {2833#(<= |g_#res| 0)} assume true; {2833#(<= |g_#res| 0)} is VALID [2022-02-21 03:02:34,104 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {2833#(<= |g_#res| 0)} {2791#(<= |f_#t~ret0| 0)} #51#return; {2814#(<= (+ |f_#t~ret1| |f_#t~ret0|) 0)} is VALID [2022-02-21 03:02:34,105 INFO L290 TraceCheckUtils]: 93: Hoare triple {2814#(<= (+ |f_#t~ret1| |f_#t~ret0|) 0)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2814#(<= (+ |f_#t~ret1| |f_#t~ret0|) 0)} is VALID [2022-02-21 03:02:34,105 INFO L290 TraceCheckUtils]: 94: Hoare triple {2814#(<= (+ |f_#t~ret1| |f_#t~ret0|) 0)} assume !(#t~ret0 + #t~ret1 <= 2147483647); {2746#false} is VALID [2022-02-21 03:02:34,105 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-02-21 03:02:34,106 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:34,106 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137867191] [2022-02-21 03:02:34,106 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137867191] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:34,106 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:34,106 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-21 03:02:34,106 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872724827] [2022-02-21 03:02:34,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:34,107 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 95 [2022-02-21 03:02:34,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:34,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:02:34,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:34,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 03:02:34,137 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:34,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:02:34,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:02:34,138 INFO L87 Difference]: Start difference. First operand 100 states and 124 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:02:34,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:34,318 INFO L93 Difference]: Finished difference Result 100 states and 124 transitions. [2022-02-21 03:02:34,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:02:34,318 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 95 [2022-02-21 03:02:34,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:34,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:02:34,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2022-02-21 03:02:34,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:02:34,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2022-02-21 03:02:34,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 36 transitions. [2022-02-21 03:02:34,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:34,347 INFO L225 Difference]: With dead ends: 100 [2022-02-21 03:02:34,347 INFO L226 Difference]: Without dead ends: 98 [2022-02-21 03:02:34,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:02:34,348 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:34,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 153 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:34,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-02-21 03:02:34,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-02-21 03:02:34,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:34,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 98 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (25), 16 states have call predecessors, (25), 13 states have call successors, (25) [2022-02-21 03:02:34,397 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 98 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (25), 16 states have call predecessors, (25), 13 states have call successors, (25) [2022-02-21 03:02:34,397 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 98 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (25), 16 states have call predecessors, (25), 13 states have call successors, (25) [2022-02-21 03:02:34,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:34,400 INFO L93 Difference]: Finished difference Result 98 states and 119 transitions. [2022-02-21 03:02:34,400 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2022-02-21 03:02:34,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:34,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:34,401 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (25), 16 states have call predecessors, (25), 13 states have call successors, (25) Second operand 98 states. [2022-02-21 03:02:34,401 INFO L87 Difference]: Start difference. First operand has 98 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (25), 16 states have call predecessors, (25), 13 states have call successors, (25) Second operand 98 states. [2022-02-21 03:02:34,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:34,404 INFO L93 Difference]: Finished difference Result 98 states and 119 transitions. [2022-02-21 03:02:34,404 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2022-02-21 03:02:34,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:34,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:34,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:34,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:34,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (25), 16 states have call predecessors, (25), 13 states have call successors, (25) [2022-02-21 03:02:34,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2022-02-21 03:02:34,408 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 95 [2022-02-21 03:02:34,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:34,408 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2022-02-21 03:02:34,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:02:34,409 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2022-02-21 03:02:34,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-02-21 03:02:34,409 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:34,409 INFO L514 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:34,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-21 03:02:34,410 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2022-02-21 03:02:34,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:34,410 INFO L85 PathProgramCache]: Analyzing trace with hash -2107733600, now seen corresponding path program 1 times [2022-02-21 03:02:34,410 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:34,410 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392852773] [2022-02-21 03:02:34,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:34,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:34,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-21 03:02:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:34,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 03:02:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:34,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {3284#true} assume ~x <= 0;#res := 0; {3284#true} is VALID [2022-02-21 03:02:34,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-02-21 03:02:34,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3284#true} {3284#true} #53#return; {3284#true} is VALID [2022-02-21 03:02:34,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:02:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:34,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {3284#true} assume ~x <= 0;#res := 0; {3284#true} is VALID [2022-02-21 03:02:34,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-02-21 03:02:34,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3284#true} {3284#true} #55#return; {3284#true} is VALID [2022-02-21 03:02:34,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {3284#true} assume !(~x <= 0); {3284#true} is VALID [2022-02-21 03:02:34,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {3284#true} assume ~x - 2 <= 2147483647; {3284#true} is VALID [2022-02-21 03:02:34,526 INFO L290 TraceCheckUtils]: 3: Hoare triple {3284#true} assume ~x - 2 >= -2147483648; {3284#true} is VALID [2022-02-21 03:02:34,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {3284#true} call #t~ret2 := f(~x - 2); {3284#true} is VALID [2022-02-21 03:02:34,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {3284#true} assume ~x <= 0;#res := 0; {3284#true} is VALID [2022-02-21 03:02:34,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-02-21 03:02:34,526 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {3284#true} {3284#true} #53#return; {3284#true} is VALID [2022-02-21 03:02:34,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {3284#true} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3284#true} is VALID [2022-02-21 03:02:34,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {3284#true} assume ~x - 3 <= 2147483647; {3284#true} is VALID [2022-02-21 03:02:34,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {3284#true} assume ~x - 3 >= -2147483648; {3284#true} is VALID [2022-02-21 03:02:34,526 INFO L272 TraceCheckUtils]: 12: Hoare triple {3284#true} call #t~ret3 := f(~x - 3); {3284#true} is VALID [2022-02-21 03:02:34,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {3284#true} assume ~x <= 0;#res := 0; {3284#true} is VALID [2022-02-21 03:02:34,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-02-21 03:02:34,527 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3284#true} {3284#true} #55#return; {3284#true} is VALID [2022-02-21 03:02:34,527 INFO L290 TraceCheckUtils]: 17: Hoare triple {3284#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3284#true} is VALID [2022-02-21 03:02:34,527 INFO L290 TraceCheckUtils]: 18: Hoare triple {3284#true} assume #t~ret2 + #t~ret3 <= 2147483647; {3284#true} is VALID [2022-02-21 03:02:34,527 INFO L290 TraceCheckUtils]: 19: Hoare triple {3284#true} assume #t~ret2 + #t~ret3 >= -2147483648;#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {3284#true} is VALID [2022-02-21 03:02:34,527 INFO L290 TraceCheckUtils]: 20: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-02-21 03:02:34,527 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3284#true} {3284#true} #49#return; {3284#true} is VALID [2022-02-21 03:02:34,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-02-21 03:02:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:34,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 03:02:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:34,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {3284#true} assume ~x <= 0;#res := 0; {3373#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:34,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {3373#(<= 0 |f_#res|)} assume true; {3373#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:34,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3373#(<= 0 |f_#res|)} {3284#true} #53#return; {3366#(<= 0 |g_#t~ret2|)} is VALID [2022-02-21 03:02:34,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:02:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:34,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {3284#true} assume ~x <= 0;#res := 0; {3373#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:34,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {3373#(<= 0 |f_#res|)} assume true; {3373#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:34,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3373#(<= 0 |f_#res|)} {3366#(<= 0 |g_#t~ret2|)} #55#return; {3371#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} is VALID [2022-02-21 03:02:34,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {3284#true} assume !(~x <= 0); {3284#true} is VALID [2022-02-21 03:02:34,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {3284#true} assume ~x - 2 <= 2147483647; {3284#true} is VALID [2022-02-21 03:02:34,575 INFO L290 TraceCheckUtils]: 3: Hoare triple {3284#true} assume ~x - 2 >= -2147483648; {3284#true} is VALID [2022-02-21 03:02:34,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {3284#true} call #t~ret2 := f(~x - 2); {3284#true} is VALID [2022-02-21 03:02:34,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {3284#true} assume ~x <= 0;#res := 0; {3373#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:34,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {3373#(<= 0 |f_#res|)} assume true; {3373#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:34,576 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {3373#(<= 0 |f_#res|)} {3284#true} #53#return; {3366#(<= 0 |g_#t~ret2|)} is VALID [2022-02-21 03:02:34,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {3366#(<= 0 |g_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3366#(<= 0 |g_#t~ret2|)} is VALID [2022-02-21 03:02:34,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {3366#(<= 0 |g_#t~ret2|)} assume ~x - 3 <= 2147483647; {3366#(<= 0 |g_#t~ret2|)} is VALID [2022-02-21 03:02:34,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {3366#(<= 0 |g_#t~ret2|)} assume ~x - 3 >= -2147483648; {3366#(<= 0 |g_#t~ret2|)} is VALID [2022-02-21 03:02:34,577 INFO L272 TraceCheckUtils]: 12: Hoare triple {3366#(<= 0 |g_#t~ret2|)} call #t~ret3 := f(~x - 3); {3284#true} is VALID [2022-02-21 03:02:34,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {3284#true} assume ~x <= 0;#res := 0; {3373#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:34,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {3373#(<= 0 |f_#res|)} assume true; {3373#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:34,579 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3373#(<= 0 |f_#res|)} {3366#(<= 0 |g_#t~ret2|)} #55#return; {3371#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} is VALID [2022-02-21 03:02:34,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {3371#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3371#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} is VALID [2022-02-21 03:02:34,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {3371#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} assume #t~ret2 + #t~ret3 <= 2147483647; {3371#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} is VALID [2022-02-21 03:02:34,580 INFO L290 TraceCheckUtils]: 19: Hoare triple {3371#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} assume #t~ret2 + #t~ret3 >= -2147483648;#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {3372#(<= 0 |g_#res|)} is VALID [2022-02-21 03:02:34,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {3372#(<= 0 |g_#res|)} assume true; {3372#(<= 0 |g_#res|)} is VALID [2022-02-21 03:02:34,580 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3372#(<= 0 |g_#res|)} {3284#true} #49#return; {3330#(<= 0 |f_#t~ret0|)} is VALID [2022-02-21 03:02:34,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-02-21 03:02:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:34,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 03:02:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:34,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {3284#true} assume ~x <= 0;#res := 0; {3373#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:34,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {3373#(<= 0 |f_#res|)} assume true; {3373#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:34,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3373#(<= 0 |f_#res|)} {3284#true} #53#return; {3366#(<= 0 |g_#t~ret2|)} is VALID [2022-02-21 03:02:34,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:02:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:34,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {3284#true} assume ~x <= 0;#res := 0; {3373#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:34,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {3373#(<= 0 |f_#res|)} assume true; {3373#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:34,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3373#(<= 0 |f_#res|)} {3366#(<= 0 |g_#t~ret2|)} #55#return; {3371#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} is VALID [2022-02-21 03:02:34,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {3284#true} assume !(~x <= 0); {3284#true} is VALID [2022-02-21 03:02:34,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {3284#true} assume ~x - 2 <= 2147483647; {3284#true} is VALID [2022-02-21 03:02:34,616 INFO L290 TraceCheckUtils]: 3: Hoare triple {3284#true} assume ~x - 2 >= -2147483648; {3284#true} is VALID [2022-02-21 03:02:34,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {3284#true} call #t~ret2 := f(~x - 2); {3284#true} is VALID [2022-02-21 03:02:34,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {3284#true} assume ~x <= 0;#res := 0; {3373#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:34,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {3373#(<= 0 |f_#res|)} assume true; {3373#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:34,617 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {3373#(<= 0 |f_#res|)} {3284#true} #53#return; {3366#(<= 0 |g_#t~ret2|)} is VALID [2022-02-21 03:02:34,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {3366#(<= 0 |g_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3366#(<= 0 |g_#t~ret2|)} is VALID [2022-02-21 03:02:34,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {3366#(<= 0 |g_#t~ret2|)} assume ~x - 3 <= 2147483647; {3366#(<= 0 |g_#t~ret2|)} is VALID [2022-02-21 03:02:34,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {3366#(<= 0 |g_#t~ret2|)} assume ~x - 3 >= -2147483648; {3366#(<= 0 |g_#t~ret2|)} is VALID [2022-02-21 03:02:34,618 INFO L272 TraceCheckUtils]: 12: Hoare triple {3366#(<= 0 |g_#t~ret2|)} call #t~ret3 := f(~x - 3); {3284#true} is VALID [2022-02-21 03:02:34,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {3284#true} assume ~x <= 0;#res := 0; {3373#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:34,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {3373#(<= 0 |f_#res|)} assume true; {3373#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:34,620 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3373#(<= 0 |f_#res|)} {3366#(<= 0 |g_#t~ret2|)} #55#return; {3371#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} is VALID [2022-02-21 03:02:34,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {3371#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3371#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} is VALID [2022-02-21 03:02:34,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {3371#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} assume #t~ret2 + #t~ret3 <= 2147483647; {3371#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} is VALID [2022-02-21 03:02:34,621 INFO L290 TraceCheckUtils]: 19: Hoare triple {3371#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} assume #t~ret2 + #t~ret3 >= -2147483648;#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {3372#(<= 0 |g_#res|)} is VALID [2022-02-21 03:02:34,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {3372#(<= 0 |g_#res|)} assume true; {3372#(<= 0 |g_#res|)} is VALID [2022-02-21 03:02:34,622 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3372#(<= 0 |g_#res|)} {3330#(<= 0 |f_#t~ret0|)} #51#return; {3353#(<= 0 (+ |f_#t~ret1| |f_#t~ret0|))} is VALID [2022-02-21 03:02:34,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {3284#true} assume { :begin_inline_ULTIMATE.init } true; {3284#true} is VALID [2022-02-21 03:02:34,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {3284#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; {3284#true} is VALID [2022-02-21 03:02:34,623 INFO L272 TraceCheckUtils]: 2: Hoare triple {3284#true} call main_#t~ret5#1 := g(main_~x~0#1); {3284#true} is VALID [2022-02-21 03:02:34,623 INFO L290 TraceCheckUtils]: 3: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,623 INFO L290 TraceCheckUtils]: 4: Hoare triple {3284#true} assume !(~x <= 0); {3284#true} is VALID [2022-02-21 03:02:34,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {3284#true} assume ~x - 2 <= 2147483647; {3284#true} is VALID [2022-02-21 03:02:34,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {3284#true} assume ~x - 2 >= -2147483648; {3284#true} is VALID [2022-02-21 03:02:34,623 INFO L272 TraceCheckUtils]: 7: Hoare triple {3284#true} call #t~ret2 := f(~x - 2); {3284#true} is VALID [2022-02-21 03:02:34,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {3284#true} assume !(~x <= 0); {3284#true} is VALID [2022-02-21 03:02:34,624 INFO L272 TraceCheckUtils]: 10: Hoare triple {3284#true} call #t~ret0 := g(~x); {3284#true} is VALID [2022-02-21 03:02:34,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,624 INFO L290 TraceCheckUtils]: 12: Hoare triple {3284#true} assume !(~x <= 0); {3284#true} is VALID [2022-02-21 03:02:34,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {3284#true} assume ~x - 2 <= 2147483647; {3284#true} is VALID [2022-02-21 03:02:34,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {3284#true} assume ~x - 2 >= -2147483648; {3284#true} is VALID [2022-02-21 03:02:34,624 INFO L272 TraceCheckUtils]: 15: Hoare triple {3284#true} call #t~ret2 := f(~x - 2); {3284#true} is VALID [2022-02-21 03:02:34,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,624 INFO L290 TraceCheckUtils]: 17: Hoare triple {3284#true} assume !(~x <= 0); {3284#true} is VALID [2022-02-21 03:02:34,624 INFO L272 TraceCheckUtils]: 18: Hoare triple {3284#true} call #t~ret0 := g(~x); {3284#true} is VALID [2022-02-21 03:02:34,624 INFO L290 TraceCheckUtils]: 19: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {3284#true} assume !(~x <= 0); {3284#true} is VALID [2022-02-21 03:02:34,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {3284#true} assume ~x - 2 <= 2147483647; {3284#true} is VALID [2022-02-21 03:02:34,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {3284#true} assume ~x - 2 >= -2147483648; {3284#true} is VALID [2022-02-21 03:02:34,625 INFO L272 TraceCheckUtils]: 23: Hoare triple {3284#true} call #t~ret2 := f(~x - 2); {3284#true} is VALID [2022-02-21 03:02:34,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,625 INFO L290 TraceCheckUtils]: 25: Hoare triple {3284#true} assume ~x <= 0;#res := 0; {3284#true} is VALID [2022-02-21 03:02:34,625 INFO L290 TraceCheckUtils]: 26: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-02-21 03:02:34,625 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3284#true} {3284#true} #53#return; {3284#true} is VALID [2022-02-21 03:02:34,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {3284#true} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3284#true} is VALID [2022-02-21 03:02:34,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {3284#true} assume ~x - 3 <= 2147483647; {3284#true} is VALID [2022-02-21 03:02:34,625 INFO L290 TraceCheckUtils]: 30: Hoare triple {3284#true} assume ~x - 3 >= -2147483648; {3284#true} is VALID [2022-02-21 03:02:34,626 INFO L272 TraceCheckUtils]: 31: Hoare triple {3284#true} call #t~ret3 := f(~x - 3); {3284#true} is VALID [2022-02-21 03:02:34,626 INFO L290 TraceCheckUtils]: 32: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,626 INFO L290 TraceCheckUtils]: 33: Hoare triple {3284#true} assume ~x <= 0;#res := 0; {3284#true} is VALID [2022-02-21 03:02:34,626 INFO L290 TraceCheckUtils]: 34: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-02-21 03:02:34,626 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3284#true} {3284#true} #55#return; {3284#true} is VALID [2022-02-21 03:02:34,626 INFO L290 TraceCheckUtils]: 36: Hoare triple {3284#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3284#true} is VALID [2022-02-21 03:02:34,626 INFO L290 TraceCheckUtils]: 37: Hoare triple {3284#true} assume #t~ret2 + #t~ret3 <= 2147483647; {3284#true} is VALID [2022-02-21 03:02:34,626 INFO L290 TraceCheckUtils]: 38: Hoare triple {3284#true} assume #t~ret2 + #t~ret3 >= -2147483648;#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {3284#true} is VALID [2022-02-21 03:02:34,626 INFO L290 TraceCheckUtils]: 39: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-02-21 03:02:34,626 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3284#true} {3284#true} #49#return; {3284#true} is VALID [2022-02-21 03:02:34,631 INFO L290 TraceCheckUtils]: 41: Hoare triple {3284#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3284#true} is VALID [2022-02-21 03:02:34,631 INFO L290 TraceCheckUtils]: 42: Hoare triple {3284#true} assume 1 + ~x <= 2147483647; {3284#true} is VALID [2022-02-21 03:02:34,631 INFO L290 TraceCheckUtils]: 43: Hoare triple {3284#true} assume 1 + ~x >= -2147483648; {3284#true} is VALID [2022-02-21 03:02:34,631 INFO L272 TraceCheckUtils]: 44: Hoare triple {3284#true} call #t~ret1 := g(1 + ~x); {3284#true} is VALID [2022-02-21 03:02:34,632 INFO L290 TraceCheckUtils]: 45: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,632 INFO L290 TraceCheckUtils]: 46: Hoare triple {3284#true} assume !(~x <= 0); {3284#true} is VALID [2022-02-21 03:02:34,632 INFO L290 TraceCheckUtils]: 47: Hoare triple {3284#true} assume ~x - 2 <= 2147483647; {3284#true} is VALID [2022-02-21 03:02:34,632 INFO L290 TraceCheckUtils]: 48: Hoare triple {3284#true} assume ~x - 2 >= -2147483648; {3284#true} is VALID [2022-02-21 03:02:34,632 INFO L272 TraceCheckUtils]: 49: Hoare triple {3284#true} call #t~ret2 := f(~x - 2); {3284#true} is VALID [2022-02-21 03:02:34,632 INFO L290 TraceCheckUtils]: 50: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,632 INFO L290 TraceCheckUtils]: 51: Hoare triple {3284#true} assume !(~x <= 0); {3284#true} is VALID [2022-02-21 03:02:34,632 INFO L272 TraceCheckUtils]: 52: Hoare triple {3284#true} call #t~ret0 := g(~x); {3284#true} is VALID [2022-02-21 03:02:34,632 INFO L290 TraceCheckUtils]: 53: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,632 INFO L290 TraceCheckUtils]: 54: Hoare triple {3284#true} assume !(~x <= 0); {3284#true} is VALID [2022-02-21 03:02:34,632 INFO L290 TraceCheckUtils]: 55: Hoare triple {3284#true} assume ~x - 2 <= 2147483647; {3284#true} is VALID [2022-02-21 03:02:34,632 INFO L290 TraceCheckUtils]: 56: Hoare triple {3284#true} assume ~x - 2 >= -2147483648; {3284#true} is VALID [2022-02-21 03:02:34,632 INFO L272 TraceCheckUtils]: 57: Hoare triple {3284#true} call #t~ret2 := f(~x - 2); {3284#true} is VALID [2022-02-21 03:02:34,632 INFO L290 TraceCheckUtils]: 58: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,633 INFO L290 TraceCheckUtils]: 59: Hoare triple {3284#true} assume ~x <= 0;#res := 0; {3373#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:34,633 INFO L290 TraceCheckUtils]: 60: Hoare triple {3373#(<= 0 |f_#res|)} assume true; {3373#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:34,635 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3373#(<= 0 |f_#res|)} {3284#true} #53#return; {3366#(<= 0 |g_#t~ret2|)} is VALID [2022-02-21 03:02:34,635 INFO L290 TraceCheckUtils]: 62: Hoare triple {3366#(<= 0 |g_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3366#(<= 0 |g_#t~ret2|)} is VALID [2022-02-21 03:02:34,636 INFO L290 TraceCheckUtils]: 63: Hoare triple {3366#(<= 0 |g_#t~ret2|)} assume ~x - 3 <= 2147483647; {3366#(<= 0 |g_#t~ret2|)} is VALID [2022-02-21 03:02:34,636 INFO L290 TraceCheckUtils]: 64: Hoare triple {3366#(<= 0 |g_#t~ret2|)} assume ~x - 3 >= -2147483648; {3366#(<= 0 |g_#t~ret2|)} is VALID [2022-02-21 03:02:34,636 INFO L272 TraceCheckUtils]: 65: Hoare triple {3366#(<= 0 |g_#t~ret2|)} call #t~ret3 := f(~x - 3); {3284#true} is VALID [2022-02-21 03:02:34,636 INFO L290 TraceCheckUtils]: 66: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,637 INFO L290 TraceCheckUtils]: 67: Hoare triple {3284#true} assume ~x <= 0;#res := 0; {3373#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:34,637 INFO L290 TraceCheckUtils]: 68: Hoare triple {3373#(<= 0 |f_#res|)} assume true; {3373#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:34,637 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {3373#(<= 0 |f_#res|)} {3366#(<= 0 |g_#t~ret2|)} #55#return; {3371#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} is VALID [2022-02-21 03:02:34,638 INFO L290 TraceCheckUtils]: 70: Hoare triple {3371#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3371#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} is VALID [2022-02-21 03:02:34,638 INFO L290 TraceCheckUtils]: 71: Hoare triple {3371#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} assume #t~ret2 + #t~ret3 <= 2147483647; {3371#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} is VALID [2022-02-21 03:02:34,639 INFO L290 TraceCheckUtils]: 72: Hoare triple {3371#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} assume #t~ret2 + #t~ret3 >= -2147483648;#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {3372#(<= 0 |g_#res|)} is VALID [2022-02-21 03:02:34,639 INFO L290 TraceCheckUtils]: 73: Hoare triple {3372#(<= 0 |g_#res|)} assume true; {3372#(<= 0 |g_#res|)} is VALID [2022-02-21 03:02:34,640 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {3372#(<= 0 |g_#res|)} {3284#true} #49#return; {3330#(<= 0 |f_#t~ret0|)} is VALID [2022-02-21 03:02:34,640 INFO L290 TraceCheckUtils]: 75: Hoare triple {3330#(<= 0 |f_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3330#(<= 0 |f_#t~ret0|)} is VALID [2022-02-21 03:02:34,641 INFO L290 TraceCheckUtils]: 76: Hoare triple {3330#(<= 0 |f_#t~ret0|)} assume 1 + ~x <= 2147483647; {3330#(<= 0 |f_#t~ret0|)} is VALID [2022-02-21 03:02:34,641 INFO L290 TraceCheckUtils]: 77: Hoare triple {3330#(<= 0 |f_#t~ret0|)} assume 1 + ~x >= -2147483648; {3330#(<= 0 |f_#t~ret0|)} is VALID [2022-02-21 03:02:34,641 INFO L272 TraceCheckUtils]: 78: Hoare triple {3330#(<= 0 |f_#t~ret0|)} call #t~ret1 := g(1 + ~x); {3284#true} is VALID [2022-02-21 03:02:34,641 INFO L290 TraceCheckUtils]: 79: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,641 INFO L290 TraceCheckUtils]: 80: Hoare triple {3284#true} assume !(~x <= 0); {3284#true} is VALID [2022-02-21 03:02:34,641 INFO L290 TraceCheckUtils]: 81: Hoare triple {3284#true} assume ~x - 2 <= 2147483647; {3284#true} is VALID [2022-02-21 03:02:34,641 INFO L290 TraceCheckUtils]: 82: Hoare triple {3284#true} assume ~x - 2 >= -2147483648; {3284#true} is VALID [2022-02-21 03:02:34,641 INFO L272 TraceCheckUtils]: 83: Hoare triple {3284#true} call #t~ret2 := f(~x - 2); {3284#true} is VALID [2022-02-21 03:02:34,641 INFO L290 TraceCheckUtils]: 84: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,642 INFO L290 TraceCheckUtils]: 85: Hoare triple {3284#true} assume ~x <= 0;#res := 0; {3373#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:34,642 INFO L290 TraceCheckUtils]: 86: Hoare triple {3373#(<= 0 |f_#res|)} assume true; {3373#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:34,642 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {3373#(<= 0 |f_#res|)} {3284#true} #53#return; {3366#(<= 0 |g_#t~ret2|)} is VALID [2022-02-21 03:02:34,643 INFO L290 TraceCheckUtils]: 88: Hoare triple {3366#(<= 0 |g_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3366#(<= 0 |g_#t~ret2|)} is VALID [2022-02-21 03:02:34,643 INFO L290 TraceCheckUtils]: 89: Hoare triple {3366#(<= 0 |g_#t~ret2|)} assume ~x - 3 <= 2147483647; {3366#(<= 0 |g_#t~ret2|)} is VALID [2022-02-21 03:02:34,643 INFO L290 TraceCheckUtils]: 90: Hoare triple {3366#(<= 0 |g_#t~ret2|)} assume ~x - 3 >= -2147483648; {3366#(<= 0 |g_#t~ret2|)} is VALID [2022-02-21 03:02:34,643 INFO L272 TraceCheckUtils]: 91: Hoare triple {3366#(<= 0 |g_#t~ret2|)} call #t~ret3 := f(~x - 3); {3284#true} is VALID [2022-02-21 03:02:34,643 INFO L290 TraceCheckUtils]: 92: Hoare triple {3284#true} ~x := #in~x; {3284#true} is VALID [2022-02-21 03:02:34,644 INFO L290 TraceCheckUtils]: 93: Hoare triple {3284#true} assume ~x <= 0;#res := 0; {3373#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:34,644 INFO L290 TraceCheckUtils]: 94: Hoare triple {3373#(<= 0 |f_#res|)} assume true; {3373#(<= 0 |f_#res|)} is VALID [2022-02-21 03:02:34,645 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {3373#(<= 0 |f_#res|)} {3366#(<= 0 |g_#t~ret2|)} #55#return; {3371#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} is VALID [2022-02-21 03:02:34,645 INFO L290 TraceCheckUtils]: 96: Hoare triple {3371#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3371#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} is VALID [2022-02-21 03:02:34,645 INFO L290 TraceCheckUtils]: 97: Hoare triple {3371#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} assume #t~ret2 + #t~ret3 <= 2147483647; {3371#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} is VALID [2022-02-21 03:02:34,646 INFO L290 TraceCheckUtils]: 98: Hoare triple {3371#(<= 0 (+ |g_#t~ret3| |g_#t~ret2|))} assume #t~ret2 + #t~ret3 >= -2147483648;#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {3372#(<= 0 |g_#res|)} is VALID [2022-02-21 03:02:34,646 INFO L290 TraceCheckUtils]: 99: Hoare triple {3372#(<= 0 |g_#res|)} assume true; {3372#(<= 0 |g_#res|)} is VALID [2022-02-21 03:02:34,646 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {3372#(<= 0 |g_#res|)} {3330#(<= 0 |f_#t~ret0|)} #51#return; {3353#(<= 0 (+ |f_#t~ret1| |f_#t~ret0|))} is VALID [2022-02-21 03:02:34,647 INFO L290 TraceCheckUtils]: 101: Hoare triple {3353#(<= 0 (+ |f_#t~ret1| |f_#t~ret0|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3353#(<= 0 (+ |f_#t~ret1| |f_#t~ret0|))} is VALID [2022-02-21 03:02:34,647 INFO L290 TraceCheckUtils]: 102: Hoare triple {3353#(<= 0 (+ |f_#t~ret1| |f_#t~ret0|))} assume #t~ret0 + #t~ret1 <= 2147483647; {3353#(<= 0 (+ |f_#t~ret1| |f_#t~ret0|))} is VALID [2022-02-21 03:02:34,647 INFO L290 TraceCheckUtils]: 103: Hoare triple {3353#(<= 0 (+ |f_#t~ret1| |f_#t~ret0|))} assume !(#t~ret0 + #t~ret1 >= -2147483648); {3285#false} is VALID [2022-02-21 03:02:34,649 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-02-21 03:02:34,649 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:34,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392852773] [2022-02-21 03:02:34,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392852773] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:34,649 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:34,649 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-21 03:02:34,649 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130180805] [2022-02-21 03:02:34,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:34,650 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 104 [2022-02-21 03:02:34,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:34,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:02:34,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:34,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 03:02:34,678 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:34,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:02:34,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:02:34,679 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:02:34,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:34,847 INFO L93 Difference]: Finished difference Result 98 states and 119 transitions. [2022-02-21 03:02:34,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:02:34,848 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 104 [2022-02-21 03:02:34,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:34,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:02:34,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2022-02-21 03:02:34,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:02:34,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2022-02-21 03:02:34,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 34 transitions. [2022-02-21 03:02:34,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:34,873 INFO L225 Difference]: With dead ends: 98 [2022-02-21 03:02:34,873 INFO L226 Difference]: Without dead ends: 0 [2022-02-21 03:02:34,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:02:34,874 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:34,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 153 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:34,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-21 03:02:34,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-21 03:02:34,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:34,876 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:34,876 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:34,876 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:34,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:34,876 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:02:34,876 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:02:34,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:34,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:34,877 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:34,877 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:34,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:34,877 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:02:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:02:34,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:34,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:34,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:34,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:34,878 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:34,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 03:02:34,878 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2022-02-21 03:02:34,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:34,878 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:02:34,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:02:34,878 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:02:34,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:34,880 INFO L764 garLoopResultBuilder]: Registering result SAFE for location fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2022-02-21 03:02:34,881 INFO L764 garLoopResultBuilder]: Registering result SAFE for location fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2022-02-21 03:02:34,881 INFO L764 garLoopResultBuilder]: Registering result SAFE for location fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2022-02-21 03:02:34,881 INFO L764 garLoopResultBuilder]: Registering result SAFE for location fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2022-02-21 03:02:34,881 INFO L764 garLoopResultBuilder]: Registering result SAFE for location gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2022-02-21 03:02:34,881 INFO L764 garLoopResultBuilder]: Registering result SAFE for location gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2022-02-21 03:02:34,882 INFO L764 garLoopResultBuilder]: Registering result SAFE for location gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2022-02-21 03:02:34,882 INFO L764 garLoopResultBuilder]: Registering result SAFE for location gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2022-02-21 03:02:34,882 INFO L764 garLoopResultBuilder]: Registering result SAFE for location gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2022-02-21 03:02:34,882 INFO L764 garLoopResultBuilder]: Registering result SAFE for location gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2022-02-21 03:02:34,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-21 03:02:34,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-21 03:02:35,022 INFO L858 garLoopResultBuilder]: For program point fFINAL(lines 11 15) no Hoare annotation was computed. [2022-02-21 03:02:35,023 INFO L854 garLoopResultBuilder]: At program point L14(line 14) the Hoare annotation is: (and (not (<= |f_#in~x| 0)) (or (and (<= |f_#in~x| f_~x) (<= f_~x 2147483645)) (not (<= |f_#in~x| 2147483645)))) [2022-02-21 03:02:35,023 INFO L858 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-02-21 03:02:35,023 INFO L858 garLoopResultBuilder]: For program point L14-1(line 14) no Hoare annotation was computed. [2022-02-21 03:02:35,023 INFO L858 garLoopResultBuilder]: For program point L14-2(line 14) no Hoare annotation was computed. [2022-02-21 03:02:35,023 INFO L858 garLoopResultBuilder]: For program point L14-3(line 14) no Hoare annotation was computed. [2022-02-21 03:02:35,023 INFO L854 garLoopResultBuilder]: At program point L14-4(line 14) the Hoare annotation is: (and (or (not (<= |f_#in~x| 2147483645)) (and (<= 0 |f_#t~ret0|) (<= |f_#in~x| f_~x) (<= f_~x 2147483645) (<= |f_#t~ret0| 0))) (not (<= |f_#in~x| 0))) [2022-02-21 03:02:35,023 INFO L858 garLoopResultBuilder]: For program point L14-5(line 14) no Hoare annotation was computed. [2022-02-21 03:02:35,023 INFO L858 garLoopResultBuilder]: For program point fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-02-21 03:02:35,023 INFO L858 garLoopResultBuilder]: For program point fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-02-21 03:02:35,023 INFO L858 garLoopResultBuilder]: For program point L14-6(line 14) no Hoare annotation was computed. [2022-02-21 03:02:35,023 INFO L858 garLoopResultBuilder]: For program point fEXIT(lines 11 15) no Hoare annotation was computed. [2022-02-21 03:02:35,024 INFO L858 garLoopResultBuilder]: For program point L14-7(line 14) no Hoare annotation was computed. [2022-02-21 03:02:35,024 INFO L861 garLoopResultBuilder]: At program point fENTRY(lines 11 15) the Hoare annotation is: true [2022-02-21 03:02:35,024 INFO L858 garLoopResultBuilder]: For program point fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-02-21 03:02:35,024 INFO L858 garLoopResultBuilder]: For program point fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2022-02-21 03:02:35,024 INFO L858 garLoopResultBuilder]: For program point gFINAL(lines 17 21) no Hoare annotation was computed. [2022-02-21 03:02:35,024 INFO L858 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-02-21 03:02:35,024 INFO L858 garLoopResultBuilder]: For program point L19(lines 19 20) no Hoare annotation was computed. [2022-02-21 03:02:35,024 INFO L858 garLoopResultBuilder]: For program point L20-1(line 20) no Hoare annotation was computed. [2022-02-21 03:02:35,024 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:35,024 INFO L858 garLoopResultBuilder]: For program point L20-3(line 20) no Hoare annotation was computed. [2022-02-21 03:02:35,024 INFO L858 garLoopResultBuilder]: For program point L20-4(line 20) no Hoare annotation was computed. [2022-02-21 03:02:35,024 INFO L858 garLoopResultBuilder]: For program point L20-5(line 20) no Hoare annotation was computed. [2022-02-21 03:02:35,024 INFO L854 garLoopResultBuilder]: At program point L20-6(line 20) the Hoare annotation is: (or (not (<= |g_#in~x| 2147483647)) (and (= |g_#in~x| g_~x) (<= 1 g_~x) (<= |g_#t~ret2| 0) (<= 0 |g_#t~ret2|))) [2022-02-21 03:02:35,025 INFO L858 garLoopResultBuilder]: For program point L20-7(line 20) no Hoare annotation was computed. [2022-02-21 03:02:35,025 INFO L858 garLoopResultBuilder]: For program point L20-8(line 20) no Hoare annotation was computed. [2022-02-21 03:02:35,025 INFO L858 garLoopResultBuilder]: For program point L20-9(line 20) no Hoare annotation was computed. [2022-02-21 03:02:35,025 INFO L858 garLoopResultBuilder]: For program point gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-02-21 03:02:35,025 INFO L858 garLoopResultBuilder]: For program point gEXIT(lines 17 21) no Hoare annotation was computed. [2022-02-21 03:02:35,025 INFO L858 garLoopResultBuilder]: For program point gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-02-21 03:02:35,025 INFO L861 garLoopResultBuilder]: At program point gENTRY(lines 17 21) the Hoare annotation is: true [2022-02-21 03:02:35,025 INFO L858 garLoopResultBuilder]: For program point gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-02-21 03:02:35,025 INFO L858 garLoopResultBuilder]: For program point gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-02-21 03:02:35,025 INFO L858 garLoopResultBuilder]: For program point gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-02-21 03:02:35,025 INFO L858 garLoopResultBuilder]: For program point gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-02-21 03:02:35,025 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-21 03:02:35,025 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-21 03:02:35,025 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-21 03:02:35,025 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-21 03:02:35,026 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:35,026 INFO L858 garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed. [2022-02-21 03:02:35,026 INFO L858 garLoopResultBuilder]: For program point L24(lines 24 27) no Hoare annotation was computed. [2022-02-21 03:02:35,028 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:35,030 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:02:35,032 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-21 03:02:35,032 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-21 03:02:35,032 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-21 03:02:35,032 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-21 03:02:35,032 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-21 03:02:35,033 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-21 03:02:35,033 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-21 03:02:35,033 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-21 03:02:35,033 WARN L170 areAnnotationChecker]: fFINAL has no Hoare annotation [2022-02-21 03:02:35,033 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2022-02-21 03:02:35,033 WARN L170 areAnnotationChecker]: gFINAL has no Hoare annotation [2022-02-21 03:02:35,033 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-21 03:02:35,033 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-21 03:02:35,033 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-21 03:02:35,033 WARN L170 areAnnotationChecker]: fEXIT has no Hoare annotation [2022-02-21 03:02:35,033 WARN L170 areAnnotationChecker]: fEXIT has no Hoare annotation [2022-02-21 03:02:35,033 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2022-02-21 03:02:35,033 WARN L170 areAnnotationChecker]: gEXIT has no Hoare annotation [2022-02-21 03:02:35,033 WARN L170 areAnnotationChecker]: gEXIT has no Hoare annotation [2022-02-21 03:02:35,033 WARN L170 areAnnotationChecker]: gEXIT has no Hoare annotation [2022-02-21 03:02:35,033 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-21 03:02:35,033 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-21 03:02:35,033 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-21 03:02:35,033 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2022-02-21 03:02:35,033 WARN L170 areAnnotationChecker]: L20-7 has no Hoare annotation [2022-02-21 03:02:35,033 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-02-21 03:02:35,033 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-02-21 03:02:35,033 WARN L170 areAnnotationChecker]: L14-5 has no Hoare annotation [2022-02-21 03:02:35,034 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2022-02-21 03:02:35,034 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-21 03:02:35,034 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2022-02-21 03:02:35,034 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2022-02-21 03:02:35,034 WARN L170 areAnnotationChecker]: L20-8 has no Hoare annotation [2022-02-21 03:02:35,034 WARN L170 areAnnotationChecker]: L20-8 has no Hoare annotation [2022-02-21 03:02:35,034 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2022-02-21 03:02:35,034 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2022-02-21 03:02:35,034 WARN L170 areAnnotationChecker]: L14-6 has no Hoare annotation [2022-02-21 03:02:35,034 WARN L170 areAnnotationChecker]: L14-6 has no Hoare annotation [2022-02-21 03:02:35,034 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:02:35,034 WARN L170 areAnnotationChecker]: L20-5 has no Hoare annotation [2022-02-21 03:02:35,034 WARN L170 areAnnotationChecker]: L20-5 has no Hoare annotation [2022-02-21 03:02:35,034 WARN L170 areAnnotationChecker]: L20-9 has no Hoare annotation [2022-02-21 03:02:35,034 WARN L170 areAnnotationChecker]: L20-9 has no Hoare annotation [2022-02-21 03:02:35,034 WARN L170 areAnnotationChecker]: L14-5 has no Hoare annotation [2022-02-21 03:02:35,034 WARN L170 areAnnotationChecker]: L14-7 has no Hoare annotation [2022-02-21 03:02:35,034 WARN L170 areAnnotationChecker]: L14-7 has no Hoare annotation [2022-02-21 03:02:35,034 WARN L170 areAnnotationChecker]: L20-7 has no Hoare annotation [2022-02-21 03:02:35,034 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:35,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 03:02:35 BoogieIcfgContainer [2022-02-21 03:02:35,035 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 03:02:35,035 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:02:35,035 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:02:35,035 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:02:35,036 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:35,038 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-21 03:02:35,041 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2022-02-21 03:02:35,041 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2022-02-21 03:02:35,044 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-02-21 03:02:35,044 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-02-21 03:02:35,044 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-21 03:02:35,064 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:02:35,064 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:02:35,065 INFO L158 Benchmark]: Toolchain (without parser) took 5757.55ms. Allocated memory was 86.0MB in the beginning and 151.0MB in the end (delta: 65.0MB). Free memory was 52.5MB in the beginning and 55.2MB in the end (delta: -2.7MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB. [2022-02-21 03:02:35,065 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 86.0MB. Free memory is still 49.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:02:35,066 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.75ms. Allocated memory was 86.0MB in the beginning and 123.7MB in the end (delta: 37.7MB). Free memory was 52.3MB in the beginning and 100.3MB in the end (delta: -48.0MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2022-02-21 03:02:35,066 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.36ms. Allocated memory is still 123.7MB. Free memory was 100.0MB in the beginning and 98.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:02:35,066 INFO L158 Benchmark]: Boogie Preprocessor took 21.41ms. Allocated memory is still 123.7MB. Free memory was 98.8MB in the beginning and 97.9MB in the end (delta: 938.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:02:35,066 INFO L158 Benchmark]: RCFGBuilder took 317.90ms. Allocated memory is still 123.7MB. Free memory was 97.9MB in the beginning and 86.0MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:02:35,066 INFO L158 Benchmark]: TraceAbstraction took 5167.60ms. Allocated memory was 123.7MB in the beginning and 151.0MB in the end (delta: 27.3MB). Free memory was 85.6MB in the beginning and 57.3MB in the end (delta: 28.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2022-02-21 03:02:35,067 INFO L158 Benchmark]: Witness Printer took 29.25ms. Allocated memory is still 151.0MB. Free memory was 57.3MB in the beginning and 55.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:02:35,068 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 86.0MB. Free memory is still 49.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.75ms. Allocated memory was 86.0MB in the beginning and 123.7MB in the end (delta: 37.7MB). Free memory was 52.3MB in the beginning and 100.3MB in the end (delta: -48.0MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.36ms. Allocated memory is still 123.7MB. Free memory was 100.0MB in the beginning and 98.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.41ms. Allocated memory is still 123.7MB. Free memory was 98.8MB in the beginning and 97.9MB in the end (delta: 938.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 317.90ms. Allocated memory is still 123.7MB. Free memory was 97.9MB in the beginning and 86.0MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5167.60ms. Allocated memory was 123.7MB in the beginning and 151.0MB in the end (delta: 27.3MB). Free memory was 85.6MB in the beginning and 57.3MB in the end (delta: 28.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Witness Printer took 29.25ms. Allocated memory is still 151.0MB. Free memory was 57.3MB in the beginning and 55.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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: 5.1s, OverallIterations: 9, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 271 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 253 mSDsluCounter, 1209 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 922 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 525 IncrementalHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 287 mSDtfsCounter, 525 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=7, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 58 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 73 PreInvPairs, 88 NumberOfFragments, 75 HoareAnnotationTreeSize, 73 FomulaSimplifications, 42 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 176 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 355 NumberOfCodeBlocks, 355 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 377 ConstructedInterpolants, 0 QuantifiedInterpolants, 690 SizeOfPredicates, 2 NumberOfNonLiveVariables, 68 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 417/422 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:35,101 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