./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_2c.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/NestedRecursion_2c.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 e757bed859e5dfb8bc677e07409ebb4da6a15dd0898403a302646229a6409be5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:02:38,031 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:02:38,033 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:02:38,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:02:38,056 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:02:38,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:02:38,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:02:38,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:02:38,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:02:38,062 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:02:38,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:02:38,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:02:38,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:02:38,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:02:38,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:02:38,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:02:38,070 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:02:38,073 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:02:38,075 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:02:38,076 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:02:38,077 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:02:38,080 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:02:38,081 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:02:38,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:02:38,090 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:02:38,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:02:38,094 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:02:38,095 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:02:38,095 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:02:38,096 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:02:38,097 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:02:38,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:02:38,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:02:38,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:02:38,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:02:38,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:02:38,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:02:38,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:02:38,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:02:38,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:02:38,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:02:38,103 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:38,131 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:02:38,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:02:38,131 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:02:38,132 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:02:38,132 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:02:38,132 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:02:38,133 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:02:38,133 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:02:38,133 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:02:38,133 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:02:38,137 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:02:38,137 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:02:38,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:02:38,137 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:02:38,137 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:02:38,137 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:02:38,138 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:02:38,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:02:38,138 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:02:38,138 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:02:38,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:02:38,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:02:38,138 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:02:38,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:02:38,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:02:38,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:02:38,139 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:02:38,140 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:02:38,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:02:38,141 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:02:38,141 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 -> e757bed859e5dfb8bc677e07409ebb4da6a15dd0898403a302646229a6409be5 [2022-02-21 03:02:38,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:02:38,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:02:38,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:02:38,388 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:02:38,389 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:02:38,390 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_2c.c [2022-02-21 03:02:38,439 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ce29569a/b8654c5e1b43454c9bbeadbc373012a1/FLAG07efc53ee [2022-02-21 03:02:38,822 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:02:38,829 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_2c.c [2022-02-21 03:02:38,837 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ce29569a/b8654c5e1b43454c9bbeadbc373012a1/FLAG07efc53ee [2022-02-21 03:02:38,850 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ce29569a/b8654c5e1b43454c9bbeadbc373012a1 [2022-02-21 03:02:38,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:02:38,854 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:02:38,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:02:38,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:02:38,859 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:02:38,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:02:38" (1/1) ... [2022-02-21 03:02:38,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@228a1170 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:38, skipping insertion in model container [2022-02-21 03:02:38,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:02:38" (1/1) ... [2022-02-21 03:02:38,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:02:38,879 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:02:39,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:02:39,003 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:02:39,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:02:39,028 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:02:39,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:39 WrapperNode [2022-02-21 03:02:39,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:02:39,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:02:39,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:02:39,030 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:02:39,036 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:39" (1/1) ... [2022-02-21 03:02:39,039 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:39" (1/1) ... [2022-02-21 03:02:39,053 INFO L137 Inliner]: procedures = 5, calls = 5, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 11 [2022-02-21 03:02:39,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:02:39,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:02:39,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:02:39,054 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:02:39,060 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:39" (1/1) ... [2022-02-21 03:02:39,060 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:39" (1/1) ... [2022-02-21 03:02:39,061 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:39" (1/1) ... [2022-02-21 03:02:39,062 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:39" (1/1) ... [2022-02-21 03:02:39,064 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:39" (1/1) ... [2022-02-21 03:02:39,066 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:39" (1/1) ... [2022-02-21 03:02:39,069 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:39" (1/1) ... [2022-02-21 03:02:39,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:02:39,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:02:39,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:02:39,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:02:39,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:39" (1/1) ... [2022-02-21 03:02:39,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:02:39,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:39,109 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:39,123 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:39,137 INFO L130 BoogieDeclarations]: Found specification of procedure g [2022-02-21 03:02:39,137 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2022-02-21 03:02:39,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:02:39,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:02:39,177 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:02:39,178 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:02:39,307 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:02:39,312 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:02:39,312 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 03:02:39,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:02:39 BoogieIcfgContainer [2022-02-21 03:02:39,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:02:39,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:02:39,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:02:39,331 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:02:39,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:02:38" (1/3) ... [2022-02-21 03:02:39,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67692f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:02:39, skipping insertion in model container [2022-02-21 03:02:39,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:39" (2/3) ... [2022-02-21 03:02:39,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67692f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:02:39, skipping insertion in model container [2022-02-21 03:02:39,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:02:39" (3/3) ... [2022-02-21 03:02:39,333 INFO L111 eAbstractionObserver]: Analyzing ICFG NestedRecursion_2c.c [2022-02-21 03:02:39,336 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:02:39,336 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-21 03:02:39,395 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:02:39,400 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:39,401 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-21 03:02:39,426 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:02:39,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 03:02:39,430 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:39,430 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:39,431 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:02:39,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:39,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1134721268, now seen corresponding path program 1 times [2022-02-21 03:02:39,442 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:39,443 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8169359] [2022-02-21 03:02:39,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:39,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:39,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#true} assume { :begin_inline_ULTIMATE.init } true; {27#true} is VALID [2022-02-21 03:02:39,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {29#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:02:39,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} assume !(main_~x~0#1 < 0); {29#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:02:39,628 INFO L272 TraceCheckUtils]: 3: Hoare triple {29#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} call main_#t~ret3#1 := g(main_~x~0#1); {30#(<= |g_#in~x| 2147483647)} is VALID [2022-02-21 03:02:39,628 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#(<= |g_#in~x| 2147483647)} ~x := #in~x; {31#(<= g_~x 2147483647)} is VALID [2022-02-21 03:02:39,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#(<= g_~x 2147483647)} assume !(0 == ~x); {31#(<= g_~x 2147483647)} is VALID [2022-02-21 03:02:39,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#(<= g_~x 2147483647)} assume !(~x - 1 <= 2147483647); {28#false} is VALID [2022-02-21 03:02:39,631 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:39,632 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:39,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8169359] [2022-02-21 03:02:39,634 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8169359] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:39,634 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:39,635 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:02:39,638 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396624220] [2022-02-21 03:02:39,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:39,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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:39,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:39,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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:39,660 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:39,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:02:39,662 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:39,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:02:39,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:02:39,685 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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:39,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:39,884 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-02-21 03:02:39,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:02:39,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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:39,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:39,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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:39,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-02-21 03:02:39,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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:39,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-02-21 03:02:39,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2022-02-21 03:02:39,944 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:39,953 INFO L225 Difference]: With dead ends: 42 [2022-02-21 03:02:39,953 INFO L226 Difference]: Without dead ends: 37 [2022-02-21 03:02:39,955 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:39,960 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 29 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:39,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 67 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:39,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-21 03:02:39,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2022-02-21 03:02:39,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:39,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 32 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 25 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:02:39,992 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 32 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 25 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:02:39,993 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 32 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 25 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:02:40,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:40,007 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-02-21 03:02:40,007 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-02-21 03:02:40,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:40,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:40,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 25 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 37 states. [2022-02-21 03:02:40,010 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 25 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 37 states. [2022-02-21 03:02:40,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:40,018 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-02-21 03:02:40,018 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-02-21 03:02:40,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:40,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:40,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:40,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:40,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 25 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:02:40,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-02-21 03:02:40,035 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 7 [2022-02-21 03:02:40,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:40,036 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-02-21 03:02:40,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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:40,036 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-02-21 03:02:40,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-21 03:02:40,037 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:40,037 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:40,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:02:40,037 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:02:40,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:40,038 INFO L85 PathProgramCache]: Analyzing trace with hash 816620978, now seen corresponding path program 1 times [2022-02-21 03:02:40,038 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:40,039 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058935281] [2022-02-21 03:02:40,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:40,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:40,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {199#true} assume { :begin_inline_ULTIMATE.init } true; {199#true} is VALID [2022-02-21 03:02:40,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {199#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {199#true} is VALID [2022-02-21 03:02:40,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {199#true} assume !(main_~x~0#1 < 0); {201#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:02:40,070 INFO L272 TraceCheckUtils]: 3: Hoare triple {201#(<= 0 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret3#1 := g(main_~x~0#1); {202#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:02:40,071 INFO L290 TraceCheckUtils]: 4: Hoare triple {202#(<= 0 |g_#in~x|)} ~x := #in~x; {203#(<= 0 g_~x)} is VALID [2022-02-21 03:02:40,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {203#(<= 0 g_~x)} assume !(0 == ~x); {203#(<= 0 g_~x)} is VALID [2022-02-21 03:02:40,072 INFO L290 TraceCheckUtils]: 6: Hoare triple {203#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {203#(<= 0 g_~x)} is VALID [2022-02-21 03:02:40,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {203#(<= 0 g_~x)} assume !(~x - 1 >= -2147483648); {200#false} is VALID [2022-02-21 03:02:40,073 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:40,073 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:40,073 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058935281] [2022-02-21 03:02:40,073 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058935281] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:40,073 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:40,074 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:02:40,074 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598523615] [2022-02-21 03:02:40,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:40,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 8 [2022-02-21 03:02:40,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:40,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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:40,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:40,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:02:40,082 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:40,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:02:40,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:02:40,083 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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:40,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:40,196 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2022-02-21 03:02:40,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:02:40,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 8 [2022-02-21 03:02:40,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:40,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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:40,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-02-21 03:02:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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:40,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-02-21 03:02:40,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-02-21 03:02:40,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:40,245 INFO L225 Difference]: With dead ends: 51 [2022-02-21 03:02:40,246 INFO L226 Difference]: Without dead ends: 47 [2022-02-21 03:02:40,246 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:40,247 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 22 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:40,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 65 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:40,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-21 03:02:40,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2022-02-21 03:02:40,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:40,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 41 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 32 states have internal predecessors, (39), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:02:40,262 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 41 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 32 states have internal predecessors, (39), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:02:40,262 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 41 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 32 states have internal predecessors, (39), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:02:40,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:40,265 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-02-21 03:02:40,265 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-02-21 03:02:40,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:40,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:40,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 32 states have internal predecessors, (39), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 47 states. [2022-02-21 03:02:40,267 INFO L87 Difference]: Start difference. First operand has 41 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 32 states have internal predecessors, (39), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 47 states. [2022-02-21 03:02:40,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:40,270 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-02-21 03:02:40,270 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-02-21 03:02:40,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:40,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:40,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:40,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:40,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 32 states have internal predecessors, (39), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:02:40,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-02-21 03:02:40,273 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 8 [2022-02-21 03:02:40,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:40,273 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-02-21 03:02:40,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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:40,274 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-02-21 03:02:40,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-21 03:02:40,274 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:40,274 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:40,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:02:40,275 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:02:40,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:40,276 INFO L85 PathProgramCache]: Analyzing trace with hash 496687761, now seen corresponding path program 1 times [2022-02-21 03:02:40,276 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:40,276 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290566251] [2022-02-21 03:02:40,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:40,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:40,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {414#true} assume { :begin_inline_ULTIMATE.init } true; {414#true} is VALID [2022-02-21 03:02:40,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {414#true} is VALID [2022-02-21 03:02:40,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume !(main_~x~0#1 < 0); {416#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:02:40,352 INFO L272 TraceCheckUtils]: 3: Hoare triple {416#(<= 0 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret3#1 := g(main_~x~0#1); {417#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:02:40,353 INFO L290 TraceCheckUtils]: 4: Hoare triple {417#(<= 0 |g_#in~x|)} ~x := #in~x; {418#(<= 0 g_~x)} is VALID [2022-02-21 03:02:40,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {418#(<= 0 g_~x)} assume !(0 == ~x); {418#(<= 0 g_~x)} is VALID [2022-02-21 03:02:40,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {418#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {418#(<= 0 g_~x)} is VALID [2022-02-21 03:02:40,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {418#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {418#(<= 0 g_~x)} is VALID [2022-02-21 03:02:40,355 INFO L272 TraceCheckUtils]: 8: Hoare triple {418#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {419#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:02:40,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {419#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {420#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:40,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {420#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {420#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:40,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {420#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {420#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:40,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {420#(<= 0 (+ g_~x 1))} assume !(~x - 1 >= -2147483648); {415#false} is VALID [2022-02-21 03:02:40,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:40,358 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:40,359 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290566251] [2022-02-21 03:02:40,359 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290566251] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:02:40,359 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304819995] [2022-02-21 03:02:40,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:40,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:40,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:40,374 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:40,391 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:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:40,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:02:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:40,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:02:40,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {414#true} assume { :begin_inline_ULTIMATE.init } true; {414#true} is VALID [2022-02-21 03:02:40,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {414#true} is VALID [2022-02-21 03:02:40,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume !(main_~x~0#1 < 0); {416#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:02:40,581 INFO L272 TraceCheckUtils]: 3: Hoare triple {416#(<= 0 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret3#1 := g(main_~x~0#1); {417#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:02:40,581 INFO L290 TraceCheckUtils]: 4: Hoare triple {417#(<= 0 |g_#in~x|)} ~x := #in~x; {418#(<= 0 g_~x)} is VALID [2022-02-21 03:02:40,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {418#(<= 0 g_~x)} assume !(0 == ~x); {418#(<= 0 g_~x)} is VALID [2022-02-21 03:02:40,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {418#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {418#(<= 0 g_~x)} is VALID [2022-02-21 03:02:40,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {418#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {418#(<= 0 g_~x)} is VALID [2022-02-21 03:02:40,585 INFO L272 TraceCheckUtils]: 8: Hoare triple {418#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {419#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:02:40,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {419#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {420#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:40,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {420#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {420#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:40,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {420#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {420#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:40,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {420#(<= 0 (+ g_~x 1))} assume !(~x - 1 >= -2147483648); {415#false} is VALID [2022-02-21 03:02:40,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:40,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:02:40,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {460#(<= 0 (+ 2147483647 g_~x))} assume !(~x - 1 >= -2147483648); {415#false} is VALID [2022-02-21 03:02:40,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {460#(<= 0 (+ 2147483647 g_~x))} assume ~x - 1 <= 2147483647; {460#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:40,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {460#(<= 0 (+ 2147483647 g_~x))} assume !(0 == ~x); {460#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:40,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {470#(<= 0 (+ 2147483647 |g_#in~x|))} ~x := #in~x; {460#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:40,762 INFO L272 TraceCheckUtils]: 8: Hoare triple {474#(<= 0 (+ g_~x 2147483646))} call #t~ret0 := g(~x - 1); {470#(<= 0 (+ 2147483647 |g_#in~x|))} is VALID [2022-02-21 03:02:40,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 >= -2147483648; {474#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:40,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {474#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 <= 2147483647; {474#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:40,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#(<= 0 (+ g_~x 2147483646))} assume !(0 == ~x); {474#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:40,764 INFO L290 TraceCheckUtils]: 4: Hoare triple {487#(<= 0 (+ |g_#in~x| 2147483646))} ~x := #in~x; {474#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:40,765 INFO L272 TraceCheckUtils]: 3: Hoare triple {491#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483646))} call main_#t~ret3#1 := g(main_~x~0#1); {487#(<= 0 (+ |g_#in~x| 2147483646))} is VALID [2022-02-21 03:02:40,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume !(main_~x~0#1 < 0); {491#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483646))} is VALID [2022-02-21 03:02:40,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {414#true} is VALID [2022-02-21 03:02:40,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {414#true} assume { :begin_inline_ULTIMATE.init } true; {414#true} is VALID [2022-02-21 03:02:40,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:40,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304819995] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:02:40,776 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:02:40,776 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-02-21 03:02:40,777 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155326236] [2022-02-21 03:02:40,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:02:40,777 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-21 03:02:40,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:40,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:40,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:40,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-21 03:02:40,810 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:40,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:02:40,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:02:40,813 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 12 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:41,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:41,360 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-02-21 03:02:41,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-21 03:02:41,360 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-21 03:02:41,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:41,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:41,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 98 transitions. [2022-02-21 03:02:41,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:41,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 98 transitions. [2022-02-21 03:02:41,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 98 transitions. [2022-02-21 03:02:41,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:41,470 INFO L225 Difference]: With dead ends: 96 [2022-02-21 03:02:41,470 INFO L226 Difference]: Without dead ends: 95 [2022-02-21 03:02:41,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2022-02-21 03:02:41,475 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 127 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:41,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 126 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:02:41,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-21 03:02:41,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2022-02-21 03:02:41,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:41,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 77 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 59 states have internal predecessors, (75), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-21 03:02:41,521 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 77 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 59 states have internal predecessors, (75), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-21 03:02:41,521 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 77 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 59 states have internal predecessors, (75), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-21 03:02:41,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:41,528 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2022-02-21 03:02:41,529 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2022-02-21 03:02:41,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:41,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:41,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 59 states have internal predecessors, (75), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 95 states. [2022-02-21 03:02:41,534 INFO L87 Difference]: Start difference. First operand has 77 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 59 states have internal predecessors, (75), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 95 states. [2022-02-21 03:02:41,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:41,544 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2022-02-21 03:02:41,544 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2022-02-21 03:02:41,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:41,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:41,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:41,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:41,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 59 states have internal predecessors, (75), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-21 03:02:41,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 99 transitions. [2022-02-21 03:02:41,549 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 99 transitions. Word has length 13 [2022-02-21 03:02:41,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:41,550 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 99 transitions. [2022-02-21 03:02:41,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:41,550 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2022-02-21 03:02:41,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-21 03:02:41,551 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:41,551 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:41,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:02:41,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:41,760 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:02:41,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:41,760 INFO L85 PathProgramCache]: Analyzing trace with hash 574996991, now seen corresponding path program 1 times [2022-02-21 03:02:41,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:41,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888421571] [2022-02-21 03:02:41,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:41,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:41,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:02:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:41,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {915#true} ~x := #in~x; {915#true} is VALID [2022-02-21 03:02:41,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {915#true} assume 0 == ~x;#res := 1; {915#true} is VALID [2022-02-21 03:02:41,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {915#true} assume true; {915#true} is VALID [2022-02-21 03:02:41,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {915#true} {915#true} #32#return; {915#true} is VALID [2022-02-21 03:02:41,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {915#true} assume { :begin_inline_ULTIMATE.init } true; {915#true} is VALID [2022-02-21 03:02:41,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {915#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {915#true} is VALID [2022-02-21 03:02:41,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {915#true} assume !(main_~x~0#1 < 0); {915#true} is VALID [2022-02-21 03:02:41,793 INFO L272 TraceCheckUtils]: 3: Hoare triple {915#true} call main_#t~ret3#1 := g(main_~x~0#1); {915#true} is VALID [2022-02-21 03:02:41,793 INFO L290 TraceCheckUtils]: 4: Hoare triple {915#true} ~x := #in~x; {915#true} is VALID [2022-02-21 03:02:41,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {915#true} assume !(0 == ~x); {915#true} is VALID [2022-02-21 03:02:41,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {915#true} assume ~x - 1 <= 2147483647; {915#true} is VALID [2022-02-21 03:02:41,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {915#true} assume ~x - 1 >= -2147483648; {915#true} is VALID [2022-02-21 03:02:41,793 INFO L272 TraceCheckUtils]: 8: Hoare triple {915#true} call #t~ret0 := g(~x - 1); {915#true} is VALID [2022-02-21 03:02:41,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {915#true} ~x := #in~x; {915#true} is VALID [2022-02-21 03:02:41,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {915#true} assume 0 == ~x;#res := 1; {915#true} is VALID [2022-02-21 03:02:41,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {915#true} assume true; {915#true} is VALID [2022-02-21 03:02:41,794 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {915#true} {915#true} #32#return; {915#true} is VALID [2022-02-21 03:02:41,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {915#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {921#(<= |g_#t~ret0| 2147483647)} is VALID [2022-02-21 03:02:41,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {921#(<= |g_#t~ret0| 2147483647)} assume !(#t~ret0 - 1 <= 2147483647); {916#false} is VALID [2022-02-21 03:02:41,794 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:41,795 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:41,795 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888421571] [2022-02-21 03:02:41,795 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888421571] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:41,795 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:41,795 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:02:41,795 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653423315] [2022-02-21 03:02:41,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:41,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-21 03:02:41,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:41,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:41,803 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:41,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:02:41,804 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:41,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:02:41,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:02:41,804 INFO L87 Difference]: Start difference. First operand 77 states and 99 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:41,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:41,860 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2022-02-21 03:02:41,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:02:41,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-21 03:02:41,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:41,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:41,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-02-21 03:02:41,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:41,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-02-21 03:02:41,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 22 transitions. [2022-02-21 03:02:41,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:41,878 INFO L225 Difference]: With dead ends: 77 [2022-02-21 03:02:41,878 INFO L226 Difference]: Without dead ends: 76 [2022-02-21 03:02:41,879 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:41,879 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 33 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:41,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 33 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:41,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-02-21 03:02:41,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-02-21 03:02:41,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:41,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 58 states have internal predecessors, (69), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-21 03:02:41,916 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 58 states have internal predecessors, (69), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-21 03:02:41,917 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 58 states have internal predecessors, (69), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-21 03:02:41,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:41,919 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-02-21 03:02:41,919 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-02-21 03:02:41,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:41,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:41,925 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 58 states have internal predecessors, (69), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 76 states. [2022-02-21 03:02:41,926 INFO L87 Difference]: Start difference. First operand has 76 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 58 states have internal predecessors, (69), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 76 states. [2022-02-21 03:02:41,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:41,930 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-02-21 03:02:41,930 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-02-21 03:02:41,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:41,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:41,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:41,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:41,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 58 states have internal predecessors, (69), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-21 03:02:41,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2022-02-21 03:02:41,936 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 15 [2022-02-21 03:02:41,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:41,937 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2022-02-21 03:02:41,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:41,938 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-02-21 03:02:41,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-21 03:02:41,938 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:41,938 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:41,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:02:41,939 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:02:41,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:41,940 INFO L85 PathProgramCache]: Analyzing trace with hash 645037581, now seen corresponding path program 1 times [2022-02-21 03:02:41,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:41,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252708989] [2022-02-21 03:02:41,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:41,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:42,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:02:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:42,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {1267#true} ~x := #in~x; {1267#true} is VALID [2022-02-21 03:02:42,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {1267#true} assume 0 == ~x;#res := 1; {1274#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:42,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {1274#(<= 1 |g_#res|)} assume true; {1274#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:42,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1274#(<= 1 |g_#res|)} {1267#true} #32#return; {1273#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:42,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {1267#true} assume { :begin_inline_ULTIMATE.init } true; {1267#true} is VALID [2022-02-21 03:02:42,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {1267#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {1267#true} is VALID [2022-02-21 03:02:42,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {1267#true} assume !(main_~x~0#1 < 0); {1267#true} is VALID [2022-02-21 03:02:42,046 INFO L272 TraceCheckUtils]: 3: Hoare triple {1267#true} call main_#t~ret3#1 := g(main_~x~0#1); {1267#true} is VALID [2022-02-21 03:02:42,046 INFO L290 TraceCheckUtils]: 4: Hoare triple {1267#true} ~x := #in~x; {1267#true} is VALID [2022-02-21 03:02:42,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {1267#true} assume !(0 == ~x); {1267#true} is VALID [2022-02-21 03:02:42,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {1267#true} assume ~x - 1 <= 2147483647; {1267#true} is VALID [2022-02-21 03:02:42,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {1267#true} assume ~x - 1 >= -2147483648; {1267#true} is VALID [2022-02-21 03:02:42,047 INFO L272 TraceCheckUtils]: 8: Hoare triple {1267#true} call #t~ret0 := g(~x - 1); {1267#true} is VALID [2022-02-21 03:02:42,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {1267#true} ~x := #in~x; {1267#true} is VALID [2022-02-21 03:02:42,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {1267#true} assume 0 == ~x;#res := 1; {1274#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:42,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {1274#(<= 1 |g_#res|)} assume true; {1274#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:42,048 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1274#(<= 1 |g_#res|)} {1267#true} #32#return; {1273#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:42,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {1273#(<= 1 |g_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1273#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:42,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {1273#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 <= 2147483647; {1273#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:42,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {1273#(<= 1 |g_#t~ret0|)} assume !(#t~ret0 - 1 >= -2147483648); {1268#false} is VALID [2022-02-21 03:02:42,049 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:42,050 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:42,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252708989] [2022-02-21 03:02:42,050 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252708989] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:42,050 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:42,050 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:02:42,050 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136050369] [2022-02-21 03:02:42,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:42,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-21 03:02:42,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:42,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:42,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:42,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:02:42,061 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:42,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:02:42,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:02:42,062 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:42,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:42,145 INFO L93 Difference]: Finished difference Result 116 states and 154 transitions. [2022-02-21 03:02:42,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:02:42,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-21 03:02:42,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:42,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:42,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-02-21 03:02:42,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:42,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-02-21 03:02:42,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-02-21 03:02:42,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:42,167 INFO L225 Difference]: With dead ends: 116 [2022-02-21 03:02:42,167 INFO L226 Difference]: Without dead ends: 115 [2022-02-21 03:02:42,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:02:42,168 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:42,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 52 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:42,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-02-21 03:02:42,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104. [2022-02-21 03:02:42,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:42,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 104 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 80 states have internal predecessors, (92), 13 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (22), 17 states have call predecessors, (22), 11 states have call successors, (22) [2022-02-21 03:02:42,206 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 104 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 80 states have internal predecessors, (92), 13 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (22), 17 states have call predecessors, (22), 11 states have call successors, (22) [2022-02-21 03:02:42,206 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 104 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 80 states have internal predecessors, (92), 13 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (22), 17 states have call predecessors, (22), 11 states have call successors, (22) [2022-02-21 03:02:42,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:42,211 INFO L93 Difference]: Finished difference Result 115 states and 148 transitions. [2022-02-21 03:02:42,211 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 148 transitions. [2022-02-21 03:02:42,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:42,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:42,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 80 states have internal predecessors, (92), 13 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (22), 17 states have call predecessors, (22), 11 states have call successors, (22) Second operand 115 states. [2022-02-21 03:02:42,213 INFO L87 Difference]: Start difference. First operand has 104 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 80 states have internal predecessors, (92), 13 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (22), 17 states have call predecessors, (22), 11 states have call successors, (22) Second operand 115 states. [2022-02-21 03:02:42,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:42,217 INFO L93 Difference]: Finished difference Result 115 states and 148 transitions. [2022-02-21 03:02:42,217 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 148 transitions. [2022-02-21 03:02:42,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:42,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:42,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:42,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:42,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 80 states have internal predecessors, (92), 13 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (22), 17 states have call predecessors, (22), 11 states have call successors, (22) [2022-02-21 03:02:42,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 127 transitions. [2022-02-21 03:02:42,222 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 127 transitions. Word has length 16 [2022-02-21 03:02:42,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:42,222 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 127 transitions. [2022-02-21 03:02:42,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:42,223 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 127 transitions. [2022-02-21 03:02:42,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-21 03:02:42,223 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:42,223 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:42,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 03:02:42,224 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:02:42,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:42,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1915238450, now seen corresponding path program 1 times [2022-02-21 03:02:42,225 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:42,225 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703496049] [2022-02-21 03:02:42,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:42,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:42,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:02:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:42,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {1771#true} ~x := #in~x; {1771#true} is VALID [2022-02-21 03:02:42,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} assume 0 == ~x;#res := 1; {1780#(<= |g_#res| 1)} is VALID [2022-02-21 03:02:42,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {1780#(<= |g_#res| 1)} assume true; {1780#(<= |g_#res| 1)} is VALID [2022-02-21 03:02:42,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1780#(<= |g_#res| 1)} {1771#true} #32#return; {1777#(<= |g_#t~ret0| 1)} is VALID [2022-02-21 03:02:42,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {1771#true} assume { :begin_inline_ULTIMATE.init } true; {1771#true} is VALID [2022-02-21 03:02:42,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {1771#true} is VALID [2022-02-21 03:02:42,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} assume !(main_~x~0#1 < 0); {1771#true} is VALID [2022-02-21 03:02:42,268 INFO L272 TraceCheckUtils]: 3: Hoare triple {1771#true} call main_#t~ret3#1 := g(main_~x~0#1); {1771#true} is VALID [2022-02-21 03:02:42,268 INFO L290 TraceCheckUtils]: 4: Hoare triple {1771#true} ~x := #in~x; {1771#true} is VALID [2022-02-21 03:02:42,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {1771#true} assume !(0 == ~x); {1771#true} is VALID [2022-02-21 03:02:42,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {1771#true} assume ~x - 1 <= 2147483647; {1771#true} is VALID [2022-02-21 03:02:42,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {1771#true} assume ~x - 1 >= -2147483648; {1771#true} is VALID [2022-02-21 03:02:42,268 INFO L272 TraceCheckUtils]: 8: Hoare triple {1771#true} call #t~ret0 := g(~x - 1); {1771#true} is VALID [2022-02-21 03:02:42,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {1771#true} ~x := #in~x; {1771#true} is VALID [2022-02-21 03:02:42,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {1771#true} assume 0 == ~x;#res := 1; {1780#(<= |g_#res| 1)} is VALID [2022-02-21 03:02:42,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {1780#(<= |g_#res| 1)} assume true; {1780#(<= |g_#res| 1)} is VALID [2022-02-21 03:02:42,270 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1780#(<= |g_#res| 1)} {1771#true} #32#return; {1777#(<= |g_#t~ret0| 1)} is VALID [2022-02-21 03:02:42,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {1777#(<= |g_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1777#(<= |g_#t~ret0| 1)} is VALID [2022-02-21 03:02:42,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {1777#(<= |g_#t~ret0| 1)} assume #t~ret0 - 1 <= 2147483647; {1777#(<= |g_#t~ret0| 1)} is VALID [2022-02-21 03:02:42,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {1777#(<= |g_#t~ret0| 1)} assume #t~ret0 - 1 >= -2147483648; {1777#(<= |g_#t~ret0| 1)} is VALID [2022-02-21 03:02:42,271 INFO L272 TraceCheckUtils]: 16: Hoare triple {1777#(<= |g_#t~ret0| 1)} call #t~ret1 := g(#t~ret0 - 1); {1778#(<= |g_#in~x| 0)} is VALID [2022-02-21 03:02:42,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {1778#(<= |g_#in~x| 0)} ~x := #in~x; {1779#(<= g_~x 0)} is VALID [2022-02-21 03:02:42,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {1779#(<= g_~x 0)} assume !(0 == ~x); {1779#(<= g_~x 0)} is VALID [2022-02-21 03:02:42,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {1779#(<= g_~x 0)} assume !(~x - 1 <= 2147483647); {1772#false} is VALID [2022-02-21 03:02:42,272 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:02:42,273 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:42,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703496049] [2022-02-21 03:02:42,273 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703496049] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:42,273 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:42,273 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:02:42,273 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407173343] [2022-02-21 03:02:42,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:42,274 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 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 20 [2022-02-21 03:02:42,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:42,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 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:42,284 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:42,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:02:42,284 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:42,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:02:42,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:02:42,285 INFO L87 Difference]: Start difference. First operand 104 states and 127 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 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:42,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:42,539 INFO L93 Difference]: Finished difference Result 137 states and 175 transitions. [2022-02-21 03:02:42,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 03:02:42,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 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 20 [2022-02-21 03:02:42,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:42,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 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:42,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-02-21 03:02:42,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 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:42,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-02-21 03:02:42,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 58 transitions. [2022-02-21 03:02:42,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:42,612 INFO L225 Difference]: With dead ends: 137 [2022-02-21 03:02:42,612 INFO L226 Difference]: Without dead ends: 136 [2022-02-21 03:02:42,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:02:42,613 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 31 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:42,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 83 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:02:42,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-02-21 03:02:42,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2022-02-21 03:02:42,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:42,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 128 states, 91 states have (on average 1.1868131868131868) internal successors, (108), 100 states have internal predecessors, (108), 22 states have call successors, (22), 7 states have call predecessors, (22), 12 states have return successors, (38), 20 states have call predecessors, (38), 19 states have call successors, (38) [2022-02-21 03:02:42,676 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 128 states, 91 states have (on average 1.1868131868131868) internal successors, (108), 100 states have internal predecessors, (108), 22 states have call successors, (22), 7 states have call predecessors, (22), 12 states have return successors, (38), 20 states have call predecessors, (38), 19 states have call successors, (38) [2022-02-21 03:02:42,677 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 128 states, 91 states have (on average 1.1868131868131868) internal successors, (108), 100 states have internal predecessors, (108), 22 states have call successors, (22), 7 states have call predecessors, (22), 12 states have return successors, (38), 20 states have call predecessors, (38), 19 states have call successors, (38) [2022-02-21 03:02:42,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:42,681 INFO L93 Difference]: Finished difference Result 136 states and 174 transitions. [2022-02-21 03:02:42,681 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 174 transitions. [2022-02-21 03:02:42,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:42,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:42,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 91 states have (on average 1.1868131868131868) internal successors, (108), 100 states have internal predecessors, (108), 22 states have call successors, (22), 7 states have call predecessors, (22), 12 states have return successors, (38), 20 states have call predecessors, (38), 19 states have call successors, (38) Second operand 136 states. [2022-02-21 03:02:42,697 INFO L87 Difference]: Start difference. First operand has 128 states, 91 states have (on average 1.1868131868131868) internal successors, (108), 100 states have internal predecessors, (108), 22 states have call successors, (22), 7 states have call predecessors, (22), 12 states have return successors, (38), 20 states have call predecessors, (38), 19 states have call successors, (38) Second operand 136 states. [2022-02-21 03:02:42,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:42,703 INFO L93 Difference]: Finished difference Result 136 states and 174 transitions. [2022-02-21 03:02:42,703 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 174 transitions. [2022-02-21 03:02:42,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:42,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:42,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:42,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:42,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 91 states have (on average 1.1868131868131868) internal successors, (108), 100 states have internal predecessors, (108), 22 states have call successors, (22), 7 states have call predecessors, (22), 12 states have return successors, (38), 20 states have call predecessors, (38), 19 states have call successors, (38) [2022-02-21 03:02:42,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 168 transitions. [2022-02-21 03:02:42,710 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 168 transitions. Word has length 20 [2022-02-21 03:02:42,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:42,711 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 168 transitions. [2022-02-21 03:02:42,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 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:42,711 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 168 transitions. [2022-02-21 03:02:42,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 03:02:42,711 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:42,711 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:42,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 03:02:42,712 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:02:42,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:42,712 INFO L85 PathProgramCache]: Analyzing trace with hash 757150232, now seen corresponding path program 1 times [2022-02-21 03:02:42,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:42,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688607930] [2022-02-21 03:02:42,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:42,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:42,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:02:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:42,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {2387#true} ~x := #in~x; {2387#true} is VALID [2022-02-21 03:02:42,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {2387#true} assume 0 == ~x;#res := 1; {2396#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:42,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {2396#(<= 1 |g_#res|)} assume true; {2396#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:42,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2396#(<= 1 |g_#res|)} {2387#true} #32#return; {2393#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:42,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {2387#true} assume { :begin_inline_ULTIMATE.init } true; {2387#true} is VALID [2022-02-21 03:02:42,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {2387#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {2387#true} is VALID [2022-02-21 03:02:42,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {2387#true} assume !(main_~x~0#1 < 0); {2387#true} is VALID [2022-02-21 03:02:42,788 INFO L272 TraceCheckUtils]: 3: Hoare triple {2387#true} call main_#t~ret3#1 := g(main_~x~0#1); {2387#true} is VALID [2022-02-21 03:02:42,789 INFO L290 TraceCheckUtils]: 4: Hoare triple {2387#true} ~x := #in~x; {2387#true} is VALID [2022-02-21 03:02:42,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {2387#true} assume !(0 == ~x); {2387#true} is VALID [2022-02-21 03:02:42,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {2387#true} assume ~x - 1 <= 2147483647; {2387#true} is VALID [2022-02-21 03:02:42,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {2387#true} assume ~x - 1 >= -2147483648; {2387#true} is VALID [2022-02-21 03:02:42,789 INFO L272 TraceCheckUtils]: 8: Hoare triple {2387#true} call #t~ret0 := g(~x - 1); {2387#true} is VALID [2022-02-21 03:02:42,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {2387#true} ~x := #in~x; {2387#true} is VALID [2022-02-21 03:02:42,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {2387#true} assume 0 == ~x;#res := 1; {2396#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:42,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {2396#(<= 1 |g_#res|)} assume true; {2396#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:42,791 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2396#(<= 1 |g_#res|)} {2387#true} #32#return; {2393#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:42,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {2393#(<= 1 |g_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2393#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:42,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {2393#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 <= 2147483647; {2393#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:42,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {2393#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 >= -2147483648; {2393#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:42,792 INFO L272 TraceCheckUtils]: 16: Hoare triple {2393#(<= 1 |g_#t~ret0|)} call #t~ret1 := g(#t~ret0 - 1); {2394#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:02:42,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {2394#(<= 0 |g_#in~x|)} ~x := #in~x; {2395#(<= 0 g_~x)} is VALID [2022-02-21 03:02:42,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {2395#(<= 0 g_~x)} assume !(0 == ~x); {2395#(<= 0 g_~x)} is VALID [2022-02-21 03:02:42,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {2395#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {2395#(<= 0 g_~x)} is VALID [2022-02-21 03:02:42,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {2395#(<= 0 g_~x)} assume !(~x - 1 >= -2147483648); {2388#false} is VALID [2022-02-21 03:02:42,794 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:02:42,794 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:42,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688607930] [2022-02-21 03:02:42,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688607930] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:42,794 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:42,795 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:02:42,795 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135871269] [2022-02-21 03:02:42,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:42,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 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 21 [2022-02-21 03:02:42,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:42,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 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:42,806 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:42,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:02:42,807 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:42,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:02:42,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:02:42,807 INFO L87 Difference]: Start difference. First operand 128 states and 168 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 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:43,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:43,052 INFO L93 Difference]: Finished difference Result 155 states and 200 transitions. [2022-02-21 03:02:43,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 03:02:43,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 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 21 [2022-02-21 03:02:43,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 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:43,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-02-21 03:02:43,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 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:43,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-02-21 03:02:43,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 57 transitions. [2022-02-21 03:02:43,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:43,093 INFO L225 Difference]: With dead ends: 155 [2022-02-21 03:02:43,093 INFO L226 Difference]: Without dead ends: 154 [2022-02-21 03:02:43,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:02:43,094 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:43,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 89 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:02:43,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-02-21 03:02:43,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 144. [2022-02-21 03:02:43,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:43,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand has 144 states, 103 states have (on average 1.1844660194174756) internal successors, (122), 112 states have internal predecessors, (122), 25 states have call successors, (25), 8 states have call predecessors, (25), 13 states have return successors, (37), 23 states have call predecessors, (37), 22 states have call successors, (37) [2022-02-21 03:02:43,195 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand has 144 states, 103 states have (on average 1.1844660194174756) internal successors, (122), 112 states have internal predecessors, (122), 25 states have call successors, (25), 8 states have call predecessors, (25), 13 states have return successors, (37), 23 states have call predecessors, (37), 22 states have call successors, (37) [2022-02-21 03:02:43,195 INFO L87 Difference]: Start difference. First operand 154 states. Second operand has 144 states, 103 states have (on average 1.1844660194174756) internal successors, (122), 112 states have internal predecessors, (122), 25 states have call successors, (25), 8 states have call predecessors, (25), 13 states have return successors, (37), 23 states have call predecessors, (37), 22 states have call successors, (37) [2022-02-21 03:02:43,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:43,200 INFO L93 Difference]: Finished difference Result 154 states and 199 transitions. [2022-02-21 03:02:43,201 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 199 transitions. [2022-02-21 03:02:43,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:43,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:43,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 103 states have (on average 1.1844660194174756) internal successors, (122), 112 states have internal predecessors, (122), 25 states have call successors, (25), 8 states have call predecessors, (25), 13 states have return successors, (37), 23 states have call predecessors, (37), 22 states have call successors, (37) Second operand 154 states. [2022-02-21 03:02:43,205 INFO L87 Difference]: Start difference. First operand has 144 states, 103 states have (on average 1.1844660194174756) internal successors, (122), 112 states have internal predecessors, (122), 25 states have call successors, (25), 8 states have call predecessors, (25), 13 states have return successors, (37), 23 states have call predecessors, (37), 22 states have call successors, (37) Second operand 154 states. [2022-02-21 03:02:43,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:43,212 INFO L93 Difference]: Finished difference Result 154 states and 199 transitions. [2022-02-21 03:02:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 199 transitions. [2022-02-21 03:02:43,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:43,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:43,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:43,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:43,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 103 states have (on average 1.1844660194174756) internal successors, (122), 112 states have internal predecessors, (122), 25 states have call successors, (25), 8 states have call predecessors, (25), 13 states have return successors, (37), 23 states have call predecessors, (37), 22 states have call successors, (37) [2022-02-21 03:02:43,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 184 transitions. [2022-02-21 03:02:43,220 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 184 transitions. Word has length 21 [2022-02-21 03:02:43,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:43,221 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 184 transitions. [2022-02-21 03:02:43,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 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:43,221 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 184 transitions. [2022-02-21 03:02:43,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-21 03:02:43,222 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:43,222 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:43,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-21 03:02:43,223 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:02:43,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:43,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1579949547, now seen corresponding path program 2 times [2022-02-21 03:02:43,223 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:43,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751627106] [2022-02-21 03:02:43,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:43,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:43,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:02:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:43,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {3081#true} ~x := #in~x; {3081#true} is VALID [2022-02-21 03:02:43,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {3081#true} assume 0 == ~x;#res := 1; {3092#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:43,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {3092#(<= 1 |g_#res|)} assume true; {3092#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:43,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3092#(<= 1 |g_#res|)} {3081#true} #32#return; {3087#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:43,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {3081#true} assume { :begin_inline_ULTIMATE.init } true; {3081#true} is VALID [2022-02-21 03:02:43,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {3081#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {3081#true} is VALID [2022-02-21 03:02:43,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {3081#true} assume !(main_~x~0#1 < 0); {3081#true} is VALID [2022-02-21 03:02:43,302 INFO L272 TraceCheckUtils]: 3: Hoare triple {3081#true} call main_#t~ret3#1 := g(main_~x~0#1); {3081#true} is VALID [2022-02-21 03:02:43,302 INFO L290 TraceCheckUtils]: 4: Hoare triple {3081#true} ~x := #in~x; {3081#true} is VALID [2022-02-21 03:02:43,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {3081#true} assume !(0 == ~x); {3081#true} is VALID [2022-02-21 03:02:43,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {3081#true} assume ~x - 1 <= 2147483647; {3081#true} is VALID [2022-02-21 03:02:43,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {3081#true} assume ~x - 1 >= -2147483648; {3081#true} is VALID [2022-02-21 03:02:43,303 INFO L272 TraceCheckUtils]: 8: Hoare triple {3081#true} call #t~ret0 := g(~x - 1); {3081#true} is VALID [2022-02-21 03:02:43,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {3081#true} ~x := #in~x; {3081#true} is VALID [2022-02-21 03:02:43,304 INFO L290 TraceCheckUtils]: 10: Hoare triple {3081#true} assume 0 == ~x;#res := 1; {3092#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:43,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {3092#(<= 1 |g_#res|)} assume true; {3092#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:43,305 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3092#(<= 1 |g_#res|)} {3081#true} #32#return; {3087#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:43,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {3087#(<= 1 |g_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3087#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:43,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {3087#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 <= 2147483647; {3087#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:43,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {3087#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 >= -2147483648; {3087#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:43,306 INFO L272 TraceCheckUtils]: 16: Hoare triple {3087#(<= 1 |g_#t~ret0|)} call #t~ret1 := g(#t~ret0 - 1); {3088#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:02:43,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {3088#(<= 0 |g_#in~x|)} ~x := #in~x; {3089#(<= 0 g_~x)} is VALID [2022-02-21 03:02:43,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {3089#(<= 0 g_~x)} assume !(0 == ~x); {3089#(<= 0 g_~x)} is VALID [2022-02-21 03:02:43,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {3089#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {3089#(<= 0 g_~x)} is VALID [2022-02-21 03:02:43,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {3089#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {3089#(<= 0 g_~x)} is VALID [2022-02-21 03:02:43,308 INFO L272 TraceCheckUtils]: 21: Hoare triple {3089#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {3090#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:02:43,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {3090#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {3091#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:43,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {3091#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {3091#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:43,309 INFO L290 TraceCheckUtils]: 24: Hoare triple {3091#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {3091#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:43,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {3091#(<= 0 (+ g_~x 1))} assume !(~x - 1 >= -2147483648); {3082#false} is VALID [2022-02-21 03:02:43,310 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:02:43,310 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:43,310 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751627106] [2022-02-21 03:02:43,310 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751627106] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:02:43,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947863772] [2022-02-21 03:02:43,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:02:43,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:43,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:43,312 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:02:43,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 03:02:43,337 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:02:43,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:02:43,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:02:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:43,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:02:43,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {3081#true} assume { :begin_inline_ULTIMATE.init } true; {3081#true} is VALID [2022-02-21 03:02:43,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {3081#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {3081#true} is VALID [2022-02-21 03:02:43,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {3081#true} assume !(main_~x~0#1 < 0); {3081#true} is VALID [2022-02-21 03:02:43,476 INFO L272 TraceCheckUtils]: 3: Hoare triple {3081#true} call main_#t~ret3#1 := g(main_~x~0#1); {3081#true} is VALID [2022-02-21 03:02:43,477 INFO L290 TraceCheckUtils]: 4: Hoare triple {3081#true} ~x := #in~x; {3081#true} is VALID [2022-02-21 03:02:43,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {3081#true} assume !(0 == ~x); {3081#true} is VALID [2022-02-21 03:02:43,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {3081#true} assume ~x - 1 <= 2147483647; {3081#true} is VALID [2022-02-21 03:02:43,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {3081#true} assume ~x - 1 >= -2147483648; {3081#true} is VALID [2022-02-21 03:02:43,477 INFO L272 TraceCheckUtils]: 8: Hoare triple {3081#true} call #t~ret0 := g(~x - 1); {3081#true} is VALID [2022-02-21 03:02:43,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {3081#true} ~x := #in~x; {3081#true} is VALID [2022-02-21 03:02:43,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {3081#true} assume 0 == ~x;#res := 1; {3092#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:43,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {3092#(<= 1 |g_#res|)} assume true; {3092#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:43,481 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3092#(<= 1 |g_#res|)} {3081#true} #32#return; {3087#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:43,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {3087#(<= 1 |g_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3087#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:43,484 INFO L290 TraceCheckUtils]: 14: Hoare triple {3087#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 <= 2147483647; {3087#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:43,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {3087#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 >= -2147483648; {3087#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:43,485 INFO L272 TraceCheckUtils]: 16: Hoare triple {3087#(<= 1 |g_#t~ret0|)} call #t~ret1 := g(#t~ret0 - 1); {3088#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:02:43,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {3088#(<= 0 |g_#in~x|)} ~x := #in~x; {3089#(<= 0 g_~x)} is VALID [2022-02-21 03:02:43,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {3089#(<= 0 g_~x)} assume !(0 == ~x); {3089#(<= 0 g_~x)} is VALID [2022-02-21 03:02:43,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {3089#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {3089#(<= 0 g_~x)} is VALID [2022-02-21 03:02:43,487 INFO L290 TraceCheckUtils]: 20: Hoare triple {3089#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {3089#(<= 0 g_~x)} is VALID [2022-02-21 03:02:43,487 INFO L272 TraceCheckUtils]: 21: Hoare triple {3089#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {3090#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:02:43,488 INFO L290 TraceCheckUtils]: 22: Hoare triple {3090#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {3091#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:43,488 INFO L290 TraceCheckUtils]: 23: Hoare triple {3091#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {3091#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:43,488 INFO L290 TraceCheckUtils]: 24: Hoare triple {3091#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {3091#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:43,489 INFO L290 TraceCheckUtils]: 25: Hoare triple {3091#(<= 0 (+ g_~x 1))} assume !(~x - 1 >= -2147483648); {3082#false} is VALID [2022-02-21 03:02:43,489 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:02:43,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:02:43,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {3171#(<= 0 (+ 2147483647 g_~x))} assume !(~x - 1 >= -2147483648); {3082#false} is VALID [2022-02-21 03:02:43,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {3171#(<= 0 (+ 2147483647 g_~x))} assume ~x - 1 <= 2147483647; {3171#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:43,704 INFO L290 TraceCheckUtils]: 23: Hoare triple {3171#(<= 0 (+ 2147483647 g_~x))} assume !(0 == ~x); {3171#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:43,704 INFO L290 TraceCheckUtils]: 22: Hoare triple {3181#(<= 0 (+ 2147483647 |g_#in~x|))} ~x := #in~x; {3171#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:43,708 INFO L272 TraceCheckUtils]: 21: Hoare triple {3185#(<= 0 (+ g_~x 2147483646))} call #t~ret0 := g(~x - 1); {3181#(<= 0 (+ 2147483647 |g_#in~x|))} is VALID [2022-02-21 03:02:43,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {3185#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 >= -2147483648; {3185#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:43,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {3185#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 <= 2147483647; {3185#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:43,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {3185#(<= 0 (+ g_~x 2147483646))} assume !(0 == ~x); {3185#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:43,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {3198#(<= 0 (+ |g_#in~x| 2147483646))} ~x := #in~x; {3185#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:43,711 INFO L272 TraceCheckUtils]: 16: Hoare triple {3202#(<= 0 (+ 2147483645 |g_#t~ret0|))} call #t~ret1 := g(#t~ret0 - 1); {3198#(<= 0 (+ |g_#in~x| 2147483646))} is VALID [2022-02-21 03:02:43,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {3202#(<= 0 (+ 2147483645 |g_#t~ret0|))} assume #t~ret0 - 1 >= -2147483648; {3202#(<= 0 (+ 2147483645 |g_#t~ret0|))} is VALID [2022-02-21 03:02:43,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {3202#(<= 0 (+ 2147483645 |g_#t~ret0|))} assume #t~ret0 - 1 <= 2147483647; {3202#(<= 0 (+ 2147483645 |g_#t~ret0|))} is VALID [2022-02-21 03:02:43,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {3202#(<= 0 (+ 2147483645 |g_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3202#(<= 0 (+ 2147483645 |g_#t~ret0|))} is VALID [2022-02-21 03:02:43,713 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3218#(<= 0 (+ 2147483645 |g_#res|))} {3081#true} #32#return; {3202#(<= 0 (+ 2147483645 |g_#t~ret0|))} is VALID [2022-02-21 03:02:43,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {3218#(<= 0 (+ 2147483645 |g_#res|))} assume true; {3218#(<= 0 (+ 2147483645 |g_#res|))} is VALID [2022-02-21 03:02:43,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {3081#true} assume 0 == ~x;#res := 1; {3218#(<= 0 (+ 2147483645 |g_#res|))} is VALID [2022-02-21 03:02:43,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {3081#true} ~x := #in~x; {3081#true} is VALID [2022-02-21 03:02:43,714 INFO L272 TraceCheckUtils]: 8: Hoare triple {3081#true} call #t~ret0 := g(~x - 1); {3081#true} is VALID [2022-02-21 03:02:43,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {3081#true} assume ~x - 1 >= -2147483648; {3081#true} is VALID [2022-02-21 03:02:43,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {3081#true} assume ~x - 1 <= 2147483647; {3081#true} is VALID [2022-02-21 03:02:43,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {3081#true} assume !(0 == ~x); {3081#true} is VALID [2022-02-21 03:02:43,715 INFO L290 TraceCheckUtils]: 4: Hoare triple {3081#true} ~x := #in~x; {3081#true} is VALID [2022-02-21 03:02:43,715 INFO L272 TraceCheckUtils]: 3: Hoare triple {3081#true} call main_#t~ret3#1 := g(main_~x~0#1); {3081#true} is VALID [2022-02-21 03:02:43,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {3081#true} assume !(main_~x~0#1 < 0); {3081#true} is VALID [2022-02-21 03:02:43,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {3081#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {3081#true} is VALID [2022-02-21 03:02:43,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {3081#true} assume { :begin_inline_ULTIMATE.init } true; {3081#true} is VALID [2022-02-21 03:02:43,716 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:02:43,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947863772] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:02:43,716 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:02:43,717 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-21 03:02:43,717 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67241471] [2022-02-21 03:02:43,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:02:43,718 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 10 states have internal predecessors, (33), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-02-21 03:02:43,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:43,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 10 states have internal predecessors, (33), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:43,747 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:43,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-21 03:02:43,747 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:43,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 03:02:43,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:02:43,749 INFO L87 Difference]: Start difference. First operand 144 states and 184 transitions. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 10 states have internal predecessors, (33), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:44,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:44,669 INFO L93 Difference]: Finished difference Result 215 states and 277 transitions. [2022-02-21 03:02:44,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-21 03:02:44,670 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 10 states have internal predecessors, (33), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-02-21 03:02:44,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:44,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 10 states have internal predecessors, (33), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:44,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 134 transitions. [2022-02-21 03:02:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 10 states have internal predecessors, (33), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:44,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 134 transitions. [2022-02-21 03:02:44,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 134 transitions. [2022-02-21 03:02:44,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:44,774 INFO L225 Difference]: With dead ends: 215 [2022-02-21 03:02:44,775 INFO L226 Difference]: Without dead ends: 214 [2022-02-21 03:02:44,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=552, Unknown=0, NotChecked=0, Total=756 [2022-02-21 03:02:44,776 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 141 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:44,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 142 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-21 03:02:44,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-02-21 03:02:44,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 198. [2022-02-21 03:02:44,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:44,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand has 198 states, 142 states have (on average 1.176056338028169) internal successors, (167), 154 states have internal predecessors, (167), 34 states have call successors, (34), 11 states have call predecessors, (34), 19 states have return successors, (52), 32 states have call predecessors, (52), 31 states have call successors, (52) [2022-02-21 03:02:44,885 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand has 198 states, 142 states have (on average 1.176056338028169) internal successors, (167), 154 states have internal predecessors, (167), 34 states have call successors, (34), 11 states have call predecessors, (34), 19 states have return successors, (52), 32 states have call predecessors, (52), 31 states have call successors, (52) [2022-02-21 03:02:44,885 INFO L87 Difference]: Start difference. First operand 214 states. Second operand has 198 states, 142 states have (on average 1.176056338028169) internal successors, (167), 154 states have internal predecessors, (167), 34 states have call successors, (34), 11 states have call predecessors, (34), 19 states have return successors, (52), 32 states have call predecessors, (52), 31 states have call successors, (52) [2022-02-21 03:02:44,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:44,892 INFO L93 Difference]: Finished difference Result 214 states and 274 transitions. [2022-02-21 03:02:44,892 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 274 transitions. [2022-02-21 03:02:44,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:44,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:44,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 142 states have (on average 1.176056338028169) internal successors, (167), 154 states have internal predecessors, (167), 34 states have call successors, (34), 11 states have call predecessors, (34), 19 states have return successors, (52), 32 states have call predecessors, (52), 31 states have call successors, (52) Second operand 214 states. [2022-02-21 03:02:44,911 INFO L87 Difference]: Start difference. First operand has 198 states, 142 states have (on average 1.176056338028169) internal successors, (167), 154 states have internal predecessors, (167), 34 states have call successors, (34), 11 states have call predecessors, (34), 19 states have return successors, (52), 32 states have call predecessors, (52), 31 states have call successors, (52) Second operand 214 states. [2022-02-21 03:02:44,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:44,919 INFO L93 Difference]: Finished difference Result 214 states and 274 transitions. [2022-02-21 03:02:44,919 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 274 transitions. [2022-02-21 03:02:44,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:44,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:44,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:44,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 142 states have (on average 1.176056338028169) internal successors, (167), 154 states have internal predecessors, (167), 34 states have call successors, (34), 11 states have call predecessors, (34), 19 states have return successors, (52), 32 states have call predecessors, (52), 31 states have call successors, (52) [2022-02-21 03:02:44,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 253 transitions. [2022-02-21 03:02:44,926 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 253 transitions. Word has length 26 [2022-02-21 03:02:44,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:44,927 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 253 transitions. [2022-02-21 03:02:44,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 10 states have internal predecessors, (33), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:44,927 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 253 transitions. [2022-02-21 03:02:44,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-21 03:02:44,927 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:44,927 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1] [2022-02-21 03:02:44,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:02:45,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-02-21 03:02:45,142 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:02:45,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:45,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1990306702, now seen corresponding path program 2 times [2022-02-21 03:02:45,142 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:45,143 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353166204] [2022-02-21 03:02:45,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:45,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:45,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {4214#true} assume { :begin_inline_ULTIMATE.init } true; {4214#true} is VALID [2022-02-21 03:02:45,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {4214#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {4214#true} is VALID [2022-02-21 03:02:45,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {4214#true} assume !(main_~x~0#1 < 0); {4216#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:02:45,250 INFO L272 TraceCheckUtils]: 3: Hoare triple {4216#(<= 0 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret3#1 := g(main_~x~0#1); {4217#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:02:45,250 INFO L290 TraceCheckUtils]: 4: Hoare triple {4217#(<= 0 |g_#in~x|)} ~x := #in~x; {4218#(<= 0 g_~x)} is VALID [2022-02-21 03:02:45,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {4218#(<= 0 g_~x)} assume !(0 == ~x); {4218#(<= 0 g_~x)} is VALID [2022-02-21 03:02:45,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {4218#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {4218#(<= 0 g_~x)} is VALID [2022-02-21 03:02:45,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {4218#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {4218#(<= 0 g_~x)} is VALID [2022-02-21 03:02:45,252 INFO L272 TraceCheckUtils]: 8: Hoare triple {4218#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {4219#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:02:45,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {4219#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {4220#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:45,253 INFO L290 TraceCheckUtils]: 10: Hoare triple {4220#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {4220#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:45,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {4220#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {4220#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:45,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {4220#(<= 0 (+ g_~x 1))} assume ~x - 1 >= -2147483648; {4220#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:45,254 INFO L272 TraceCheckUtils]: 13: Hoare triple {4220#(<= 0 (+ g_~x 1))} call #t~ret0 := g(~x - 1); {4221#(<= 0 (+ |g_#in~x| 2))} is VALID [2022-02-21 03:02:45,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {4221#(<= 0 (+ |g_#in~x| 2))} ~x := #in~x; {4222#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:45,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {4222#(<= 0 (+ 2 g_~x))} assume !(0 == ~x); {4222#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:45,255 INFO L290 TraceCheckUtils]: 16: Hoare triple {4222#(<= 0 (+ 2 g_~x))} assume ~x - 1 <= 2147483647; {4222#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:45,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {4222#(<= 0 (+ 2 g_~x))} assume ~x - 1 >= -2147483648; {4222#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:45,256 INFO L272 TraceCheckUtils]: 18: Hoare triple {4222#(<= 0 (+ 2 g_~x))} call #t~ret0 := g(~x - 1); {4223#(<= 0 (+ |g_#in~x| 3))} is VALID [2022-02-21 03:02:45,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {4223#(<= 0 (+ |g_#in~x| 3))} ~x := #in~x; {4224#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:45,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {4224#(<= 0 (+ 3 g_~x))} assume !(0 == ~x); {4224#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:45,262 INFO L290 TraceCheckUtils]: 21: Hoare triple {4224#(<= 0 (+ 3 g_~x))} assume ~x - 1 <= 2147483647; {4224#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:45,262 INFO L290 TraceCheckUtils]: 22: Hoare triple {4224#(<= 0 (+ 3 g_~x))} assume ~x - 1 >= -2147483648; {4224#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:45,263 INFO L272 TraceCheckUtils]: 23: Hoare triple {4224#(<= 0 (+ 3 g_~x))} call #t~ret0 := g(~x - 1); {4225#(<= 0 (+ |g_#in~x| 4))} is VALID [2022-02-21 03:02:45,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {4225#(<= 0 (+ |g_#in~x| 4))} ~x := #in~x; {4226#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:45,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {4226#(<= 0 (+ g_~x 4))} assume !(0 == ~x); {4226#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:45,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {4226#(<= 0 (+ g_~x 4))} assume ~x - 1 <= 2147483647; {4226#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:45,269 INFO L290 TraceCheckUtils]: 27: Hoare triple {4226#(<= 0 (+ g_~x 4))} assume !(~x - 1 >= -2147483648); {4215#false} is VALID [2022-02-21 03:02:45,269 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:45,269 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:45,269 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353166204] [2022-02-21 03:02:45,269 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353166204] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:02:45,269 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974006391] [2022-02-21 03:02:45,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:02:45,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:45,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:45,272 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:02:45,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-21 03:02:45,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:02:45,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:02:45,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:02:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:45,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:02:45,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {4214#true} assume { :begin_inline_ULTIMATE.init } true; {4214#true} is VALID [2022-02-21 03:02:45,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {4214#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {4214#true} is VALID [2022-02-21 03:02:45,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {4214#true} assume !(main_~x~0#1 < 0); {4216#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:02:45,513 INFO L272 TraceCheckUtils]: 3: Hoare triple {4216#(<= 0 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret3#1 := g(main_~x~0#1); {4217#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:02:45,513 INFO L290 TraceCheckUtils]: 4: Hoare triple {4217#(<= 0 |g_#in~x|)} ~x := #in~x; {4218#(<= 0 g_~x)} is VALID [2022-02-21 03:02:45,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {4218#(<= 0 g_~x)} assume !(0 == ~x); {4218#(<= 0 g_~x)} is VALID [2022-02-21 03:02:45,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {4218#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {4218#(<= 0 g_~x)} is VALID [2022-02-21 03:02:45,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {4218#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {4218#(<= 0 g_~x)} is VALID [2022-02-21 03:02:45,515 INFO L272 TraceCheckUtils]: 8: Hoare triple {4218#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {4219#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:02:45,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {4219#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {4220#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:45,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {4220#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {4220#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:45,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {4220#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {4220#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:45,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {4220#(<= 0 (+ g_~x 1))} assume ~x - 1 >= -2147483648; {4220#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:45,517 INFO L272 TraceCheckUtils]: 13: Hoare triple {4220#(<= 0 (+ g_~x 1))} call #t~ret0 := g(~x - 1); {4221#(<= 0 (+ |g_#in~x| 2))} is VALID [2022-02-21 03:02:45,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {4221#(<= 0 (+ |g_#in~x| 2))} ~x := #in~x; {4222#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:45,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {4222#(<= 0 (+ 2 g_~x))} assume !(0 == ~x); {4222#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:45,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {4222#(<= 0 (+ 2 g_~x))} assume ~x - 1 <= 2147483647; {4222#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:45,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {4222#(<= 0 (+ 2 g_~x))} assume ~x - 1 >= -2147483648; {4222#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:45,520 INFO L272 TraceCheckUtils]: 18: Hoare triple {4222#(<= 0 (+ 2 g_~x))} call #t~ret0 := g(~x - 1); {4223#(<= 0 (+ |g_#in~x| 3))} is VALID [2022-02-21 03:02:45,520 INFO L290 TraceCheckUtils]: 19: Hoare triple {4223#(<= 0 (+ |g_#in~x| 3))} ~x := #in~x; {4224#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:45,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {4224#(<= 0 (+ 3 g_~x))} assume !(0 == ~x); {4224#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:45,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {4224#(<= 0 (+ 3 g_~x))} assume ~x - 1 <= 2147483647; {4224#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:45,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {4224#(<= 0 (+ 3 g_~x))} assume ~x - 1 >= -2147483648; {4224#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:45,522 INFO L272 TraceCheckUtils]: 23: Hoare triple {4224#(<= 0 (+ 3 g_~x))} call #t~ret0 := g(~x - 1); {4225#(<= 0 (+ |g_#in~x| 4))} is VALID [2022-02-21 03:02:45,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {4225#(<= 0 (+ |g_#in~x| 4))} ~x := #in~x; {4226#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:45,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {4226#(<= 0 (+ g_~x 4))} assume !(0 == ~x); {4226#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:45,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {4226#(<= 0 (+ g_~x 4))} assume ~x - 1 <= 2147483647; {4226#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:45,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {4226#(<= 0 (+ g_~x 4))} assume !(~x - 1 >= -2147483648); {4215#false} is VALID [2022-02-21 03:02:45,523 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:45,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:02:45,823 INFO L290 TraceCheckUtils]: 27: Hoare triple {4311#(<= 0 (+ 2147483647 g_~x))} assume !(~x - 1 >= -2147483648); {4215#false} is VALID [2022-02-21 03:02:45,824 INFO L290 TraceCheckUtils]: 26: Hoare triple {4311#(<= 0 (+ 2147483647 g_~x))} assume ~x - 1 <= 2147483647; {4311#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:45,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {4311#(<= 0 (+ 2147483647 g_~x))} assume !(0 == ~x); {4311#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:45,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {4321#(<= 0 (+ 2147483647 |g_#in~x|))} ~x := #in~x; {4311#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:45,826 INFO L272 TraceCheckUtils]: 23: Hoare triple {4325#(<= 0 (+ g_~x 2147483646))} call #t~ret0 := g(~x - 1); {4321#(<= 0 (+ 2147483647 |g_#in~x|))} is VALID [2022-02-21 03:02:45,826 INFO L290 TraceCheckUtils]: 22: Hoare triple {4325#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 >= -2147483648; {4325#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:45,826 INFO L290 TraceCheckUtils]: 21: Hoare triple {4325#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 <= 2147483647; {4325#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:45,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {4325#(<= 0 (+ g_~x 2147483646))} assume !(0 == ~x); {4325#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:45,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {4338#(<= 0 (+ |g_#in~x| 2147483646))} ~x := #in~x; {4325#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:45,828 INFO L272 TraceCheckUtils]: 18: Hoare triple {4342#(<= 0 (+ 2147483645 g_~x))} call #t~ret0 := g(~x - 1); {4338#(<= 0 (+ |g_#in~x| 2147483646))} is VALID [2022-02-21 03:02:45,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {4342#(<= 0 (+ 2147483645 g_~x))} assume ~x - 1 >= -2147483648; {4342#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:02:45,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {4342#(<= 0 (+ 2147483645 g_~x))} assume ~x - 1 <= 2147483647; {4342#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:02:45,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {4342#(<= 0 (+ 2147483645 g_~x))} assume !(0 == ~x); {4342#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:02:45,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {4355#(<= 0 (+ 2147483645 |g_#in~x|))} ~x := #in~x; {4342#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:02:45,830 INFO L272 TraceCheckUtils]: 13: Hoare triple {4359#(<= 0 (+ g_~x 2147483644))} call #t~ret0 := g(~x - 1); {4355#(<= 0 (+ 2147483645 |g_#in~x|))} is VALID [2022-02-21 03:02:45,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {4359#(<= 0 (+ g_~x 2147483644))} assume ~x - 1 >= -2147483648; {4359#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:02:45,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {4359#(<= 0 (+ g_~x 2147483644))} assume ~x - 1 <= 2147483647; {4359#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:02:45,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {4359#(<= 0 (+ g_~x 2147483644))} assume !(0 == ~x); {4359#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:02:45,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {4372#(<= 0 (+ |g_#in~x| 2147483644))} ~x := #in~x; {4359#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:02:45,833 INFO L272 TraceCheckUtils]: 8: Hoare triple {4376#(<= 0 (+ 2147483643 g_~x))} call #t~ret0 := g(~x - 1); {4372#(<= 0 (+ |g_#in~x| 2147483644))} is VALID [2022-02-21 03:02:45,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {4376#(<= 0 (+ 2147483643 g_~x))} assume ~x - 1 >= -2147483648; {4376#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:02:45,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {4376#(<= 0 (+ 2147483643 g_~x))} assume ~x - 1 <= 2147483647; {4376#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:02:45,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {4376#(<= 0 (+ 2147483643 g_~x))} assume !(0 == ~x); {4376#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:02:45,834 INFO L290 TraceCheckUtils]: 4: Hoare triple {4389#(<= 0 (+ 2147483643 |g_#in~x|))} ~x := #in~x; {4376#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:02:45,835 INFO L272 TraceCheckUtils]: 3: Hoare triple {4393#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~x~0#1|))} call main_#t~ret3#1 := g(main_~x~0#1); {4389#(<= 0 (+ 2147483643 |g_#in~x|))} is VALID [2022-02-21 03:02:45,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {4214#true} assume !(main_~x~0#1 < 0); {4393#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:02:45,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {4214#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {4214#true} is VALID [2022-02-21 03:02:45,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {4214#true} assume { :begin_inline_ULTIMATE.init } true; {4214#true} is VALID [2022-02-21 03:02:45,836 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:45,836 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974006391] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:02:45,836 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:02:45,837 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2022-02-21 03:02:45,837 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256185699] [2022-02-21 03:02:45,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:02:45,837 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 14 states have internal predecessors, (44), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-21 03:02:45,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:45,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 14 states have internal predecessors, (44), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:45,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:45,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-21 03:02:45,872 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:45,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-21 03:02:45,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2022-02-21 03:02:45,873 INFO L87 Difference]: Start difference. First operand 198 states and 253 transitions. Second operand has 24 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 14 states have internal predecessors, (44), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:47,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:47,305 INFO L93 Difference]: Finished difference Result 319 states and 414 transitions. [2022-02-21 03:02:47,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-21 03:02:47,306 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 14 states have internal predecessors, (44), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-21 03:02:47,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:47,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 14 states have internal predecessors, (44), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:47,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 204 transitions. [2022-02-21 03:02:47,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 14 states have internal predecessors, (44), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:47,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 204 transitions. [2022-02-21 03:02:47,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 204 transitions. [2022-02-21 03:02:47,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:47,449 INFO L225 Difference]: With dead ends: 319 [2022-02-21 03:02:47,449 INFO L226 Difference]: Without dead ends: 318 [2022-02-21 03:02:47,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=554, Invalid=1252, Unknown=0, NotChecked=0, Total=1806 [2022-02-21 03:02:47,450 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 354 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:47,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [358 Valid, 259 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-21 03:02:47,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-02-21 03:02:47,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 306. [2022-02-21 03:02:47,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:47,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 318 states. Second operand has 306 states, 220 states have (on average 1.1681818181818182) internal successors, (257), 238 states have internal predecessors, (257), 52 states have call successors, (52), 17 states have call predecessors, (52), 31 states have return successors, (82), 50 states have call predecessors, (82), 49 states have call successors, (82) [2022-02-21 03:02:47,612 INFO L74 IsIncluded]: Start isIncluded. First operand 318 states. Second operand has 306 states, 220 states have (on average 1.1681818181818182) internal successors, (257), 238 states have internal predecessors, (257), 52 states have call successors, (52), 17 states have call predecessors, (52), 31 states have return successors, (82), 50 states have call predecessors, (82), 49 states have call successors, (82) [2022-02-21 03:02:47,613 INFO L87 Difference]: Start difference. First operand 318 states. Second operand has 306 states, 220 states have (on average 1.1681818181818182) internal successors, (257), 238 states have internal predecessors, (257), 52 states have call successors, (52), 17 states have call predecessors, (52), 31 states have return successors, (82), 50 states have call predecessors, (82), 49 states have call successors, (82) [2022-02-21 03:02:47,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:47,622 INFO L93 Difference]: Finished difference Result 318 states and 408 transitions. [2022-02-21 03:02:47,623 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 408 transitions. [2022-02-21 03:02:47,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:47,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:47,626 INFO L74 IsIncluded]: Start isIncluded. First operand has 306 states, 220 states have (on average 1.1681818181818182) internal successors, (257), 238 states have internal predecessors, (257), 52 states have call successors, (52), 17 states have call predecessors, (52), 31 states have return successors, (82), 50 states have call predecessors, (82), 49 states have call successors, (82) Second operand 318 states. [2022-02-21 03:02:47,626 INFO L87 Difference]: Start difference. First operand has 306 states, 220 states have (on average 1.1681818181818182) internal successors, (257), 238 states have internal predecessors, (257), 52 states have call successors, (52), 17 states have call predecessors, (52), 31 states have return successors, (82), 50 states have call predecessors, (82), 49 states have call successors, (82) Second operand 318 states. [2022-02-21 03:02:47,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:47,634 INFO L93 Difference]: Finished difference Result 318 states and 408 transitions. [2022-02-21 03:02:47,634 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 408 transitions. [2022-02-21 03:02:47,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:47,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:47,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:47,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:47,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 220 states have (on average 1.1681818181818182) internal successors, (257), 238 states have internal predecessors, (257), 52 states have call successors, (52), 17 states have call predecessors, (52), 31 states have return successors, (82), 50 states have call predecessors, (82), 49 states have call successors, (82) [2022-02-21 03:02:47,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 391 transitions. [2022-02-21 03:02:47,657 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 391 transitions. Word has length 28 [2022-02-21 03:02:47,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:47,657 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 391 transitions. [2022-02-21 03:02:47,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 14 states have internal predecessors, (44), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:47,657 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 391 transitions. [2022-02-21 03:02:47,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-21 03:02:47,657 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:47,663 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:47,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:02:47,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:47,876 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:02:47,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:47,876 INFO L85 PathProgramCache]: Analyzing trace with hash 375182260, now seen corresponding path program 1 times [2022-02-21 03:02:47,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:47,876 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701423620] [2022-02-21 03:02:47,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:47,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:47,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:02:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:47,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 03:02:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:47,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {5839#true} ~x := #in~x; {5839#true} is VALID [2022-02-21 03:02:47,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {5839#true} assume 0 == ~x;#res := 1; {5839#true} is VALID [2022-02-21 03:02:47,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {5839#true} assume true; {5839#true} is VALID [2022-02-21 03:02:47,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5839#true} {5839#true} #32#return; {5839#true} is VALID [2022-02-21 03:02:47,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:02:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:47,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {5839#true} ~x := #in~x; {5839#true} is VALID [2022-02-21 03:02:47,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {5839#true} assume 0 == ~x;#res := 1; {5871#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:47,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {5871#(<= 1 |g_#res|)} assume true; {5871#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:47,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5871#(<= 1 |g_#res|)} {5839#true} #34#return; {5870#(<= 1 |g_#t~ret1|)} is VALID [2022-02-21 03:02:47,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {5839#true} ~x := #in~x; {5839#true} is VALID [2022-02-21 03:02:47,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {5839#true} assume !(0 == ~x); {5839#true} is VALID [2022-02-21 03:02:47,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {5839#true} assume ~x - 1 <= 2147483647; {5839#true} is VALID [2022-02-21 03:02:47,964 INFO L290 TraceCheckUtils]: 3: Hoare triple {5839#true} assume ~x - 1 >= -2147483648; {5839#true} is VALID [2022-02-21 03:02:47,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {5839#true} call #t~ret0 := g(~x - 1); {5839#true} is VALID [2022-02-21 03:02:47,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {5839#true} ~x := #in~x; {5839#true} is VALID [2022-02-21 03:02:47,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {5839#true} assume 0 == ~x;#res := 1; {5839#true} is VALID [2022-02-21 03:02:47,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {5839#true} assume true; {5839#true} is VALID [2022-02-21 03:02:47,964 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {5839#true} {5839#true} #32#return; {5839#true} is VALID [2022-02-21 03:02:47,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {5839#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {5839#true} is VALID [2022-02-21 03:02:47,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {5839#true} assume #t~ret0 - 1 <= 2147483647; {5839#true} is VALID [2022-02-21 03:02:47,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {5839#true} assume #t~ret0 - 1 >= -2147483648; {5839#true} is VALID [2022-02-21 03:02:47,965 INFO L272 TraceCheckUtils]: 12: Hoare triple {5839#true} call #t~ret1 := g(#t~ret0 - 1); {5839#true} is VALID [2022-02-21 03:02:47,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {5839#true} ~x := #in~x; {5839#true} is VALID [2022-02-21 03:02:47,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {5839#true} assume 0 == ~x;#res := 1; {5871#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:47,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {5871#(<= 1 |g_#res|)} assume true; {5871#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:47,966 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5871#(<= 1 |g_#res|)} {5839#true} #34#return; {5870#(<= 1 |g_#t~ret1|)} is VALID [2022-02-21 03:02:47,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {5870#(<= 1 |g_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret0;havoc #t~ret1; {5871#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:47,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {5871#(<= 1 |g_#res|)} assume true; {5871#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:47,968 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {5871#(<= 1 |g_#res|)} {5839#true} #32#return; {5861#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:47,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {5839#true} assume { :begin_inline_ULTIMATE.init } true; {5839#true} is VALID [2022-02-21 03:02:47,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {5839#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {5839#true} is VALID [2022-02-21 03:02:47,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {5839#true} assume !(main_~x~0#1 < 0); {5839#true} is VALID [2022-02-21 03:02:47,968 INFO L272 TraceCheckUtils]: 3: Hoare triple {5839#true} call main_#t~ret3#1 := g(main_~x~0#1); {5839#true} is VALID [2022-02-21 03:02:47,968 INFO L290 TraceCheckUtils]: 4: Hoare triple {5839#true} ~x := #in~x; {5839#true} is VALID [2022-02-21 03:02:47,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {5839#true} assume !(0 == ~x); {5839#true} is VALID [2022-02-21 03:02:47,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {5839#true} assume ~x - 1 <= 2147483647; {5839#true} is VALID [2022-02-21 03:02:47,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {5839#true} assume ~x - 1 >= -2147483648; {5839#true} is VALID [2022-02-21 03:02:47,969 INFO L272 TraceCheckUtils]: 8: Hoare triple {5839#true} call #t~ret0 := g(~x - 1); {5839#true} is VALID [2022-02-21 03:02:47,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {5839#true} ~x := #in~x; {5839#true} is VALID [2022-02-21 03:02:47,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {5839#true} assume !(0 == ~x); {5839#true} is VALID [2022-02-21 03:02:47,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {5839#true} assume ~x - 1 <= 2147483647; {5839#true} is VALID [2022-02-21 03:02:47,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {5839#true} assume ~x - 1 >= -2147483648; {5839#true} is VALID [2022-02-21 03:02:47,970 INFO L272 TraceCheckUtils]: 13: Hoare triple {5839#true} call #t~ret0 := g(~x - 1); {5839#true} is VALID [2022-02-21 03:02:47,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {5839#true} ~x := #in~x; {5839#true} is VALID [2022-02-21 03:02:47,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {5839#true} assume 0 == ~x;#res := 1; {5839#true} is VALID [2022-02-21 03:02:47,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {5839#true} assume true; {5839#true} is VALID [2022-02-21 03:02:47,970 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5839#true} {5839#true} #32#return; {5839#true} is VALID [2022-02-21 03:02:47,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {5839#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {5839#true} is VALID [2022-02-21 03:02:47,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {5839#true} assume #t~ret0 - 1 <= 2147483647; {5839#true} is VALID [2022-02-21 03:02:47,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {5839#true} assume #t~ret0 - 1 >= -2147483648; {5839#true} is VALID [2022-02-21 03:02:47,971 INFO L272 TraceCheckUtils]: 21: Hoare triple {5839#true} call #t~ret1 := g(#t~ret0 - 1); {5839#true} is VALID [2022-02-21 03:02:47,971 INFO L290 TraceCheckUtils]: 22: Hoare triple {5839#true} ~x := #in~x; {5839#true} is VALID [2022-02-21 03:02:47,971 INFO L290 TraceCheckUtils]: 23: Hoare triple {5839#true} assume 0 == ~x;#res := 1; {5871#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:47,971 INFO L290 TraceCheckUtils]: 24: Hoare triple {5871#(<= 1 |g_#res|)} assume true; {5871#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:47,972 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5871#(<= 1 |g_#res|)} {5839#true} #34#return; {5870#(<= 1 |g_#t~ret1|)} is VALID [2022-02-21 03:02:47,972 INFO L290 TraceCheckUtils]: 26: Hoare triple {5870#(<= 1 |g_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret0;havoc #t~ret1; {5871#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:47,973 INFO L290 TraceCheckUtils]: 27: Hoare triple {5871#(<= 1 |g_#res|)} assume true; {5871#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:47,973 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5871#(<= 1 |g_#res|)} {5839#true} #32#return; {5861#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:47,973 INFO L290 TraceCheckUtils]: 29: Hoare triple {5861#(<= 1 |g_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {5861#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:47,974 INFO L290 TraceCheckUtils]: 30: Hoare triple {5861#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 <= 2147483647; {5861#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:47,974 INFO L290 TraceCheckUtils]: 31: Hoare triple {5861#(<= 1 |g_#t~ret0|)} assume !(#t~ret0 - 1 >= -2147483648); {5840#false} is VALID [2022-02-21 03:02:47,974 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-02-21 03:02:47,974 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:47,975 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701423620] [2022-02-21 03:02:47,975 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701423620] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:47,975 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:47,975 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:02:47,975 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420309929] [2022-02-21 03:02:47,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:47,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-02-21 03:02:47,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:47,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:47,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:47,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:02:47,990 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:47,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:02:47,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:02:47,990 INFO L87 Difference]: Start difference. First operand 306 states and 391 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:48,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:48,199 INFO L93 Difference]: Finished difference Result 306 states and 391 transitions. [2022-02-21 03:02:48,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:02:48,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-02-21 03:02:48,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:48,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:48,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-02-21 03:02:48,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:48,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-02-21 03:02:48,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 21 transitions. [2022-02-21 03:02:48,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:48,219 INFO L225 Difference]: With dead ends: 306 [2022-02-21 03:02:48,219 INFO L226 Difference]: Without dead ends: 305 [2022-02-21 03:02:48,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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:48,220 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:48,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 59 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:48,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-02-21 03:02:48,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2022-02-21 03:02:48,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:48,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 305 states. Second operand has 305 states, 220 states have (on average 1.0909090909090908) internal successors, (240), 237 states have internal predecessors, (240), 52 states have call successors, (52), 17 states have call predecessors, (52), 31 states have return successors, (82), 50 states have call predecessors, (82), 49 states have call successors, (82) [2022-02-21 03:02:48,370 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand has 305 states, 220 states have (on average 1.0909090909090908) internal successors, (240), 237 states have internal predecessors, (240), 52 states have call successors, (52), 17 states have call predecessors, (52), 31 states have return successors, (82), 50 states have call predecessors, (82), 49 states have call successors, (82) [2022-02-21 03:02:48,370 INFO L87 Difference]: Start difference. First operand 305 states. Second operand has 305 states, 220 states have (on average 1.0909090909090908) internal successors, (240), 237 states have internal predecessors, (240), 52 states have call successors, (52), 17 states have call predecessors, (52), 31 states have return successors, (82), 50 states have call predecessors, (82), 49 states have call successors, (82) [2022-02-21 03:02:48,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:48,379 INFO L93 Difference]: Finished difference Result 305 states and 374 transitions. [2022-02-21 03:02:48,380 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 374 transitions. [2022-02-21 03:02:48,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:48,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:48,382 INFO L74 IsIncluded]: Start isIncluded. First operand has 305 states, 220 states have (on average 1.0909090909090908) internal successors, (240), 237 states have internal predecessors, (240), 52 states have call successors, (52), 17 states have call predecessors, (52), 31 states have return successors, (82), 50 states have call predecessors, (82), 49 states have call successors, (82) Second operand 305 states. [2022-02-21 03:02:48,382 INFO L87 Difference]: Start difference. First operand has 305 states, 220 states have (on average 1.0909090909090908) internal successors, (240), 237 states have internal predecessors, (240), 52 states have call successors, (52), 17 states have call predecessors, (52), 31 states have return successors, (82), 50 states have call predecessors, (82), 49 states have call successors, (82) Second operand 305 states. [2022-02-21 03:02:48,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:48,390 INFO L93 Difference]: Finished difference Result 305 states and 374 transitions. [2022-02-21 03:02:48,390 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 374 transitions. [2022-02-21 03:02:48,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:48,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:48,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:48,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:48,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 220 states have (on average 1.0909090909090908) internal successors, (240), 237 states have internal predecessors, (240), 52 states have call successors, (52), 17 states have call predecessors, (52), 31 states have return successors, (82), 50 states have call predecessors, (82), 49 states have call successors, (82) [2022-02-21 03:02:48,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 374 transitions. [2022-02-21 03:02:48,400 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 374 transitions. Word has length 32 [2022-02-21 03:02:48,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:48,400 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 374 transitions. [2022-02-21 03:02:48,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:48,400 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 374 transitions. [2022-02-21 03:02:48,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-21 03:02:48,403 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:48,403 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:48,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-21 03:02:48,403 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:02:48,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:48,404 INFO L85 PathProgramCache]: Analyzing trace with hash 801174005, now seen corresponding path program 1 times [2022-02-21 03:02:48,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:48,404 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465413672] [2022-02-21 03:02:48,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:48,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:48,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:02:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:48,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 03:02:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:48,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {7235#true} ~x := #in~x; {7235#true} is VALID [2022-02-21 03:02:48,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {7235#true} assume 0 == ~x;#res := 1; {7235#true} is VALID [2022-02-21 03:02:48,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {7235#true} assume true; {7235#true} is VALID [2022-02-21 03:02:48,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7235#true} {7235#true} #32#return; {7235#true} is VALID [2022-02-21 03:02:48,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:02:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:48,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {7235#true} ~x := #in~x; {7235#true} is VALID [2022-02-21 03:02:48,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {7235#true} assume 0 == ~x;#res := 1; {7269#(<= |g_#res| 1)} is VALID [2022-02-21 03:02:48,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {7269#(<= |g_#res| 1)} assume true; {7269#(<= |g_#res| 1)} is VALID [2022-02-21 03:02:48,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7269#(<= |g_#res| 1)} {7235#true} #34#return; {7268#(<= |g_#t~ret1| 1)} is VALID [2022-02-21 03:02:48,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {7235#true} ~x := #in~x; {7235#true} is VALID [2022-02-21 03:02:48,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {7235#true} assume !(0 == ~x); {7235#true} is VALID [2022-02-21 03:02:48,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {7235#true} assume ~x - 1 <= 2147483647; {7235#true} is VALID [2022-02-21 03:02:48,527 INFO L290 TraceCheckUtils]: 3: Hoare triple {7235#true} assume ~x - 1 >= -2147483648; {7235#true} is VALID [2022-02-21 03:02:48,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {7235#true} call #t~ret0 := g(~x - 1); {7235#true} is VALID [2022-02-21 03:02:48,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {7235#true} ~x := #in~x; {7235#true} is VALID [2022-02-21 03:02:48,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {7235#true} assume 0 == ~x;#res := 1; {7235#true} is VALID [2022-02-21 03:02:48,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {7235#true} assume true; {7235#true} is VALID [2022-02-21 03:02:48,528 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {7235#true} {7235#true} #32#return; {7235#true} is VALID [2022-02-21 03:02:48,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {7235#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {7235#true} is VALID [2022-02-21 03:02:48,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {7235#true} assume #t~ret0 - 1 <= 2147483647; {7235#true} is VALID [2022-02-21 03:02:48,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {7235#true} assume #t~ret0 - 1 >= -2147483648; {7235#true} is VALID [2022-02-21 03:02:48,529 INFO L272 TraceCheckUtils]: 12: Hoare triple {7235#true} call #t~ret1 := g(#t~ret0 - 1); {7235#true} is VALID [2022-02-21 03:02:48,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {7235#true} ~x := #in~x; {7235#true} is VALID [2022-02-21 03:02:48,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {7235#true} assume 0 == ~x;#res := 1; {7269#(<= |g_#res| 1)} is VALID [2022-02-21 03:02:48,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {7269#(<= |g_#res| 1)} assume true; {7269#(<= |g_#res| 1)} is VALID [2022-02-21 03:02:48,530 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7269#(<= |g_#res| 1)} {7235#true} #34#return; {7268#(<= |g_#t~ret1| 1)} is VALID [2022-02-21 03:02:48,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {7268#(<= |g_#t~ret1| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret0;havoc #t~ret1; {7269#(<= |g_#res| 1)} is VALID [2022-02-21 03:02:48,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {7269#(<= |g_#res| 1)} assume true; {7269#(<= |g_#res| 1)} is VALID [2022-02-21 03:02:48,532 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {7269#(<= |g_#res| 1)} {7235#true} #32#return; {7257#(<= |g_#t~ret0| 1)} is VALID [2022-02-21 03:02:48,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {7235#true} assume { :begin_inline_ULTIMATE.init } true; {7235#true} is VALID [2022-02-21 03:02:48,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {7235#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {7235#true} is VALID [2022-02-21 03:02:48,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {7235#true} assume !(main_~x~0#1 < 0); {7235#true} is VALID [2022-02-21 03:02:48,533 INFO L272 TraceCheckUtils]: 3: Hoare triple {7235#true} call main_#t~ret3#1 := g(main_~x~0#1); {7235#true} is VALID [2022-02-21 03:02:48,534 INFO L290 TraceCheckUtils]: 4: Hoare triple {7235#true} ~x := #in~x; {7235#true} is VALID [2022-02-21 03:02:48,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {7235#true} assume !(0 == ~x); {7235#true} is VALID [2022-02-21 03:02:48,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {7235#true} assume ~x - 1 <= 2147483647; {7235#true} is VALID [2022-02-21 03:02:48,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {7235#true} assume ~x - 1 >= -2147483648; {7235#true} is VALID [2022-02-21 03:02:48,534 INFO L272 TraceCheckUtils]: 8: Hoare triple {7235#true} call #t~ret0 := g(~x - 1); {7235#true} is VALID [2022-02-21 03:02:48,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {7235#true} ~x := #in~x; {7235#true} is VALID [2022-02-21 03:02:48,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {7235#true} assume !(0 == ~x); {7235#true} is VALID [2022-02-21 03:02:48,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {7235#true} assume ~x - 1 <= 2147483647; {7235#true} is VALID [2022-02-21 03:02:48,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {7235#true} assume ~x - 1 >= -2147483648; {7235#true} is VALID [2022-02-21 03:02:48,535 INFO L272 TraceCheckUtils]: 13: Hoare triple {7235#true} call #t~ret0 := g(~x - 1); {7235#true} is VALID [2022-02-21 03:02:48,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {7235#true} ~x := #in~x; {7235#true} is VALID [2022-02-21 03:02:48,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {7235#true} assume 0 == ~x;#res := 1; {7235#true} is VALID [2022-02-21 03:02:48,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {7235#true} assume true; {7235#true} is VALID [2022-02-21 03:02:48,536 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7235#true} {7235#true} #32#return; {7235#true} is VALID [2022-02-21 03:02:48,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {7235#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {7235#true} is VALID [2022-02-21 03:02:48,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {7235#true} assume #t~ret0 - 1 <= 2147483647; {7235#true} is VALID [2022-02-21 03:02:48,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {7235#true} assume #t~ret0 - 1 >= -2147483648; {7235#true} is VALID [2022-02-21 03:02:48,536 INFO L272 TraceCheckUtils]: 21: Hoare triple {7235#true} call #t~ret1 := g(#t~ret0 - 1); {7235#true} is VALID [2022-02-21 03:02:48,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {7235#true} ~x := #in~x; {7235#true} is VALID [2022-02-21 03:02:48,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {7235#true} assume 0 == ~x;#res := 1; {7269#(<= |g_#res| 1)} is VALID [2022-02-21 03:02:48,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {7269#(<= |g_#res| 1)} assume true; {7269#(<= |g_#res| 1)} is VALID [2022-02-21 03:02:48,538 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7269#(<= |g_#res| 1)} {7235#true} #34#return; {7268#(<= |g_#t~ret1| 1)} is VALID [2022-02-21 03:02:48,539 INFO L290 TraceCheckUtils]: 26: Hoare triple {7268#(<= |g_#t~ret1| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret0;havoc #t~ret1; {7269#(<= |g_#res| 1)} is VALID [2022-02-21 03:02:48,539 INFO L290 TraceCheckUtils]: 27: Hoare triple {7269#(<= |g_#res| 1)} assume true; {7269#(<= |g_#res| 1)} is VALID [2022-02-21 03:02:48,539 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7269#(<= |g_#res| 1)} {7235#true} #32#return; {7257#(<= |g_#t~ret0| 1)} is VALID [2022-02-21 03:02:48,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {7257#(<= |g_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {7257#(<= |g_#t~ret0| 1)} is VALID [2022-02-21 03:02:48,540 INFO L290 TraceCheckUtils]: 30: Hoare triple {7257#(<= |g_#t~ret0| 1)} assume #t~ret0 - 1 <= 2147483647; {7257#(<= |g_#t~ret0| 1)} is VALID [2022-02-21 03:02:48,540 INFO L290 TraceCheckUtils]: 31: Hoare triple {7257#(<= |g_#t~ret0| 1)} assume #t~ret0 - 1 >= -2147483648; {7257#(<= |g_#t~ret0| 1)} is VALID [2022-02-21 03:02:48,542 INFO L272 TraceCheckUtils]: 32: Hoare triple {7257#(<= |g_#t~ret0| 1)} call #t~ret1 := g(#t~ret0 - 1); {7258#(<= |g_#in~x| 0)} is VALID [2022-02-21 03:02:48,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {7258#(<= |g_#in~x| 0)} ~x := #in~x; {7259#(<= g_~x 0)} is VALID [2022-02-21 03:02:48,542 INFO L290 TraceCheckUtils]: 34: Hoare triple {7259#(<= g_~x 0)} assume !(0 == ~x); {7259#(<= g_~x 0)} is VALID [2022-02-21 03:02:48,543 INFO L290 TraceCheckUtils]: 35: Hoare triple {7259#(<= g_~x 0)} assume !(~x - 1 <= 2147483647); {7236#false} is VALID [2022-02-21 03:02:48,543 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-02-21 03:02:48,543 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:48,543 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465413672] [2022-02-21 03:02:48,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465413672] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:48,544 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:48,544 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 03:02:48,544 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656241942] [2022-02-21 03:02:48,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:48,544 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-02-21 03:02:48,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:48,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:48,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:48,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-21 03:02:48,559 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:48,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:02:48,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:02:48,560 INFO L87 Difference]: Start difference. First operand 305 states and 374 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:48,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:48,922 INFO L93 Difference]: Finished difference Result 306 states and 374 transitions. [2022-02-21 03:02:48,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:02:48,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-02-21 03:02:48,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:48,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:48,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 37 transitions. [2022-02-21 03:02:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 37 transitions. [2022-02-21 03:02:48,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 37 transitions. [2022-02-21 03:02:48,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:48,949 INFO L225 Difference]: With dead ends: 306 [2022-02-21 03:02:48,949 INFO L226 Difference]: Without dead ends: 305 [2022-02-21 03:02:48,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:02:48,950 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:48,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 72 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:48,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-02-21 03:02:49,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 304. [2022-02-21 03:02:49,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:49,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 305 states. Second operand has 304 states, 220 states have (on average 1.0863636363636364) internal successors, (239), 236 states have internal predecessors, (239), 52 states have call successors, (52), 17 states have call predecessors, (52), 31 states have return successors, (82), 50 states have call predecessors, (82), 49 states have call successors, (82) [2022-02-21 03:02:49,103 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand has 304 states, 220 states have (on average 1.0863636363636364) internal successors, (239), 236 states have internal predecessors, (239), 52 states have call successors, (52), 17 states have call predecessors, (52), 31 states have return successors, (82), 50 states have call predecessors, (82), 49 states have call successors, (82) [2022-02-21 03:02:49,104 INFO L87 Difference]: Start difference. First operand 305 states. Second operand has 304 states, 220 states have (on average 1.0863636363636364) internal successors, (239), 236 states have internal predecessors, (239), 52 states have call successors, (52), 17 states have call predecessors, (52), 31 states have return successors, (82), 50 states have call predecessors, (82), 49 states have call successors, (82) [2022-02-21 03:02:49,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:49,111 INFO L93 Difference]: Finished difference Result 305 states and 373 transitions. [2022-02-21 03:02:49,111 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 373 transitions. [2022-02-21 03:02:49,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:49,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:49,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 304 states, 220 states have (on average 1.0863636363636364) internal successors, (239), 236 states have internal predecessors, (239), 52 states have call successors, (52), 17 states have call predecessors, (52), 31 states have return successors, (82), 50 states have call predecessors, (82), 49 states have call successors, (82) Second operand 305 states. [2022-02-21 03:02:49,113 INFO L87 Difference]: Start difference. First operand has 304 states, 220 states have (on average 1.0863636363636364) internal successors, (239), 236 states have internal predecessors, (239), 52 states have call successors, (52), 17 states have call predecessors, (52), 31 states have return successors, (82), 50 states have call predecessors, (82), 49 states have call successors, (82) Second operand 305 states. [2022-02-21 03:02:49,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:49,120 INFO L93 Difference]: Finished difference Result 305 states and 373 transitions. [2022-02-21 03:02:49,120 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 373 transitions. [2022-02-21 03:02:49,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:49,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:49,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:49,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:49,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 220 states have (on average 1.0863636363636364) internal successors, (239), 236 states have internal predecessors, (239), 52 states have call successors, (52), 17 states have call predecessors, (52), 31 states have return successors, (82), 50 states have call predecessors, (82), 49 states have call successors, (82) [2022-02-21 03:02:49,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 373 transitions. [2022-02-21 03:02:49,129 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 373 transitions. Word has length 36 [2022-02-21 03:02:49,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:49,129 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 373 transitions. [2022-02-21 03:02:49,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:49,129 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 373 transitions. [2022-02-21 03:02:49,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-21 03:02:49,131 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:49,131 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:49,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-21 03:02:49,131 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:02:49,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:49,132 INFO L85 PathProgramCache]: Analyzing trace with hash -933409583, now seen corresponding path program 1 times [2022-02-21 03:02:49,132 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:49,132 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322278790] [2022-02-21 03:02:49,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:49,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:49,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:02:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:49,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 03:02:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:49,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {8644#true} ~x := #in~x; {8644#true} is VALID [2022-02-21 03:02:49,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {8644#true} assume 0 == ~x;#res := 1; {8644#true} is VALID [2022-02-21 03:02:49,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {8644#true} assume true; {8644#true} is VALID [2022-02-21 03:02:49,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8644#true} {8644#true} #32#return; {8644#true} is VALID [2022-02-21 03:02:49,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:02:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:49,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {8644#true} ~x := #in~x; {8644#true} is VALID [2022-02-21 03:02:49,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {8644#true} assume 0 == ~x;#res := 1; {8678#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:49,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {8678#(<= 1 |g_#res|)} assume true; {8678#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:49,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8678#(<= 1 |g_#res|)} {8644#true} #34#return; {8677#(<= 1 |g_#t~ret1|)} is VALID [2022-02-21 03:02:49,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {8644#true} ~x := #in~x; {8644#true} is VALID [2022-02-21 03:02:49,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {8644#true} assume !(0 == ~x); {8644#true} is VALID [2022-02-21 03:02:49,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {8644#true} assume ~x - 1 <= 2147483647; {8644#true} is VALID [2022-02-21 03:02:49,224 INFO L290 TraceCheckUtils]: 3: Hoare triple {8644#true} assume ~x - 1 >= -2147483648; {8644#true} is VALID [2022-02-21 03:02:49,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {8644#true} call #t~ret0 := g(~x - 1); {8644#true} is VALID [2022-02-21 03:02:49,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {8644#true} ~x := #in~x; {8644#true} is VALID [2022-02-21 03:02:49,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {8644#true} assume 0 == ~x;#res := 1; {8644#true} is VALID [2022-02-21 03:02:49,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {8644#true} assume true; {8644#true} is VALID [2022-02-21 03:02:49,224 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {8644#true} {8644#true} #32#return; {8644#true} is VALID [2022-02-21 03:02:49,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {8644#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {8644#true} is VALID [2022-02-21 03:02:49,224 INFO L290 TraceCheckUtils]: 10: Hoare triple {8644#true} assume #t~ret0 - 1 <= 2147483647; {8644#true} is VALID [2022-02-21 03:02:49,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {8644#true} assume #t~ret0 - 1 >= -2147483648; {8644#true} is VALID [2022-02-21 03:02:49,225 INFO L272 TraceCheckUtils]: 12: Hoare triple {8644#true} call #t~ret1 := g(#t~ret0 - 1); {8644#true} is VALID [2022-02-21 03:02:49,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {8644#true} ~x := #in~x; {8644#true} is VALID [2022-02-21 03:02:49,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {8644#true} assume 0 == ~x;#res := 1; {8678#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:49,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {8678#(<= 1 |g_#res|)} assume true; {8678#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:49,226 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8678#(<= 1 |g_#res|)} {8644#true} #34#return; {8677#(<= 1 |g_#t~ret1|)} is VALID [2022-02-21 03:02:49,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {8677#(<= 1 |g_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret0;havoc #t~ret1; {8678#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:49,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {8678#(<= 1 |g_#res|)} assume true; {8678#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:49,227 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {8678#(<= 1 |g_#res|)} {8644#true} #32#return; {8666#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:49,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {8644#true} assume { :begin_inline_ULTIMATE.init } true; {8644#true} is VALID [2022-02-21 03:02:49,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {8644#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {8644#true} is VALID [2022-02-21 03:02:49,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {8644#true} assume !(main_~x~0#1 < 0); {8644#true} is VALID [2022-02-21 03:02:49,228 INFO L272 TraceCheckUtils]: 3: Hoare triple {8644#true} call main_#t~ret3#1 := g(main_~x~0#1); {8644#true} is VALID [2022-02-21 03:02:49,228 INFO L290 TraceCheckUtils]: 4: Hoare triple {8644#true} ~x := #in~x; {8644#true} is VALID [2022-02-21 03:02:49,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {8644#true} assume !(0 == ~x); {8644#true} is VALID [2022-02-21 03:02:49,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {8644#true} assume ~x - 1 <= 2147483647; {8644#true} is VALID [2022-02-21 03:02:49,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {8644#true} assume ~x - 1 >= -2147483648; {8644#true} is VALID [2022-02-21 03:02:49,229 INFO L272 TraceCheckUtils]: 8: Hoare triple {8644#true} call #t~ret0 := g(~x - 1); {8644#true} is VALID [2022-02-21 03:02:49,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {8644#true} ~x := #in~x; {8644#true} is VALID [2022-02-21 03:02:49,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {8644#true} assume !(0 == ~x); {8644#true} is VALID [2022-02-21 03:02:49,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {8644#true} assume ~x - 1 <= 2147483647; {8644#true} is VALID [2022-02-21 03:02:49,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {8644#true} assume ~x - 1 >= -2147483648; {8644#true} is VALID [2022-02-21 03:02:49,229 INFO L272 TraceCheckUtils]: 13: Hoare triple {8644#true} call #t~ret0 := g(~x - 1); {8644#true} is VALID [2022-02-21 03:02:49,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {8644#true} ~x := #in~x; {8644#true} is VALID [2022-02-21 03:02:49,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {8644#true} assume 0 == ~x;#res := 1; {8644#true} is VALID [2022-02-21 03:02:49,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {8644#true} assume true; {8644#true} is VALID [2022-02-21 03:02:49,229 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8644#true} {8644#true} #32#return; {8644#true} is VALID [2022-02-21 03:02:49,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {8644#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {8644#true} is VALID [2022-02-21 03:02:49,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {8644#true} assume #t~ret0 - 1 <= 2147483647; {8644#true} is VALID [2022-02-21 03:02:49,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {8644#true} assume #t~ret0 - 1 >= -2147483648; {8644#true} is VALID [2022-02-21 03:02:49,230 INFO L272 TraceCheckUtils]: 21: Hoare triple {8644#true} call #t~ret1 := g(#t~ret0 - 1); {8644#true} is VALID [2022-02-21 03:02:49,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {8644#true} ~x := #in~x; {8644#true} is VALID [2022-02-21 03:02:49,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {8644#true} assume 0 == ~x;#res := 1; {8678#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:49,231 INFO L290 TraceCheckUtils]: 24: Hoare triple {8678#(<= 1 |g_#res|)} assume true; {8678#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:49,231 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {8678#(<= 1 |g_#res|)} {8644#true} #34#return; {8677#(<= 1 |g_#t~ret1|)} is VALID [2022-02-21 03:02:49,232 INFO L290 TraceCheckUtils]: 26: Hoare triple {8677#(<= 1 |g_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret0;havoc #t~ret1; {8678#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:49,232 INFO L290 TraceCheckUtils]: 27: Hoare triple {8678#(<= 1 |g_#res|)} assume true; {8678#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:49,232 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8678#(<= 1 |g_#res|)} {8644#true} #32#return; {8666#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:49,233 INFO L290 TraceCheckUtils]: 29: Hoare triple {8666#(<= 1 |g_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {8666#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:49,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {8666#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 <= 2147483647; {8666#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:49,233 INFO L290 TraceCheckUtils]: 31: Hoare triple {8666#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 >= -2147483648; {8666#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:49,234 INFO L272 TraceCheckUtils]: 32: Hoare triple {8666#(<= 1 |g_#t~ret0|)} call #t~ret1 := g(#t~ret0 - 1); {8667#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:02:49,234 INFO L290 TraceCheckUtils]: 33: Hoare triple {8667#(<= 0 |g_#in~x|)} ~x := #in~x; {8668#(<= 0 g_~x)} is VALID [2022-02-21 03:02:49,234 INFO L290 TraceCheckUtils]: 34: Hoare triple {8668#(<= 0 g_~x)} assume !(0 == ~x); {8668#(<= 0 g_~x)} is VALID [2022-02-21 03:02:49,234 INFO L290 TraceCheckUtils]: 35: Hoare triple {8668#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {8668#(<= 0 g_~x)} is VALID [2022-02-21 03:02:49,235 INFO L290 TraceCheckUtils]: 36: Hoare triple {8668#(<= 0 g_~x)} assume !(~x - 1 >= -2147483648); {8645#false} is VALID [2022-02-21 03:02:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-02-21 03:02:49,236 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:49,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322278790] [2022-02-21 03:02:49,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322278790] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:49,236 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:49,236 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 03:02:49,236 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968852928] [2022-02-21 03:02:49,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:49,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-02-21 03:02:49,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:49,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:49,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:49,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-21 03:02:49,252 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:49,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:02:49,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:02:49,253 INFO L87 Difference]: Start difference. First operand 304 states and 373 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:49,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:49,601 INFO L93 Difference]: Finished difference Result 323 states and 396 transitions. [2022-02-21 03:02:49,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:02:49,601 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-02-21 03:02:49,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:49,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:49,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 37 transitions. [2022-02-21 03:02:49,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:49,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 37 transitions. [2022-02-21 03:02:49,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 37 transitions. [2022-02-21 03:02:49,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:49,646 INFO L225 Difference]: With dead ends: 323 [2022-02-21 03:02:49,646 INFO L226 Difference]: Without dead ends: 322 [2022-02-21 03:02:49,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:02:49,648 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:49,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 79 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:49,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-02-21 03:02:49,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 320. [2022-02-21 03:02:49,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:49,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 322 states. Second operand has 320 states, 232 states have (on average 1.0862068965517242) internal successors, (252), 248 states have internal predecessors, (252), 55 states have call successors, (55), 18 states have call predecessors, (55), 32 states have return successors, (70), 53 states have call predecessors, (70), 52 states have call successors, (70) [2022-02-21 03:02:49,812 INFO L74 IsIncluded]: Start isIncluded. First operand 322 states. Second operand has 320 states, 232 states have (on average 1.0862068965517242) internal successors, (252), 248 states have internal predecessors, (252), 55 states have call successors, (55), 18 states have call predecessors, (55), 32 states have return successors, (70), 53 states have call predecessors, (70), 52 states have call successors, (70) [2022-02-21 03:02:49,813 INFO L87 Difference]: Start difference. First operand 322 states. Second operand has 320 states, 232 states have (on average 1.0862068965517242) internal successors, (252), 248 states have internal predecessors, (252), 55 states have call successors, (55), 18 states have call predecessors, (55), 32 states have return successors, (70), 53 states have call predecessors, (70), 52 states have call successors, (70) [2022-02-21 03:02:49,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:49,820 INFO L93 Difference]: Finished difference Result 322 states and 395 transitions. [2022-02-21 03:02:49,820 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 395 transitions. [2022-02-21 03:02:49,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:49,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:49,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 320 states, 232 states have (on average 1.0862068965517242) internal successors, (252), 248 states have internal predecessors, (252), 55 states have call successors, (55), 18 states have call predecessors, (55), 32 states have return successors, (70), 53 states have call predecessors, (70), 52 states have call successors, (70) Second operand 322 states. [2022-02-21 03:02:49,823 INFO L87 Difference]: Start difference. First operand has 320 states, 232 states have (on average 1.0862068965517242) internal successors, (252), 248 states have internal predecessors, (252), 55 states have call successors, (55), 18 states have call predecessors, (55), 32 states have return successors, (70), 53 states have call predecessors, (70), 52 states have call successors, (70) Second operand 322 states. [2022-02-21 03:02:49,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:49,830 INFO L93 Difference]: Finished difference Result 322 states and 395 transitions. [2022-02-21 03:02:49,830 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 395 transitions. [2022-02-21 03:02:49,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:49,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:49,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:49,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:49,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 232 states have (on average 1.0862068965517242) internal successors, (252), 248 states have internal predecessors, (252), 55 states have call successors, (55), 18 states have call predecessors, (55), 32 states have return successors, (70), 53 states have call predecessors, (70), 52 states have call successors, (70) [2022-02-21 03:02:49,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 377 transitions. [2022-02-21 03:02:49,839 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 377 transitions. Word has length 37 [2022-02-21 03:02:49,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:49,839 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 377 transitions. [2022-02-21 03:02:49,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:02:49,840 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 377 transitions. [2022-02-21 03:02:49,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-21 03:02:49,840 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:49,840 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:49,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-21 03:02:49,841 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:02:49,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:49,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1862709720, now seen corresponding path program 3 times [2022-02-21 03:02:49,841 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:49,841 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520324325] [2022-02-21 03:02:49,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:49,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:49,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:02:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:49,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {10127#true} ~x := #in~x; {10127#true} is VALID [2022-02-21 03:02:49,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {10127#true} assume 0 == ~x;#res := 1; {10144#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:49,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {10144#(<= 1 |g_#res|)} assume true; {10144#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:49,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10144#(<= 1 |g_#res|)} {10127#true} #32#return; {10133#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:49,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {10127#true} assume { :begin_inline_ULTIMATE.init } true; {10127#true} is VALID [2022-02-21 03:02:49,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {10127#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {10127#true} is VALID [2022-02-21 03:02:49,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {10127#true} assume !(main_~x~0#1 < 0); {10127#true} is VALID [2022-02-21 03:02:49,940 INFO L272 TraceCheckUtils]: 3: Hoare triple {10127#true} call main_#t~ret3#1 := g(main_~x~0#1); {10127#true} is VALID [2022-02-21 03:02:49,940 INFO L290 TraceCheckUtils]: 4: Hoare triple {10127#true} ~x := #in~x; {10127#true} is VALID [2022-02-21 03:02:49,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {10127#true} assume !(0 == ~x); {10127#true} is VALID [2022-02-21 03:02:49,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {10127#true} assume ~x - 1 <= 2147483647; {10127#true} is VALID [2022-02-21 03:02:49,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {10127#true} assume ~x - 1 >= -2147483648; {10127#true} is VALID [2022-02-21 03:02:49,940 INFO L272 TraceCheckUtils]: 8: Hoare triple {10127#true} call #t~ret0 := g(~x - 1); {10127#true} is VALID [2022-02-21 03:02:49,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {10127#true} ~x := #in~x; {10127#true} is VALID [2022-02-21 03:02:49,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {10127#true} assume 0 == ~x;#res := 1; {10144#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:49,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {10144#(<= 1 |g_#res|)} assume true; {10144#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:49,943 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10144#(<= 1 |g_#res|)} {10127#true} #32#return; {10133#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:49,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {10133#(<= 1 |g_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {10133#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:49,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {10133#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 <= 2147483647; {10133#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:49,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {10133#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 >= -2147483648; {10133#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:49,944 INFO L272 TraceCheckUtils]: 16: Hoare triple {10133#(<= 1 |g_#t~ret0|)} call #t~ret1 := g(#t~ret0 - 1); {10134#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:02:49,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {10134#(<= 0 |g_#in~x|)} ~x := #in~x; {10135#(<= 0 g_~x)} is VALID [2022-02-21 03:02:49,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {10135#(<= 0 g_~x)} assume !(0 == ~x); {10135#(<= 0 g_~x)} is VALID [2022-02-21 03:02:49,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {10135#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {10135#(<= 0 g_~x)} is VALID [2022-02-21 03:02:49,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {10135#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {10135#(<= 0 g_~x)} is VALID [2022-02-21 03:02:49,946 INFO L272 TraceCheckUtils]: 21: Hoare triple {10135#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {10136#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:02:49,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {10136#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {10137#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:49,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {10137#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {10137#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:49,947 INFO L290 TraceCheckUtils]: 24: Hoare triple {10137#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {10137#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:49,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {10137#(<= 0 (+ g_~x 1))} assume ~x - 1 >= -2147483648; {10137#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:49,948 INFO L272 TraceCheckUtils]: 26: Hoare triple {10137#(<= 0 (+ g_~x 1))} call #t~ret0 := g(~x - 1); {10138#(<= 0 (+ |g_#in~x| 2))} is VALID [2022-02-21 03:02:49,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {10138#(<= 0 (+ |g_#in~x| 2))} ~x := #in~x; {10139#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:49,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {10139#(<= 0 (+ 2 g_~x))} assume !(0 == ~x); {10139#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:49,949 INFO L290 TraceCheckUtils]: 29: Hoare triple {10139#(<= 0 (+ 2 g_~x))} assume ~x - 1 <= 2147483647; {10139#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:49,949 INFO L290 TraceCheckUtils]: 30: Hoare triple {10139#(<= 0 (+ 2 g_~x))} assume ~x - 1 >= -2147483648; {10139#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:49,949 INFO L272 TraceCheckUtils]: 31: Hoare triple {10139#(<= 0 (+ 2 g_~x))} call #t~ret0 := g(~x - 1); {10140#(<= 0 (+ |g_#in~x| 3))} is VALID [2022-02-21 03:02:49,950 INFO L290 TraceCheckUtils]: 32: Hoare triple {10140#(<= 0 (+ |g_#in~x| 3))} ~x := #in~x; {10141#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:49,950 INFO L290 TraceCheckUtils]: 33: Hoare triple {10141#(<= 0 (+ 3 g_~x))} assume !(0 == ~x); {10141#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:49,950 INFO L290 TraceCheckUtils]: 34: Hoare triple {10141#(<= 0 (+ 3 g_~x))} assume ~x - 1 <= 2147483647; {10141#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:49,950 INFO L290 TraceCheckUtils]: 35: Hoare triple {10141#(<= 0 (+ 3 g_~x))} assume ~x - 1 >= -2147483648; {10141#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:49,951 INFO L272 TraceCheckUtils]: 36: Hoare triple {10141#(<= 0 (+ 3 g_~x))} call #t~ret0 := g(~x - 1); {10142#(<= 0 (+ |g_#in~x| 4))} is VALID [2022-02-21 03:02:49,951 INFO L290 TraceCheckUtils]: 37: Hoare triple {10142#(<= 0 (+ |g_#in~x| 4))} ~x := #in~x; {10143#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:49,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {10143#(<= 0 (+ g_~x 4))} assume !(0 == ~x); {10143#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:49,952 INFO L290 TraceCheckUtils]: 39: Hoare triple {10143#(<= 0 (+ g_~x 4))} assume ~x - 1 <= 2147483647; {10143#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:49,952 INFO L290 TraceCheckUtils]: 40: Hoare triple {10143#(<= 0 (+ g_~x 4))} assume !(~x - 1 >= -2147483648); {10128#false} is VALID [2022-02-21 03:02:49,952 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 34 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:02:49,952 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:49,952 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520324325] [2022-02-21 03:02:49,953 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520324325] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:02:49,953 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511462426] [2022-02-21 03:02:49,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:02:49,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:49,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:49,954 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:02:49,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-21 03:02:49,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-02-21 03:02:49,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:02:49,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-21 03:02:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:49,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:02:50,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {10127#true} assume { :begin_inline_ULTIMATE.init } true; {10127#true} is VALID [2022-02-21 03:02:50,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {10127#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {10127#true} is VALID [2022-02-21 03:02:50,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {10127#true} assume !(main_~x~0#1 < 0); {10127#true} is VALID [2022-02-21 03:02:50,205 INFO L272 TraceCheckUtils]: 3: Hoare triple {10127#true} call main_#t~ret3#1 := g(main_~x~0#1); {10127#true} is VALID [2022-02-21 03:02:50,205 INFO L290 TraceCheckUtils]: 4: Hoare triple {10127#true} ~x := #in~x; {10127#true} is VALID [2022-02-21 03:02:50,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {10127#true} assume !(0 == ~x); {10127#true} is VALID [2022-02-21 03:02:50,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {10127#true} assume ~x - 1 <= 2147483647; {10127#true} is VALID [2022-02-21 03:02:50,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {10127#true} assume ~x - 1 >= -2147483648; {10127#true} is VALID [2022-02-21 03:02:50,206 INFO L272 TraceCheckUtils]: 8: Hoare triple {10127#true} call #t~ret0 := g(~x - 1); {10127#true} is VALID [2022-02-21 03:02:50,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {10127#true} ~x := #in~x; {10127#true} is VALID [2022-02-21 03:02:50,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {10127#true} assume 0 == ~x;#res := 1; {10144#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:50,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {10144#(<= 1 |g_#res|)} assume true; {10144#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:50,207 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10144#(<= 1 |g_#res|)} {10127#true} #32#return; {10133#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:50,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {10133#(<= 1 |g_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {10133#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:50,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {10133#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 <= 2147483647; {10133#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:50,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {10133#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 >= -2147483648; {10133#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:50,208 INFO L272 TraceCheckUtils]: 16: Hoare triple {10133#(<= 1 |g_#t~ret0|)} call #t~ret1 := g(#t~ret0 - 1); {10134#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:02:50,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {10134#(<= 0 |g_#in~x|)} ~x := #in~x; {10135#(<= 0 g_~x)} is VALID [2022-02-21 03:02:50,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {10135#(<= 0 g_~x)} assume !(0 == ~x); {10135#(<= 0 g_~x)} is VALID [2022-02-21 03:02:50,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {10135#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {10135#(<= 0 g_~x)} is VALID [2022-02-21 03:02:50,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {10135#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {10135#(<= 0 g_~x)} is VALID [2022-02-21 03:02:50,210 INFO L272 TraceCheckUtils]: 21: Hoare triple {10135#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {10136#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:02:50,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {10136#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {10137#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:50,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {10137#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {10137#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:50,211 INFO L290 TraceCheckUtils]: 24: Hoare triple {10137#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {10137#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:50,211 INFO L290 TraceCheckUtils]: 25: Hoare triple {10137#(<= 0 (+ g_~x 1))} assume ~x - 1 >= -2147483648; {10137#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:50,212 INFO L272 TraceCheckUtils]: 26: Hoare triple {10137#(<= 0 (+ g_~x 1))} call #t~ret0 := g(~x - 1); {10138#(<= 0 (+ |g_#in~x| 2))} is VALID [2022-02-21 03:02:50,212 INFO L290 TraceCheckUtils]: 27: Hoare triple {10138#(<= 0 (+ |g_#in~x| 2))} ~x := #in~x; {10139#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:50,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {10139#(<= 0 (+ 2 g_~x))} assume !(0 == ~x); {10139#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:50,213 INFO L290 TraceCheckUtils]: 29: Hoare triple {10139#(<= 0 (+ 2 g_~x))} assume ~x - 1 <= 2147483647; {10139#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:50,213 INFO L290 TraceCheckUtils]: 30: Hoare triple {10139#(<= 0 (+ 2 g_~x))} assume ~x - 1 >= -2147483648; {10139#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:50,213 INFO L272 TraceCheckUtils]: 31: Hoare triple {10139#(<= 0 (+ 2 g_~x))} call #t~ret0 := g(~x - 1); {10140#(<= 0 (+ |g_#in~x| 3))} is VALID [2022-02-21 03:02:50,214 INFO L290 TraceCheckUtils]: 32: Hoare triple {10140#(<= 0 (+ |g_#in~x| 3))} ~x := #in~x; {10141#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:50,214 INFO L290 TraceCheckUtils]: 33: Hoare triple {10141#(<= 0 (+ 3 g_~x))} assume !(0 == ~x); {10141#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:50,214 INFO L290 TraceCheckUtils]: 34: Hoare triple {10141#(<= 0 (+ 3 g_~x))} assume ~x - 1 <= 2147483647; {10141#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:50,215 INFO L290 TraceCheckUtils]: 35: Hoare triple {10141#(<= 0 (+ 3 g_~x))} assume ~x - 1 >= -2147483648; {10141#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:50,215 INFO L272 TraceCheckUtils]: 36: Hoare triple {10141#(<= 0 (+ 3 g_~x))} call #t~ret0 := g(~x - 1); {10142#(<= 0 (+ |g_#in~x| 4))} is VALID [2022-02-21 03:02:50,216 INFO L290 TraceCheckUtils]: 37: Hoare triple {10142#(<= 0 (+ |g_#in~x| 4))} ~x := #in~x; {10143#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:50,216 INFO L290 TraceCheckUtils]: 38: Hoare triple {10143#(<= 0 (+ g_~x 4))} assume !(0 == ~x); {10143#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:50,216 INFO L290 TraceCheckUtils]: 39: Hoare triple {10143#(<= 0 (+ g_~x 4))} assume ~x - 1 <= 2147483647; {10143#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:50,216 INFO L290 TraceCheckUtils]: 40: Hoare triple {10143#(<= 0 (+ g_~x 4))} assume !(~x - 1 >= -2147483648); {10128#false} is VALID [2022-02-21 03:02:50,217 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 34 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:02:50,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:02:50,607 INFO L290 TraceCheckUtils]: 40: Hoare triple {10268#(<= 0 (+ 2147483647 g_~x))} assume !(~x - 1 >= -2147483648); {10128#false} is VALID [2022-02-21 03:02:50,608 INFO L290 TraceCheckUtils]: 39: Hoare triple {10268#(<= 0 (+ 2147483647 g_~x))} assume ~x - 1 <= 2147483647; {10268#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:50,608 INFO L290 TraceCheckUtils]: 38: Hoare triple {10268#(<= 0 (+ 2147483647 g_~x))} assume !(0 == ~x); {10268#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:50,609 INFO L290 TraceCheckUtils]: 37: Hoare triple {10278#(<= 0 (+ 2147483647 |g_#in~x|))} ~x := #in~x; {10268#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:50,611 INFO L272 TraceCheckUtils]: 36: Hoare triple {10282#(<= 0 (+ g_~x 2147483646))} call #t~ret0 := g(~x - 1); {10278#(<= 0 (+ 2147483647 |g_#in~x|))} is VALID [2022-02-21 03:02:50,612 INFO L290 TraceCheckUtils]: 35: Hoare triple {10282#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 >= -2147483648; {10282#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:50,612 INFO L290 TraceCheckUtils]: 34: Hoare triple {10282#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 <= 2147483647; {10282#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:50,613 INFO L290 TraceCheckUtils]: 33: Hoare triple {10282#(<= 0 (+ g_~x 2147483646))} assume !(0 == ~x); {10282#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:50,613 INFO L290 TraceCheckUtils]: 32: Hoare triple {10295#(<= 0 (+ |g_#in~x| 2147483646))} ~x := #in~x; {10282#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:50,614 INFO L272 TraceCheckUtils]: 31: Hoare triple {10299#(<= 0 (+ 2147483645 g_~x))} call #t~ret0 := g(~x - 1); {10295#(<= 0 (+ |g_#in~x| 2147483646))} is VALID [2022-02-21 03:02:50,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {10299#(<= 0 (+ 2147483645 g_~x))} assume ~x - 1 >= -2147483648; {10299#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:02:50,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {10299#(<= 0 (+ 2147483645 g_~x))} assume ~x - 1 <= 2147483647; {10299#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:02:50,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {10299#(<= 0 (+ 2147483645 g_~x))} assume !(0 == ~x); {10299#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:02:50,616 INFO L290 TraceCheckUtils]: 27: Hoare triple {10312#(<= 0 (+ 2147483645 |g_#in~x|))} ~x := #in~x; {10299#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:02:50,616 INFO L272 TraceCheckUtils]: 26: Hoare triple {10316#(<= 0 (+ g_~x 2147483644))} call #t~ret0 := g(~x - 1); {10312#(<= 0 (+ 2147483645 |g_#in~x|))} is VALID [2022-02-21 03:02:50,617 INFO L290 TraceCheckUtils]: 25: Hoare triple {10316#(<= 0 (+ g_~x 2147483644))} assume ~x - 1 >= -2147483648; {10316#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:02:50,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {10316#(<= 0 (+ g_~x 2147483644))} assume ~x - 1 <= 2147483647; {10316#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:02:50,618 INFO L290 TraceCheckUtils]: 23: Hoare triple {10316#(<= 0 (+ g_~x 2147483644))} assume !(0 == ~x); {10316#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:02:50,618 INFO L290 TraceCheckUtils]: 22: Hoare triple {10329#(<= 0 (+ |g_#in~x| 2147483644))} ~x := #in~x; {10316#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:02:50,619 INFO L272 TraceCheckUtils]: 21: Hoare triple {10333#(<= 0 (+ 2147483643 g_~x))} call #t~ret0 := g(~x - 1); {10329#(<= 0 (+ |g_#in~x| 2147483644))} is VALID [2022-02-21 03:02:50,619 INFO L290 TraceCheckUtils]: 20: Hoare triple {10333#(<= 0 (+ 2147483643 g_~x))} assume ~x - 1 >= -2147483648; {10333#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:02:50,619 INFO L290 TraceCheckUtils]: 19: Hoare triple {10333#(<= 0 (+ 2147483643 g_~x))} assume ~x - 1 <= 2147483647; {10333#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:02:50,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {10333#(<= 0 (+ 2147483643 g_~x))} assume !(0 == ~x); {10333#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:02:50,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {10346#(<= 0 (+ 2147483643 |g_#in~x|))} ~x := #in~x; {10333#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:02:50,621 INFO L272 TraceCheckUtils]: 16: Hoare triple {10350#(<= 0 (+ 2147483642 |g_#t~ret0|))} call #t~ret1 := g(#t~ret0 - 1); {10346#(<= 0 (+ 2147483643 |g_#in~x|))} is VALID [2022-02-21 03:02:50,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {10350#(<= 0 (+ 2147483642 |g_#t~ret0|))} assume #t~ret0 - 1 >= -2147483648; {10350#(<= 0 (+ 2147483642 |g_#t~ret0|))} is VALID [2022-02-21 03:02:50,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {10350#(<= 0 (+ 2147483642 |g_#t~ret0|))} assume #t~ret0 - 1 <= 2147483647; {10350#(<= 0 (+ 2147483642 |g_#t~ret0|))} is VALID [2022-02-21 03:02:50,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {10350#(<= 0 (+ 2147483642 |g_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {10350#(<= 0 (+ 2147483642 |g_#t~ret0|))} is VALID [2022-02-21 03:02:50,623 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10366#(<= 0 (+ |g_#res| 2147483642))} {10127#true} #32#return; {10350#(<= 0 (+ 2147483642 |g_#t~ret0|))} is VALID [2022-02-21 03:02:50,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {10366#(<= 0 (+ |g_#res| 2147483642))} assume true; {10366#(<= 0 (+ |g_#res| 2147483642))} is VALID [2022-02-21 03:02:50,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {10127#true} assume 0 == ~x;#res := 1; {10366#(<= 0 (+ |g_#res| 2147483642))} is VALID [2022-02-21 03:02:50,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {10127#true} ~x := #in~x; {10127#true} is VALID [2022-02-21 03:02:50,624 INFO L272 TraceCheckUtils]: 8: Hoare triple {10127#true} call #t~ret0 := g(~x - 1); {10127#true} is VALID [2022-02-21 03:02:50,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {10127#true} assume ~x - 1 >= -2147483648; {10127#true} is VALID [2022-02-21 03:02:50,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {10127#true} assume ~x - 1 <= 2147483647; {10127#true} is VALID [2022-02-21 03:02:50,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {10127#true} assume !(0 == ~x); {10127#true} is VALID [2022-02-21 03:02:50,625 INFO L290 TraceCheckUtils]: 4: Hoare triple {10127#true} ~x := #in~x; {10127#true} is VALID [2022-02-21 03:02:50,625 INFO L272 TraceCheckUtils]: 3: Hoare triple {10127#true} call main_#t~ret3#1 := g(main_~x~0#1); {10127#true} is VALID [2022-02-21 03:02:50,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {10127#true} assume !(main_~x~0#1 < 0); {10127#true} is VALID [2022-02-21 03:02:50,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {10127#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {10127#true} is VALID [2022-02-21 03:02:50,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {10127#true} assume { :begin_inline_ULTIMATE.init } true; {10127#true} is VALID [2022-02-21 03:02:50,626 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 34 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:02:50,626 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511462426] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:02:50,626 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:02:50,626 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-02-21 03:02:50,627 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976593338] [2022-02-21 03:02:50,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:02:50,627 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 16 states have internal predecessors, (57), 11 states have call successors, (12), 11 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2022-02-21 03:02:50,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:50,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 2.28) internal successors, (57), 16 states have internal predecessors, (57), 11 states have call successors, (12), 11 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:50,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:50,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-21 03:02:50,682 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:50,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-21 03:02:50,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2022-02-21 03:02:50,683 INFO L87 Difference]: Start difference. First operand 320 states and 377 transitions. Second operand has 26 states, 25 states have (on average 2.28) internal successors, (57), 16 states have internal predecessors, (57), 11 states have call successors, (12), 11 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:52,880 INFO L93 Difference]: Finished difference Result 456 states and 580 transitions. [2022-02-21 03:02:52,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-02-21 03:02:52,880 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 16 states have internal predecessors, (57), 11 states have call successors, (12), 11 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2022-02-21 03:02:52,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:52,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.28) internal successors, (57), 16 states have internal predecessors, (57), 11 states have call successors, (12), 11 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:52,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 275 transitions. [2022-02-21 03:02:52,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.28) internal successors, (57), 16 states have internal predecessors, (57), 11 states have call successors, (12), 11 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:52,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 275 transitions. [2022-02-21 03:02:52,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 275 transitions. [2022-02-21 03:02:53,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 275 edges. 275 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:53,110 INFO L225 Difference]: With dead ends: 456 [2022-02-21 03:02:53,111 INFO L226 Difference]: Without dead ends: 455 [2022-02-21 03:02:53,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=900, Invalid=2406, Unknown=0, NotChecked=0, Total=3306 [2022-02-21 03:02:53,113 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 380 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:53,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 195 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-21 03:02:53,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-02-21 03:02:53,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 428. [2022-02-21 03:02:53,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:53,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 455 states. Second operand has 428 states, 310 states have (on average 1.0838709677419356) internal successors, (336), 332 states have internal predecessors, (336), 73 states have call successors, (73), 24 states have call predecessors, (73), 44 states have return successors, (94), 71 states have call predecessors, (94), 70 states have call successors, (94) [2022-02-21 03:02:53,413 INFO L74 IsIncluded]: Start isIncluded. First operand 455 states. Second operand has 428 states, 310 states have (on average 1.0838709677419356) internal successors, (336), 332 states have internal predecessors, (336), 73 states have call successors, (73), 24 states have call predecessors, (73), 44 states have return successors, (94), 71 states have call predecessors, (94), 70 states have call successors, (94) [2022-02-21 03:02:53,414 INFO L87 Difference]: Start difference. First operand 455 states. Second operand has 428 states, 310 states have (on average 1.0838709677419356) internal successors, (336), 332 states have internal predecessors, (336), 73 states have call successors, (73), 24 states have call predecessors, (73), 44 states have return successors, (94), 71 states have call predecessors, (94), 70 states have call successors, (94) [2022-02-21 03:02:53,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:53,425 INFO L93 Difference]: Finished difference Result 455 states and 574 transitions. [2022-02-21 03:02:53,425 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 574 transitions. [2022-02-21 03:02:53,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:53,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:53,428 INFO L74 IsIncluded]: Start isIncluded. First operand has 428 states, 310 states have (on average 1.0838709677419356) internal successors, (336), 332 states have internal predecessors, (336), 73 states have call successors, (73), 24 states have call predecessors, (73), 44 states have return successors, (94), 71 states have call predecessors, (94), 70 states have call successors, (94) Second operand 455 states. [2022-02-21 03:02:53,428 INFO L87 Difference]: Start difference. First operand has 428 states, 310 states have (on average 1.0838709677419356) internal successors, (336), 332 states have internal predecessors, (336), 73 states have call successors, (73), 24 states have call predecessors, (73), 44 states have return successors, (94), 71 states have call predecessors, (94), 70 states have call successors, (94) Second operand 455 states. [2022-02-21 03:02:53,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:53,441 INFO L93 Difference]: Finished difference Result 455 states and 574 transitions. [2022-02-21 03:02:53,441 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 574 transitions. [2022-02-21 03:02:53,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:53,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:53,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:53,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:53,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 310 states have (on average 1.0838709677419356) internal successors, (336), 332 states have internal predecessors, (336), 73 states have call successors, (73), 24 states have call predecessors, (73), 44 states have return successors, (94), 71 states have call predecessors, (94), 70 states have call successors, (94) [2022-02-21 03:02:53,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 503 transitions. [2022-02-21 03:02:53,454 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 503 transitions. Word has length 41 [2022-02-21 03:02:53,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:53,455 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 503 transitions. [2022-02-21 03:02:53,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 16 states have internal predecessors, (57), 11 states have call successors, (12), 11 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:53,455 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 503 transitions. [2022-02-21 03:02:53,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-21 03:02:53,456 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:53,457 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:53,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:02:53,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:53,674 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:02:53,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:53,674 INFO L85 PathProgramCache]: Analyzing trace with hash 35704530, now seen corresponding path program 2 times [2022-02-21 03:02:53,674 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:53,674 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483771752] [2022-02-21 03:02:53,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:53,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:53,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:02:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:53,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 03:02:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:53,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {12461#true} ~x := #in~x; {12461#true} is VALID [2022-02-21 03:02:53,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {12461#true} assume 0 == ~x;#res := 1; {12461#true} is VALID [2022-02-21 03:02:53,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {12461#true} assume true; {12461#true} is VALID [2022-02-21 03:02:53,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12461#true} {12461#true} #32#return; {12461#true} is VALID [2022-02-21 03:02:53,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:02:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:53,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {12461#true} ~x := #in~x; {12461#true} is VALID [2022-02-21 03:02:53,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {12461#true} assume 0 == ~x;#res := 1; {12497#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:53,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {12497#(<= 1 |g_#res|)} assume true; {12497#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:53,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12497#(<= 1 |g_#res|)} {12461#true} #34#return; {12496#(<= 1 |g_#t~ret1|)} is VALID [2022-02-21 03:02:53,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {12461#true} ~x := #in~x; {12461#true} is VALID [2022-02-21 03:02:53,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {12461#true} assume !(0 == ~x); {12461#true} is VALID [2022-02-21 03:02:53,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {12461#true} assume ~x - 1 <= 2147483647; {12461#true} is VALID [2022-02-21 03:02:53,758 INFO L290 TraceCheckUtils]: 3: Hoare triple {12461#true} assume ~x - 1 >= -2147483648; {12461#true} is VALID [2022-02-21 03:02:53,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {12461#true} call #t~ret0 := g(~x - 1); {12461#true} is VALID [2022-02-21 03:02:53,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {12461#true} ~x := #in~x; {12461#true} is VALID [2022-02-21 03:02:53,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {12461#true} assume 0 == ~x;#res := 1; {12461#true} is VALID [2022-02-21 03:02:53,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {12461#true} assume true; {12461#true} is VALID [2022-02-21 03:02:53,759 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {12461#true} {12461#true} #32#return; {12461#true} is VALID [2022-02-21 03:02:53,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {12461#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {12461#true} is VALID [2022-02-21 03:02:53,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {12461#true} assume #t~ret0 - 1 <= 2147483647; {12461#true} is VALID [2022-02-21 03:02:53,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {12461#true} assume #t~ret0 - 1 >= -2147483648; {12461#true} is VALID [2022-02-21 03:02:53,759 INFO L272 TraceCheckUtils]: 12: Hoare triple {12461#true} call #t~ret1 := g(#t~ret0 - 1); {12461#true} is VALID [2022-02-21 03:02:53,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {12461#true} ~x := #in~x; {12461#true} is VALID [2022-02-21 03:02:53,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {12461#true} assume 0 == ~x;#res := 1; {12497#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:53,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {12497#(<= 1 |g_#res|)} assume true; {12497#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:53,760 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12497#(<= 1 |g_#res|)} {12461#true} #34#return; {12496#(<= 1 |g_#t~ret1|)} is VALID [2022-02-21 03:02:53,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {12496#(<= 1 |g_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret0;havoc #t~ret1; {12497#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:53,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {12497#(<= 1 |g_#res|)} assume true; {12497#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:53,761 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {12497#(<= 1 |g_#res|)} {12461#true} #32#return; {12483#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:53,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {12461#true} assume { :begin_inline_ULTIMATE.init } true; {12461#true} is VALID [2022-02-21 03:02:53,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {12461#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {12461#true} is VALID [2022-02-21 03:02:53,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {12461#true} assume !(main_~x~0#1 < 0); {12461#true} is VALID [2022-02-21 03:02:53,762 INFO L272 TraceCheckUtils]: 3: Hoare triple {12461#true} call main_#t~ret3#1 := g(main_~x~0#1); {12461#true} is VALID [2022-02-21 03:02:53,762 INFO L290 TraceCheckUtils]: 4: Hoare triple {12461#true} ~x := #in~x; {12461#true} is VALID [2022-02-21 03:02:53,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {12461#true} assume !(0 == ~x); {12461#true} is VALID [2022-02-21 03:02:53,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {12461#true} assume ~x - 1 <= 2147483647; {12461#true} is VALID [2022-02-21 03:02:53,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {12461#true} assume ~x - 1 >= -2147483648; {12461#true} is VALID [2022-02-21 03:02:53,763 INFO L272 TraceCheckUtils]: 8: Hoare triple {12461#true} call #t~ret0 := g(~x - 1); {12461#true} is VALID [2022-02-21 03:02:53,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {12461#true} ~x := #in~x; {12461#true} is VALID [2022-02-21 03:02:53,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {12461#true} assume !(0 == ~x); {12461#true} is VALID [2022-02-21 03:02:53,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {12461#true} assume ~x - 1 <= 2147483647; {12461#true} is VALID [2022-02-21 03:02:53,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {12461#true} assume ~x - 1 >= -2147483648; {12461#true} is VALID [2022-02-21 03:02:53,764 INFO L272 TraceCheckUtils]: 13: Hoare triple {12461#true} call #t~ret0 := g(~x - 1); {12461#true} is VALID [2022-02-21 03:02:53,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {12461#true} ~x := #in~x; {12461#true} is VALID [2022-02-21 03:02:53,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {12461#true} assume 0 == ~x;#res := 1; {12461#true} is VALID [2022-02-21 03:02:53,764 INFO L290 TraceCheckUtils]: 16: Hoare triple {12461#true} assume true; {12461#true} is VALID [2022-02-21 03:02:53,764 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12461#true} {12461#true} #32#return; {12461#true} is VALID [2022-02-21 03:02:53,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {12461#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {12461#true} is VALID [2022-02-21 03:02:53,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {12461#true} assume #t~ret0 - 1 <= 2147483647; {12461#true} is VALID [2022-02-21 03:02:53,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {12461#true} assume #t~ret0 - 1 >= -2147483648; {12461#true} is VALID [2022-02-21 03:02:53,764 INFO L272 TraceCheckUtils]: 21: Hoare triple {12461#true} call #t~ret1 := g(#t~ret0 - 1); {12461#true} is VALID [2022-02-21 03:02:53,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {12461#true} ~x := #in~x; {12461#true} is VALID [2022-02-21 03:02:53,765 INFO L290 TraceCheckUtils]: 23: Hoare triple {12461#true} assume 0 == ~x;#res := 1; {12497#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:53,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {12497#(<= 1 |g_#res|)} assume true; {12497#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:53,766 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {12497#(<= 1 |g_#res|)} {12461#true} #34#return; {12496#(<= 1 |g_#t~ret1|)} is VALID [2022-02-21 03:02:53,766 INFO L290 TraceCheckUtils]: 26: Hoare triple {12496#(<= 1 |g_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret0;havoc #t~ret1; {12497#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:53,766 INFO L290 TraceCheckUtils]: 27: Hoare triple {12497#(<= 1 |g_#res|)} assume true; {12497#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:53,767 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {12497#(<= 1 |g_#res|)} {12461#true} #32#return; {12483#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:53,767 INFO L290 TraceCheckUtils]: 29: Hoare triple {12483#(<= 1 |g_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {12483#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:53,767 INFO L290 TraceCheckUtils]: 30: Hoare triple {12483#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 <= 2147483647; {12483#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:53,768 INFO L290 TraceCheckUtils]: 31: Hoare triple {12483#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 >= -2147483648; {12483#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:53,768 INFO L272 TraceCheckUtils]: 32: Hoare triple {12483#(<= 1 |g_#t~ret0|)} call #t~ret1 := g(#t~ret0 - 1); {12484#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:02:53,768 INFO L290 TraceCheckUtils]: 33: Hoare triple {12484#(<= 0 |g_#in~x|)} ~x := #in~x; {12485#(<= 0 g_~x)} is VALID [2022-02-21 03:02:53,769 INFO L290 TraceCheckUtils]: 34: Hoare triple {12485#(<= 0 g_~x)} assume !(0 == ~x); {12485#(<= 0 g_~x)} is VALID [2022-02-21 03:02:53,769 INFO L290 TraceCheckUtils]: 35: Hoare triple {12485#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {12485#(<= 0 g_~x)} is VALID [2022-02-21 03:02:53,769 INFO L290 TraceCheckUtils]: 36: Hoare triple {12485#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {12485#(<= 0 g_~x)} is VALID [2022-02-21 03:02:53,770 INFO L272 TraceCheckUtils]: 37: Hoare triple {12485#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {12486#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:02:53,770 INFO L290 TraceCheckUtils]: 38: Hoare triple {12486#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {12487#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:53,770 INFO L290 TraceCheckUtils]: 39: Hoare triple {12487#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {12487#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:53,770 INFO L290 TraceCheckUtils]: 40: Hoare triple {12487#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {12487#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:53,771 INFO L290 TraceCheckUtils]: 41: Hoare triple {12487#(<= 0 (+ g_~x 1))} assume !(~x - 1 >= -2147483648); {12462#false} is VALID [2022-02-21 03:02:53,771 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-02-21 03:02:53,771 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:53,771 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483771752] [2022-02-21 03:02:53,771 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483771752] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:02:53,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005667648] [2022-02-21 03:02:53,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:02:53,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:53,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:53,773 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:02:53,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-21 03:02:53,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:02:53,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:02:53,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 03:02:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:53,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:02:53,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {12461#true} assume { :begin_inline_ULTIMATE.init } true; {12461#true} is VALID [2022-02-21 03:02:53,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {12461#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {12461#true} is VALID [2022-02-21 03:02:53,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {12461#true} assume !(main_~x~0#1 < 0); {12461#true} is VALID [2022-02-21 03:02:53,964 INFO L272 TraceCheckUtils]: 3: Hoare triple {12461#true} call main_#t~ret3#1 := g(main_~x~0#1); {12461#true} is VALID [2022-02-21 03:02:53,964 INFO L290 TraceCheckUtils]: 4: Hoare triple {12461#true} ~x := #in~x; {12461#true} is VALID [2022-02-21 03:02:53,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {12461#true} assume !(0 == ~x); {12461#true} is VALID [2022-02-21 03:02:53,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {12461#true} assume ~x - 1 <= 2147483647; {12461#true} is VALID [2022-02-21 03:02:53,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {12461#true} assume ~x - 1 >= -2147483648; {12461#true} is VALID [2022-02-21 03:02:53,964 INFO L272 TraceCheckUtils]: 8: Hoare triple {12461#true} call #t~ret0 := g(~x - 1); {12461#true} is VALID [2022-02-21 03:02:53,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {12461#true} ~x := #in~x; {12461#true} is VALID [2022-02-21 03:02:53,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {12461#true} assume !(0 == ~x); {12461#true} is VALID [2022-02-21 03:02:53,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {12461#true} assume ~x - 1 <= 2147483647; {12461#true} is VALID [2022-02-21 03:02:53,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {12461#true} assume ~x - 1 >= -2147483648; {12461#true} is VALID [2022-02-21 03:02:53,965 INFO L272 TraceCheckUtils]: 13: Hoare triple {12461#true} call #t~ret0 := g(~x - 1); {12461#true} is VALID [2022-02-21 03:02:53,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {12461#true} ~x := #in~x; {12461#true} is VALID [2022-02-21 03:02:53,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {12461#true} assume 0 == ~x;#res := 1; {12461#true} is VALID [2022-02-21 03:02:53,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {12461#true} assume true; {12461#true} is VALID [2022-02-21 03:02:53,965 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12461#true} {12461#true} #32#return; {12461#true} is VALID [2022-02-21 03:02:53,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {12461#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {12461#true} is VALID [2022-02-21 03:02:53,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {12461#true} assume #t~ret0 - 1 <= 2147483647; {12461#true} is VALID [2022-02-21 03:02:53,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {12461#true} assume #t~ret0 - 1 >= -2147483648; {12461#true} is VALID [2022-02-21 03:02:53,966 INFO L272 TraceCheckUtils]: 21: Hoare triple {12461#true} call #t~ret1 := g(#t~ret0 - 1); {12461#true} is VALID [2022-02-21 03:02:53,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {12461#true} ~x := #in~x; {12461#true} is VALID [2022-02-21 03:02:53,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {12461#true} assume 0 == ~x;#res := 1; {12497#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:53,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {12497#(<= 1 |g_#res|)} assume true; {12497#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:53,979 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {12497#(<= 1 |g_#res|)} {12461#true} #34#return; {12496#(<= 1 |g_#t~ret1|)} is VALID [2022-02-21 03:02:53,979 INFO L290 TraceCheckUtils]: 26: Hoare triple {12496#(<= 1 |g_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret0;havoc #t~ret1; {12497#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:53,979 INFO L290 TraceCheckUtils]: 27: Hoare triple {12497#(<= 1 |g_#res|)} assume true; {12497#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:53,980 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {12497#(<= 1 |g_#res|)} {12461#true} #32#return; {12483#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:53,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {12483#(<= 1 |g_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {12483#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:53,981 INFO L290 TraceCheckUtils]: 30: Hoare triple {12483#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 <= 2147483647; {12483#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:53,981 INFO L290 TraceCheckUtils]: 31: Hoare triple {12483#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 >= -2147483648; {12483#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:53,981 INFO L272 TraceCheckUtils]: 32: Hoare triple {12483#(<= 1 |g_#t~ret0|)} call #t~ret1 := g(#t~ret0 - 1); {12484#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:02:53,982 INFO L290 TraceCheckUtils]: 33: Hoare triple {12484#(<= 0 |g_#in~x|)} ~x := #in~x; {12485#(<= 0 g_~x)} is VALID [2022-02-21 03:02:53,982 INFO L290 TraceCheckUtils]: 34: Hoare triple {12485#(<= 0 g_~x)} assume !(0 == ~x); {12485#(<= 0 g_~x)} is VALID [2022-02-21 03:02:53,982 INFO L290 TraceCheckUtils]: 35: Hoare triple {12485#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {12485#(<= 0 g_~x)} is VALID [2022-02-21 03:02:53,983 INFO L290 TraceCheckUtils]: 36: Hoare triple {12485#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {12485#(<= 0 g_~x)} is VALID [2022-02-21 03:02:53,983 INFO L272 TraceCheckUtils]: 37: Hoare triple {12485#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {12486#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:02:53,984 INFO L290 TraceCheckUtils]: 38: Hoare triple {12486#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {12487#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:53,984 INFO L290 TraceCheckUtils]: 39: Hoare triple {12487#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {12487#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:53,984 INFO L290 TraceCheckUtils]: 40: Hoare triple {12487#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {12487#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:53,985 INFO L290 TraceCheckUtils]: 41: Hoare triple {12487#(<= 0 (+ g_~x 1))} assume !(~x - 1 >= -2147483648); {12462#false} is VALID [2022-02-21 03:02:53,985 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-02-21 03:02:53,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:02:54,377 INFO L290 TraceCheckUtils]: 41: Hoare triple {12624#(<= 0 (+ 2147483647 g_~x))} assume !(~x - 1 >= -2147483648); {12462#false} is VALID [2022-02-21 03:02:54,378 INFO L290 TraceCheckUtils]: 40: Hoare triple {12624#(<= 0 (+ 2147483647 g_~x))} assume ~x - 1 <= 2147483647; {12624#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:54,378 INFO L290 TraceCheckUtils]: 39: Hoare triple {12624#(<= 0 (+ 2147483647 g_~x))} assume !(0 == ~x); {12624#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:54,378 INFO L290 TraceCheckUtils]: 38: Hoare triple {12634#(<= 0 (+ 2147483647 |g_#in~x|))} ~x := #in~x; {12624#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:54,379 INFO L272 TraceCheckUtils]: 37: Hoare triple {12638#(<= 0 (+ g_~x 2147483646))} call #t~ret0 := g(~x - 1); {12634#(<= 0 (+ 2147483647 |g_#in~x|))} is VALID [2022-02-21 03:02:54,379 INFO L290 TraceCheckUtils]: 36: Hoare triple {12638#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 >= -2147483648; {12638#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:54,380 INFO L290 TraceCheckUtils]: 35: Hoare triple {12638#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 <= 2147483647; {12638#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:54,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {12638#(<= 0 (+ g_~x 2147483646))} assume !(0 == ~x); {12638#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:54,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {12651#(<= 0 (+ |g_#in~x| 2147483646))} ~x := #in~x; {12638#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:54,381 INFO L272 TraceCheckUtils]: 32: Hoare triple {12655#(<= 0 (+ 2147483645 |g_#t~ret0|))} call #t~ret1 := g(#t~ret0 - 1); {12651#(<= 0 (+ |g_#in~x| 2147483646))} is VALID [2022-02-21 03:02:54,381 INFO L290 TraceCheckUtils]: 31: Hoare triple {12655#(<= 0 (+ 2147483645 |g_#t~ret0|))} assume #t~ret0 - 1 >= -2147483648; {12655#(<= 0 (+ 2147483645 |g_#t~ret0|))} is VALID [2022-02-21 03:02:54,382 INFO L290 TraceCheckUtils]: 30: Hoare triple {12655#(<= 0 (+ 2147483645 |g_#t~ret0|))} assume #t~ret0 - 1 <= 2147483647; {12655#(<= 0 (+ 2147483645 |g_#t~ret0|))} is VALID [2022-02-21 03:02:54,382 INFO L290 TraceCheckUtils]: 29: Hoare triple {12655#(<= 0 (+ 2147483645 |g_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {12655#(<= 0 (+ 2147483645 |g_#t~ret0|))} is VALID [2022-02-21 03:02:54,383 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {12671#(<= 0 (+ 2147483645 |g_#res|))} {12461#true} #32#return; {12655#(<= 0 (+ 2147483645 |g_#t~ret0|))} is VALID [2022-02-21 03:02:54,383 INFO L290 TraceCheckUtils]: 27: Hoare triple {12671#(<= 0 (+ 2147483645 |g_#res|))} assume true; {12671#(<= 0 (+ 2147483645 |g_#res|))} is VALID [2022-02-21 03:02:54,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {12678#(<= 0 (+ 2147483645 |g_#t~ret1|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret0;havoc #t~ret1; {12671#(<= 0 (+ 2147483645 |g_#res|))} is VALID [2022-02-21 03:02:54,384 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {12671#(<= 0 (+ 2147483645 |g_#res|))} {12461#true} #34#return; {12678#(<= 0 (+ 2147483645 |g_#t~ret1|))} is VALID [2022-02-21 03:02:54,384 INFO L290 TraceCheckUtils]: 24: Hoare triple {12671#(<= 0 (+ 2147483645 |g_#res|))} assume true; {12671#(<= 0 (+ 2147483645 |g_#res|))} is VALID [2022-02-21 03:02:54,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {12461#true} assume 0 == ~x;#res := 1; {12671#(<= 0 (+ 2147483645 |g_#res|))} is VALID [2022-02-21 03:02:54,385 INFO L290 TraceCheckUtils]: 22: Hoare triple {12461#true} ~x := #in~x; {12461#true} is VALID [2022-02-21 03:02:54,385 INFO L272 TraceCheckUtils]: 21: Hoare triple {12461#true} call #t~ret1 := g(#t~ret0 - 1); {12461#true} is VALID [2022-02-21 03:02:54,385 INFO L290 TraceCheckUtils]: 20: Hoare triple {12461#true} assume #t~ret0 - 1 >= -2147483648; {12461#true} is VALID [2022-02-21 03:02:54,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {12461#true} assume #t~ret0 - 1 <= 2147483647; {12461#true} is VALID [2022-02-21 03:02:54,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {12461#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {12461#true} is VALID [2022-02-21 03:02:54,386 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12461#true} {12461#true} #32#return; {12461#true} is VALID [2022-02-21 03:02:54,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {12461#true} assume true; {12461#true} is VALID [2022-02-21 03:02:54,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {12461#true} assume 0 == ~x;#res := 1; {12461#true} is VALID [2022-02-21 03:02:54,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {12461#true} ~x := #in~x; {12461#true} is VALID [2022-02-21 03:02:54,386 INFO L272 TraceCheckUtils]: 13: Hoare triple {12461#true} call #t~ret0 := g(~x - 1); {12461#true} is VALID [2022-02-21 03:02:54,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {12461#true} assume ~x - 1 >= -2147483648; {12461#true} is VALID [2022-02-21 03:02:54,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {12461#true} assume ~x - 1 <= 2147483647; {12461#true} is VALID [2022-02-21 03:02:54,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {12461#true} assume !(0 == ~x); {12461#true} is VALID [2022-02-21 03:02:54,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {12461#true} ~x := #in~x; {12461#true} is VALID [2022-02-21 03:02:54,386 INFO L272 TraceCheckUtils]: 8: Hoare triple {12461#true} call #t~ret0 := g(~x - 1); {12461#true} is VALID [2022-02-21 03:02:54,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {12461#true} assume ~x - 1 >= -2147483648; {12461#true} is VALID [2022-02-21 03:02:54,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {12461#true} assume ~x - 1 <= 2147483647; {12461#true} is VALID [2022-02-21 03:02:54,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {12461#true} assume !(0 == ~x); {12461#true} is VALID [2022-02-21 03:02:54,387 INFO L290 TraceCheckUtils]: 4: Hoare triple {12461#true} ~x := #in~x; {12461#true} is VALID [2022-02-21 03:02:54,387 INFO L272 TraceCheckUtils]: 3: Hoare triple {12461#true} call main_#t~ret3#1 := g(main_~x~0#1); {12461#true} is VALID [2022-02-21 03:02:54,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {12461#true} assume !(main_~x~0#1 < 0); {12461#true} is VALID [2022-02-21 03:02:54,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {12461#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {12461#true} is VALID [2022-02-21 03:02:54,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {12461#true} assume { :begin_inline_ULTIMATE.init } true; {12461#true} is VALID [2022-02-21 03:02:54,387 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-02-21 03:02:54,387 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005667648] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:02:54,387 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:02:54,387 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2022-02-21 03:02:54,388 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355685853] [2022-02-21 03:02:54,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:02:54,388 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 10 states have internal predecessors, (40), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2022-02-21 03:02:54,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:54,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 10 states have internal predecessors, (40), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-21 03:02:54,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:54,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-21 03:02:54,417 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:54,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-21 03:02:54,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-02-21 03:02:54,418 INFO L87 Difference]: Start difference. First operand 428 states and 503 transitions. Second operand has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 10 states have internal predecessors, (40), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-21 03:02:55,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:55,365 INFO L93 Difference]: Finished difference Result 483 states and 569 transitions. [2022-02-21 03:02:55,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-21 03:02:55,365 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 10 states have internal predecessors, (40), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2022-02-21 03:02:55,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:55,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 10 states have internal predecessors, (40), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-21 03:02:55,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 87 transitions. [2022-02-21 03:02:55,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 10 states have internal predecessors, (40), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-21 03:02:55,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 87 transitions. [2022-02-21 03:02:55,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 87 transitions. [2022-02-21 03:02:55,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:55,442 INFO L225 Difference]: With dead ends: 483 [2022-02-21 03:02:55,443 INFO L226 Difference]: Without dead ends: 482 [2022-02-21 03:02:55,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=350, Invalid=1132, Unknown=0, NotChecked=0, Total=1482 [2022-02-21 03:02:55,444 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 90 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:55,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 111 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:02:55,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-02-21 03:02:55,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2022-02-21 03:02:55,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:55,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 482 states. Second operand has 482 states, 349 states have (on average 1.0830945558739256) internal successors, (378), 374 states have internal predecessors, (378), 82 states have call successors, (82), 27 states have call predecessors, (82), 50 states have return successors, (106), 80 states have call predecessors, (106), 79 states have call successors, (106) [2022-02-21 03:02:55,696 INFO L74 IsIncluded]: Start isIncluded. First operand 482 states. Second operand has 482 states, 349 states have (on average 1.0830945558739256) internal successors, (378), 374 states have internal predecessors, (378), 82 states have call successors, (82), 27 states have call predecessors, (82), 50 states have return successors, (106), 80 states have call predecessors, (106), 79 states have call successors, (106) [2022-02-21 03:02:55,696 INFO L87 Difference]: Start difference. First operand 482 states. Second operand has 482 states, 349 states have (on average 1.0830945558739256) internal successors, (378), 374 states have internal predecessors, (378), 82 states have call successors, (82), 27 states have call predecessors, (82), 50 states have return successors, (106), 80 states have call predecessors, (106), 79 states have call successors, (106) [2022-02-21 03:02:55,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:55,709 INFO L93 Difference]: Finished difference Result 482 states and 566 transitions. [2022-02-21 03:02:55,709 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 566 transitions. [2022-02-21 03:02:55,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:55,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:55,711 INFO L74 IsIncluded]: Start isIncluded. First operand has 482 states, 349 states have (on average 1.0830945558739256) internal successors, (378), 374 states have internal predecessors, (378), 82 states have call successors, (82), 27 states have call predecessors, (82), 50 states have return successors, (106), 80 states have call predecessors, (106), 79 states have call successors, (106) Second operand 482 states. [2022-02-21 03:02:55,712 INFO L87 Difference]: Start difference. First operand has 482 states, 349 states have (on average 1.0830945558739256) internal successors, (378), 374 states have internal predecessors, (378), 82 states have call successors, (82), 27 states have call predecessors, (82), 50 states have return successors, (106), 80 states have call predecessors, (106), 79 states have call successors, (106) Second operand 482 states. [2022-02-21 03:02:55,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:55,724 INFO L93 Difference]: Finished difference Result 482 states and 566 transitions. [2022-02-21 03:02:55,724 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 566 transitions. [2022-02-21 03:02:55,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:55,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:55,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:55,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:55,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 349 states have (on average 1.0830945558739256) internal successors, (378), 374 states have internal predecessors, (378), 82 states have call successors, (82), 27 states have call predecessors, (82), 50 states have return successors, (106), 80 states have call predecessors, (106), 79 states have call successors, (106) [2022-02-21 03:02:55,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 566 transitions. [2022-02-21 03:02:55,739 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 566 transitions. Word has length 42 [2022-02-21 03:02:55,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:55,739 INFO L470 AbstractCegarLoop]: Abstraction has 482 states and 566 transitions. [2022-02-21 03:02:55,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 10 states have internal predecessors, (40), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-21 03:02:55,740 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 566 transitions. [2022-02-21 03:02:55,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-21 03:02:55,741 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:55,742 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1, 1, 1] [2022-02-21 03:02:55,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:02:55,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-02-21 03:02:55,963 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:02:55,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:55,963 INFO L85 PathProgramCache]: Analyzing trace with hash 235894418, now seen corresponding path program 3 times [2022-02-21 03:02:55,963 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:55,963 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751278065] [2022-02-21 03:02:55,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:55,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:56,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {14951#true} assume { :begin_inline_ULTIMATE.init } true; {14951#true} is VALID [2022-02-21 03:02:56,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {14951#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {14951#true} is VALID [2022-02-21 03:02:56,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {14951#true} assume !(main_~x~0#1 < 0); {14953#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:02:56,190 INFO L272 TraceCheckUtils]: 3: Hoare triple {14953#(<= 0 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret3#1 := g(main_~x~0#1); {14954#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:02:56,191 INFO L290 TraceCheckUtils]: 4: Hoare triple {14954#(<= 0 |g_#in~x|)} ~x := #in~x; {14955#(<= 0 g_~x)} is VALID [2022-02-21 03:02:56,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {14955#(<= 0 g_~x)} assume !(0 == ~x); {14955#(<= 0 g_~x)} is VALID [2022-02-21 03:02:56,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {14955#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {14955#(<= 0 g_~x)} is VALID [2022-02-21 03:02:56,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {14955#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {14955#(<= 0 g_~x)} is VALID [2022-02-21 03:02:56,192 INFO L272 TraceCheckUtils]: 8: Hoare triple {14955#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {14956#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:02:56,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {14956#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {14957#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:56,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {14957#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {14957#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:56,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {14957#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {14957#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:56,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {14957#(<= 0 (+ g_~x 1))} assume ~x - 1 >= -2147483648; {14957#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:56,194 INFO L272 TraceCheckUtils]: 13: Hoare triple {14957#(<= 0 (+ g_~x 1))} call #t~ret0 := g(~x - 1); {14958#(<= 0 (+ |g_#in~x| 2))} is VALID [2022-02-21 03:02:56,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {14958#(<= 0 (+ |g_#in~x| 2))} ~x := #in~x; {14959#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:56,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {14959#(<= 0 (+ 2 g_~x))} assume !(0 == ~x); {14959#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:56,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {14959#(<= 0 (+ 2 g_~x))} assume ~x - 1 <= 2147483647; {14959#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:56,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {14959#(<= 0 (+ 2 g_~x))} assume ~x - 1 >= -2147483648; {14959#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:56,196 INFO L272 TraceCheckUtils]: 18: Hoare triple {14959#(<= 0 (+ 2 g_~x))} call #t~ret0 := g(~x - 1); {14960#(<= 0 (+ |g_#in~x| 3))} is VALID [2022-02-21 03:02:56,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {14960#(<= 0 (+ |g_#in~x| 3))} ~x := #in~x; {14961#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:56,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {14961#(<= 0 (+ 3 g_~x))} assume !(0 == ~x); {14961#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:56,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {14961#(<= 0 (+ 3 g_~x))} assume ~x - 1 <= 2147483647; {14961#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:56,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {14961#(<= 0 (+ 3 g_~x))} assume ~x - 1 >= -2147483648; {14961#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:56,198 INFO L272 TraceCheckUtils]: 23: Hoare triple {14961#(<= 0 (+ 3 g_~x))} call #t~ret0 := g(~x - 1); {14962#(<= 0 (+ |g_#in~x| 4))} is VALID [2022-02-21 03:02:56,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {14962#(<= 0 (+ |g_#in~x| 4))} ~x := #in~x; {14963#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:56,198 INFO L290 TraceCheckUtils]: 25: Hoare triple {14963#(<= 0 (+ g_~x 4))} assume !(0 == ~x); {14963#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:56,199 INFO L290 TraceCheckUtils]: 26: Hoare triple {14963#(<= 0 (+ g_~x 4))} assume ~x - 1 <= 2147483647; {14963#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:56,199 INFO L290 TraceCheckUtils]: 27: Hoare triple {14963#(<= 0 (+ g_~x 4))} assume ~x - 1 >= -2147483648; {14963#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:56,200 INFO L272 TraceCheckUtils]: 28: Hoare triple {14963#(<= 0 (+ g_~x 4))} call #t~ret0 := g(~x - 1); {14964#(<= 0 (+ 5 |g_#in~x|))} is VALID [2022-02-21 03:02:56,200 INFO L290 TraceCheckUtils]: 29: Hoare triple {14964#(<= 0 (+ 5 |g_#in~x|))} ~x := #in~x; {14965#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:02:56,201 INFO L290 TraceCheckUtils]: 30: Hoare triple {14965#(<= 0 (+ 5 g_~x))} assume !(0 == ~x); {14965#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:02:56,201 INFO L290 TraceCheckUtils]: 31: Hoare triple {14965#(<= 0 (+ 5 g_~x))} assume ~x - 1 <= 2147483647; {14965#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:02:56,201 INFO L290 TraceCheckUtils]: 32: Hoare triple {14965#(<= 0 (+ 5 g_~x))} assume ~x - 1 >= -2147483648; {14965#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:02:56,202 INFO L272 TraceCheckUtils]: 33: Hoare triple {14965#(<= 0 (+ 5 g_~x))} call #t~ret0 := g(~x - 1); {14966#(<= 0 (+ |g_#in~x| 6))} is VALID [2022-02-21 03:02:56,202 INFO L290 TraceCheckUtils]: 34: Hoare triple {14966#(<= 0 (+ |g_#in~x| 6))} ~x := #in~x; {14967#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:02:56,202 INFO L290 TraceCheckUtils]: 35: Hoare triple {14967#(<= 0 (+ 6 g_~x))} assume !(0 == ~x); {14967#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:02:56,203 INFO L290 TraceCheckUtils]: 36: Hoare triple {14967#(<= 0 (+ 6 g_~x))} assume ~x - 1 <= 2147483647; {14967#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:02:56,203 INFO L290 TraceCheckUtils]: 37: Hoare triple {14967#(<= 0 (+ 6 g_~x))} assume ~x - 1 >= -2147483648; {14967#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:02:56,204 INFO L272 TraceCheckUtils]: 38: Hoare triple {14967#(<= 0 (+ 6 g_~x))} call #t~ret0 := g(~x - 1); {14968#(<= 0 (+ 7 |g_#in~x|))} is VALID [2022-02-21 03:02:56,204 INFO L290 TraceCheckUtils]: 39: Hoare triple {14968#(<= 0 (+ 7 |g_#in~x|))} ~x := #in~x; {14969#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:02:56,204 INFO L290 TraceCheckUtils]: 40: Hoare triple {14969#(<= 0 (+ 7 g_~x))} assume !(0 == ~x); {14969#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:02:56,205 INFO L290 TraceCheckUtils]: 41: Hoare triple {14969#(<= 0 (+ 7 g_~x))} assume ~x - 1 <= 2147483647; {14969#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:02:56,205 INFO L290 TraceCheckUtils]: 42: Hoare triple {14969#(<= 0 (+ 7 g_~x))} assume ~x - 1 >= -2147483648; {14969#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:02:56,206 INFO L272 TraceCheckUtils]: 43: Hoare triple {14969#(<= 0 (+ 7 g_~x))} call #t~ret0 := g(~x - 1); {14970#(<= 0 (+ |g_#in~x| 8))} is VALID [2022-02-21 03:02:56,206 INFO L290 TraceCheckUtils]: 44: Hoare triple {14970#(<= 0 (+ |g_#in~x| 8))} ~x := #in~x; {14971#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:02:56,206 INFO L290 TraceCheckUtils]: 45: Hoare triple {14971#(<= 0 (+ g_~x 8))} assume !(0 == ~x); {14971#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:02:56,206 INFO L290 TraceCheckUtils]: 46: Hoare triple {14971#(<= 0 (+ g_~x 8))} assume ~x - 1 <= 2147483647; {14971#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:02:56,207 INFO L290 TraceCheckUtils]: 47: Hoare triple {14971#(<= 0 (+ g_~x 8))} assume ~x - 1 >= -2147483648; {14971#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:02:56,207 INFO L272 TraceCheckUtils]: 48: Hoare triple {14971#(<= 0 (+ g_~x 8))} call #t~ret0 := g(~x - 1); {14972#(<= 0 (+ |g_#in~x| 9))} is VALID [2022-02-21 03:02:56,208 INFO L290 TraceCheckUtils]: 49: Hoare triple {14972#(<= 0 (+ |g_#in~x| 9))} ~x := #in~x; {14973#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:02:56,208 INFO L290 TraceCheckUtils]: 50: Hoare triple {14973#(<= 0 (+ 9 g_~x))} assume !(0 == ~x); {14973#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:02:56,208 INFO L290 TraceCheckUtils]: 51: Hoare triple {14973#(<= 0 (+ 9 g_~x))} assume ~x - 1 <= 2147483647; {14973#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:02:56,209 INFO L290 TraceCheckUtils]: 52: Hoare triple {14973#(<= 0 (+ 9 g_~x))} assume ~x - 1 >= -2147483648; {14973#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:02:56,209 INFO L272 TraceCheckUtils]: 53: Hoare triple {14973#(<= 0 (+ 9 g_~x))} call #t~ret0 := g(~x - 1); {14974#(<= 0 (+ |g_#in~x| 10))} is VALID [2022-02-21 03:02:56,210 INFO L290 TraceCheckUtils]: 54: Hoare triple {14974#(<= 0 (+ |g_#in~x| 10))} ~x := #in~x; {14975#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:02:56,210 INFO L290 TraceCheckUtils]: 55: Hoare triple {14975#(<= 0 (+ g_~x 10))} assume !(0 == ~x); {14975#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:02:56,210 INFO L290 TraceCheckUtils]: 56: Hoare triple {14975#(<= 0 (+ g_~x 10))} assume ~x - 1 <= 2147483647; {14975#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:02:56,211 INFO L290 TraceCheckUtils]: 57: Hoare triple {14975#(<= 0 (+ g_~x 10))} assume !(~x - 1 >= -2147483648); {14952#false} is VALID [2022-02-21 03:02:56,211 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:56,211 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:56,211 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751278065] [2022-02-21 03:02:56,212 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751278065] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:02:56,212 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021749474] [2022-02-21 03:02:56,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:02:56,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:56,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:56,213 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:02:56,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-21 03:02:56,246 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-21 03:02:56,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:02:56,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-21 03:02:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:56,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:02:56,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {14951#true} assume { :begin_inline_ULTIMATE.init } true; {14951#true} is VALID [2022-02-21 03:02:56,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {14951#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {14951#true} is VALID [2022-02-21 03:02:56,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {14951#true} assume !(main_~x~0#1 < 0); {14953#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:02:56,578 INFO L272 TraceCheckUtils]: 3: Hoare triple {14953#(<= 0 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret3#1 := g(main_~x~0#1); {14954#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:02:56,579 INFO L290 TraceCheckUtils]: 4: Hoare triple {14954#(<= 0 |g_#in~x|)} ~x := #in~x; {14955#(<= 0 g_~x)} is VALID [2022-02-21 03:02:56,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {14955#(<= 0 g_~x)} assume !(0 == ~x); {14955#(<= 0 g_~x)} is VALID [2022-02-21 03:02:56,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {14955#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {14955#(<= 0 g_~x)} is VALID [2022-02-21 03:02:56,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {14955#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {14955#(<= 0 g_~x)} is VALID [2022-02-21 03:02:56,580 INFO L272 TraceCheckUtils]: 8: Hoare triple {14955#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {14956#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:02:56,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {14956#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {14957#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:56,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {14957#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {14957#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:56,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {14957#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {14957#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:56,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {14957#(<= 0 (+ g_~x 1))} assume ~x - 1 >= -2147483648; {14957#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:56,582 INFO L272 TraceCheckUtils]: 13: Hoare triple {14957#(<= 0 (+ g_~x 1))} call #t~ret0 := g(~x - 1); {14958#(<= 0 (+ |g_#in~x| 2))} is VALID [2022-02-21 03:02:56,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {14958#(<= 0 (+ |g_#in~x| 2))} ~x := #in~x; {14959#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:56,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {14959#(<= 0 (+ 2 g_~x))} assume !(0 == ~x); {14959#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:56,582 INFO L290 TraceCheckUtils]: 16: Hoare triple {14959#(<= 0 (+ 2 g_~x))} assume ~x - 1 <= 2147483647; {14959#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:56,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {14959#(<= 0 (+ 2 g_~x))} assume ~x - 1 >= -2147483648; {14959#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:56,583 INFO L272 TraceCheckUtils]: 18: Hoare triple {14959#(<= 0 (+ 2 g_~x))} call #t~ret0 := g(~x - 1); {14960#(<= 0 (+ |g_#in~x| 3))} is VALID [2022-02-21 03:02:56,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {14960#(<= 0 (+ |g_#in~x| 3))} ~x := #in~x; {14961#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:56,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {14961#(<= 0 (+ 3 g_~x))} assume !(0 == ~x); {14961#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:56,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {14961#(<= 0 (+ 3 g_~x))} assume ~x - 1 <= 2147483647; {14961#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:56,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {14961#(<= 0 (+ 3 g_~x))} assume ~x - 1 >= -2147483648; {14961#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:56,585 INFO L272 TraceCheckUtils]: 23: Hoare triple {14961#(<= 0 (+ 3 g_~x))} call #t~ret0 := g(~x - 1); {14962#(<= 0 (+ |g_#in~x| 4))} is VALID [2022-02-21 03:02:56,591 INFO L290 TraceCheckUtils]: 24: Hoare triple {14962#(<= 0 (+ |g_#in~x| 4))} ~x := #in~x; {14963#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:56,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {14963#(<= 0 (+ g_~x 4))} assume !(0 == ~x); {14963#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:56,592 INFO L290 TraceCheckUtils]: 26: Hoare triple {14963#(<= 0 (+ g_~x 4))} assume ~x - 1 <= 2147483647; {14963#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:56,592 INFO L290 TraceCheckUtils]: 27: Hoare triple {14963#(<= 0 (+ g_~x 4))} assume ~x - 1 >= -2147483648; {14963#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:56,593 INFO L272 TraceCheckUtils]: 28: Hoare triple {14963#(<= 0 (+ g_~x 4))} call #t~ret0 := g(~x - 1); {14964#(<= 0 (+ 5 |g_#in~x|))} is VALID [2022-02-21 03:02:56,594 INFO L290 TraceCheckUtils]: 29: Hoare triple {14964#(<= 0 (+ 5 |g_#in~x|))} ~x := #in~x; {14965#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:02:56,594 INFO L290 TraceCheckUtils]: 30: Hoare triple {14965#(<= 0 (+ 5 g_~x))} assume !(0 == ~x); {14965#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:02:56,594 INFO L290 TraceCheckUtils]: 31: Hoare triple {14965#(<= 0 (+ 5 g_~x))} assume ~x - 1 <= 2147483647; {14965#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:02:56,595 INFO L290 TraceCheckUtils]: 32: Hoare triple {14965#(<= 0 (+ 5 g_~x))} assume ~x - 1 >= -2147483648; {14965#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:02:56,595 INFO L272 TraceCheckUtils]: 33: Hoare triple {14965#(<= 0 (+ 5 g_~x))} call #t~ret0 := g(~x - 1); {14966#(<= 0 (+ |g_#in~x| 6))} is VALID [2022-02-21 03:02:56,596 INFO L290 TraceCheckUtils]: 34: Hoare triple {14966#(<= 0 (+ |g_#in~x| 6))} ~x := #in~x; {14967#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:02:56,596 INFO L290 TraceCheckUtils]: 35: Hoare triple {14967#(<= 0 (+ 6 g_~x))} assume !(0 == ~x); {14967#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:02:56,596 INFO L290 TraceCheckUtils]: 36: Hoare triple {14967#(<= 0 (+ 6 g_~x))} assume ~x - 1 <= 2147483647; {14967#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:02:56,597 INFO L290 TraceCheckUtils]: 37: Hoare triple {14967#(<= 0 (+ 6 g_~x))} assume ~x - 1 >= -2147483648; {14967#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:02:56,597 INFO L272 TraceCheckUtils]: 38: Hoare triple {14967#(<= 0 (+ 6 g_~x))} call #t~ret0 := g(~x - 1); {14968#(<= 0 (+ 7 |g_#in~x|))} is VALID [2022-02-21 03:02:56,598 INFO L290 TraceCheckUtils]: 39: Hoare triple {14968#(<= 0 (+ 7 |g_#in~x|))} ~x := #in~x; {14969#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:02:56,598 INFO L290 TraceCheckUtils]: 40: Hoare triple {14969#(<= 0 (+ 7 g_~x))} assume !(0 == ~x); {14969#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:02:56,598 INFO L290 TraceCheckUtils]: 41: Hoare triple {14969#(<= 0 (+ 7 g_~x))} assume ~x - 1 <= 2147483647; {14969#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:02:56,599 INFO L290 TraceCheckUtils]: 42: Hoare triple {14969#(<= 0 (+ 7 g_~x))} assume ~x - 1 >= -2147483648; {14969#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:02:56,599 INFO L272 TraceCheckUtils]: 43: Hoare triple {14969#(<= 0 (+ 7 g_~x))} call #t~ret0 := g(~x - 1); {14970#(<= 0 (+ |g_#in~x| 8))} is VALID [2022-02-21 03:02:56,600 INFO L290 TraceCheckUtils]: 44: Hoare triple {14970#(<= 0 (+ |g_#in~x| 8))} ~x := #in~x; {14971#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:02:56,600 INFO L290 TraceCheckUtils]: 45: Hoare triple {14971#(<= 0 (+ g_~x 8))} assume !(0 == ~x); {14971#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:02:56,600 INFO L290 TraceCheckUtils]: 46: Hoare triple {14971#(<= 0 (+ g_~x 8))} assume ~x - 1 <= 2147483647; {14971#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:02:56,601 INFO L290 TraceCheckUtils]: 47: Hoare triple {14971#(<= 0 (+ g_~x 8))} assume ~x - 1 >= -2147483648; {14971#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:02:56,601 INFO L272 TraceCheckUtils]: 48: Hoare triple {14971#(<= 0 (+ g_~x 8))} call #t~ret0 := g(~x - 1); {14972#(<= 0 (+ |g_#in~x| 9))} is VALID [2022-02-21 03:02:56,602 INFO L290 TraceCheckUtils]: 49: Hoare triple {14972#(<= 0 (+ |g_#in~x| 9))} ~x := #in~x; {14973#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:02:56,602 INFO L290 TraceCheckUtils]: 50: Hoare triple {14973#(<= 0 (+ 9 g_~x))} assume !(0 == ~x); {14973#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:02:56,602 INFO L290 TraceCheckUtils]: 51: Hoare triple {14973#(<= 0 (+ 9 g_~x))} assume ~x - 1 <= 2147483647; {14973#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:02:56,603 INFO L290 TraceCheckUtils]: 52: Hoare triple {14973#(<= 0 (+ 9 g_~x))} assume ~x - 1 >= -2147483648; {14973#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:02:56,603 INFO L272 TraceCheckUtils]: 53: Hoare triple {14973#(<= 0 (+ 9 g_~x))} call #t~ret0 := g(~x - 1); {14974#(<= 0 (+ |g_#in~x| 10))} is VALID [2022-02-21 03:02:56,604 INFO L290 TraceCheckUtils]: 54: Hoare triple {14974#(<= 0 (+ |g_#in~x| 10))} ~x := #in~x; {14975#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:02:56,604 INFO L290 TraceCheckUtils]: 55: Hoare triple {14975#(<= 0 (+ g_~x 10))} assume !(0 == ~x); {14975#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:02:56,604 INFO L290 TraceCheckUtils]: 56: Hoare triple {14975#(<= 0 (+ g_~x 10))} assume ~x - 1 <= 2147483647; {14975#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:02:56,605 INFO L290 TraceCheckUtils]: 57: Hoare triple {14975#(<= 0 (+ g_~x 10))} assume !(~x - 1 >= -2147483648); {14952#false} is VALID [2022-02-21 03:02:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:56,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:02:57,314 INFO L290 TraceCheckUtils]: 57: Hoare triple {15150#(<= 0 (+ 2147483647 g_~x))} assume !(~x - 1 >= -2147483648); {14952#false} is VALID [2022-02-21 03:02:57,315 INFO L290 TraceCheckUtils]: 56: Hoare triple {15150#(<= 0 (+ 2147483647 g_~x))} assume ~x - 1 <= 2147483647; {15150#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:57,315 INFO L290 TraceCheckUtils]: 55: Hoare triple {15150#(<= 0 (+ 2147483647 g_~x))} assume !(0 == ~x); {15150#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:57,315 INFO L290 TraceCheckUtils]: 54: Hoare triple {15160#(<= 0 (+ 2147483647 |g_#in~x|))} ~x := #in~x; {15150#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:57,316 INFO L272 TraceCheckUtils]: 53: Hoare triple {15164#(<= 0 (+ g_~x 2147483646))} call #t~ret0 := g(~x - 1); {15160#(<= 0 (+ 2147483647 |g_#in~x|))} is VALID [2022-02-21 03:02:57,316 INFO L290 TraceCheckUtils]: 52: Hoare triple {15164#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 >= -2147483648; {15164#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:57,316 INFO L290 TraceCheckUtils]: 51: Hoare triple {15164#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 <= 2147483647; {15164#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:57,317 INFO L290 TraceCheckUtils]: 50: Hoare triple {15164#(<= 0 (+ g_~x 2147483646))} assume !(0 == ~x); {15164#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:57,317 INFO L290 TraceCheckUtils]: 49: Hoare triple {15177#(<= 0 (+ |g_#in~x| 2147483646))} ~x := #in~x; {15164#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:57,317 INFO L272 TraceCheckUtils]: 48: Hoare triple {15181#(<= 0 (+ 2147483645 g_~x))} call #t~ret0 := g(~x - 1); {15177#(<= 0 (+ |g_#in~x| 2147483646))} is VALID [2022-02-21 03:02:57,318 INFO L290 TraceCheckUtils]: 47: Hoare triple {15181#(<= 0 (+ 2147483645 g_~x))} assume ~x - 1 >= -2147483648; {15181#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:02:57,318 INFO L290 TraceCheckUtils]: 46: Hoare triple {15181#(<= 0 (+ 2147483645 g_~x))} assume ~x - 1 <= 2147483647; {15181#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:02:57,318 INFO L290 TraceCheckUtils]: 45: Hoare triple {15181#(<= 0 (+ 2147483645 g_~x))} assume !(0 == ~x); {15181#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:02:57,319 INFO L290 TraceCheckUtils]: 44: Hoare triple {15194#(<= 0 (+ 2147483645 |g_#in~x|))} ~x := #in~x; {15181#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:02:57,319 INFO L272 TraceCheckUtils]: 43: Hoare triple {15198#(<= 0 (+ g_~x 2147483644))} call #t~ret0 := g(~x - 1); {15194#(<= 0 (+ 2147483645 |g_#in~x|))} is VALID [2022-02-21 03:02:57,319 INFO L290 TraceCheckUtils]: 42: Hoare triple {15198#(<= 0 (+ g_~x 2147483644))} assume ~x - 1 >= -2147483648; {15198#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:02:57,320 INFO L290 TraceCheckUtils]: 41: Hoare triple {15198#(<= 0 (+ g_~x 2147483644))} assume ~x - 1 <= 2147483647; {15198#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:02:57,320 INFO L290 TraceCheckUtils]: 40: Hoare triple {15198#(<= 0 (+ g_~x 2147483644))} assume !(0 == ~x); {15198#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:02:57,320 INFO L290 TraceCheckUtils]: 39: Hoare triple {15211#(<= 0 (+ |g_#in~x| 2147483644))} ~x := #in~x; {15198#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:02:57,321 INFO L272 TraceCheckUtils]: 38: Hoare triple {15215#(<= 0 (+ 2147483643 g_~x))} call #t~ret0 := g(~x - 1); {15211#(<= 0 (+ |g_#in~x| 2147483644))} is VALID [2022-02-21 03:02:57,321 INFO L290 TraceCheckUtils]: 37: Hoare triple {15215#(<= 0 (+ 2147483643 g_~x))} assume ~x - 1 >= -2147483648; {15215#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:02:57,321 INFO L290 TraceCheckUtils]: 36: Hoare triple {15215#(<= 0 (+ 2147483643 g_~x))} assume ~x - 1 <= 2147483647; {15215#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:02:57,321 INFO L290 TraceCheckUtils]: 35: Hoare triple {15215#(<= 0 (+ 2147483643 g_~x))} assume !(0 == ~x); {15215#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:02:57,322 INFO L290 TraceCheckUtils]: 34: Hoare triple {15228#(<= 0 (+ 2147483643 |g_#in~x|))} ~x := #in~x; {15215#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:02:57,322 INFO L272 TraceCheckUtils]: 33: Hoare triple {15232#(<= 0 (+ g_~x 2147483642))} call #t~ret0 := g(~x - 1); {15228#(<= 0 (+ 2147483643 |g_#in~x|))} is VALID [2022-02-21 03:02:57,323 INFO L290 TraceCheckUtils]: 32: Hoare triple {15232#(<= 0 (+ g_~x 2147483642))} assume ~x - 1 >= -2147483648; {15232#(<= 0 (+ g_~x 2147483642))} is VALID [2022-02-21 03:02:57,323 INFO L290 TraceCheckUtils]: 31: Hoare triple {15232#(<= 0 (+ g_~x 2147483642))} assume ~x - 1 <= 2147483647; {15232#(<= 0 (+ g_~x 2147483642))} is VALID [2022-02-21 03:02:57,323 INFO L290 TraceCheckUtils]: 30: Hoare triple {15232#(<= 0 (+ g_~x 2147483642))} assume !(0 == ~x); {15232#(<= 0 (+ g_~x 2147483642))} is VALID [2022-02-21 03:02:57,323 INFO L290 TraceCheckUtils]: 29: Hoare triple {15245#(<= 0 (+ |g_#in~x| 2147483642))} ~x := #in~x; {15232#(<= 0 (+ g_~x 2147483642))} is VALID [2022-02-21 03:02:57,324 INFO L272 TraceCheckUtils]: 28: Hoare triple {15249#(<= 0 (+ g_~x 2147483641))} call #t~ret0 := g(~x - 1); {15245#(<= 0 (+ |g_#in~x| 2147483642))} is VALID [2022-02-21 03:02:57,324 INFO L290 TraceCheckUtils]: 27: Hoare triple {15249#(<= 0 (+ g_~x 2147483641))} assume ~x - 1 >= -2147483648; {15249#(<= 0 (+ g_~x 2147483641))} is VALID [2022-02-21 03:02:57,324 INFO L290 TraceCheckUtils]: 26: Hoare triple {15249#(<= 0 (+ g_~x 2147483641))} assume ~x - 1 <= 2147483647; {15249#(<= 0 (+ g_~x 2147483641))} is VALID [2022-02-21 03:02:57,325 INFO L290 TraceCheckUtils]: 25: Hoare triple {15249#(<= 0 (+ g_~x 2147483641))} assume !(0 == ~x); {15249#(<= 0 (+ g_~x 2147483641))} is VALID [2022-02-21 03:02:57,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {15262#(<= 0 (+ |g_#in~x| 2147483641))} ~x := #in~x; {15249#(<= 0 (+ g_~x 2147483641))} is VALID [2022-02-21 03:02:57,325 INFO L272 TraceCheckUtils]: 23: Hoare triple {15266#(<= 0 (+ g_~x 2147483640))} call #t~ret0 := g(~x - 1); {15262#(<= 0 (+ |g_#in~x| 2147483641))} is VALID [2022-02-21 03:02:57,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {15266#(<= 0 (+ g_~x 2147483640))} assume ~x - 1 >= -2147483648; {15266#(<= 0 (+ g_~x 2147483640))} is VALID [2022-02-21 03:02:57,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {15266#(<= 0 (+ g_~x 2147483640))} assume ~x - 1 <= 2147483647; {15266#(<= 0 (+ g_~x 2147483640))} is VALID [2022-02-21 03:02:57,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {15266#(<= 0 (+ g_~x 2147483640))} assume !(0 == ~x); {15266#(<= 0 (+ g_~x 2147483640))} is VALID [2022-02-21 03:02:57,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {15279#(<= 0 (+ |g_#in~x| 2147483640))} ~x := #in~x; {15266#(<= 0 (+ g_~x 2147483640))} is VALID [2022-02-21 03:02:57,327 INFO L272 TraceCheckUtils]: 18: Hoare triple {15283#(<= 0 (+ g_~x 2147483639))} call #t~ret0 := g(~x - 1); {15279#(<= 0 (+ |g_#in~x| 2147483640))} is VALID [2022-02-21 03:02:57,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {15283#(<= 0 (+ g_~x 2147483639))} assume ~x - 1 >= -2147483648; {15283#(<= 0 (+ g_~x 2147483639))} is VALID [2022-02-21 03:02:57,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {15283#(<= 0 (+ g_~x 2147483639))} assume ~x - 1 <= 2147483647; {15283#(<= 0 (+ g_~x 2147483639))} is VALID [2022-02-21 03:02:57,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {15283#(<= 0 (+ g_~x 2147483639))} assume !(0 == ~x); {15283#(<= 0 (+ g_~x 2147483639))} is VALID [2022-02-21 03:02:57,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {15296#(<= 0 (+ |g_#in~x| 2147483639))} ~x := #in~x; {15283#(<= 0 (+ g_~x 2147483639))} is VALID [2022-02-21 03:02:57,329 INFO L272 TraceCheckUtils]: 13: Hoare triple {15300#(<= 0 (+ 2147483638 g_~x))} call #t~ret0 := g(~x - 1); {15296#(<= 0 (+ |g_#in~x| 2147483639))} is VALID [2022-02-21 03:02:57,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {15300#(<= 0 (+ 2147483638 g_~x))} assume ~x - 1 >= -2147483648; {15300#(<= 0 (+ 2147483638 g_~x))} is VALID [2022-02-21 03:02:57,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {15300#(<= 0 (+ 2147483638 g_~x))} assume ~x - 1 <= 2147483647; {15300#(<= 0 (+ 2147483638 g_~x))} is VALID [2022-02-21 03:02:57,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {15300#(<= 0 (+ 2147483638 g_~x))} assume !(0 == ~x); {15300#(<= 0 (+ 2147483638 g_~x))} is VALID [2022-02-21 03:02:57,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {15313#(<= 0 (+ 2147483638 |g_#in~x|))} ~x := #in~x; {15300#(<= 0 (+ 2147483638 g_~x))} is VALID [2022-02-21 03:02:57,330 INFO L272 TraceCheckUtils]: 8: Hoare triple {15317#(<= 0 (+ g_~x 2147483637))} call #t~ret0 := g(~x - 1); {15313#(<= 0 (+ 2147483638 |g_#in~x|))} is VALID [2022-02-21 03:02:57,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {15317#(<= 0 (+ g_~x 2147483637))} assume ~x - 1 >= -2147483648; {15317#(<= 0 (+ g_~x 2147483637))} is VALID [2022-02-21 03:02:57,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {15317#(<= 0 (+ g_~x 2147483637))} assume ~x - 1 <= 2147483647; {15317#(<= 0 (+ g_~x 2147483637))} is VALID [2022-02-21 03:02:57,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {15317#(<= 0 (+ g_~x 2147483637))} assume !(0 == ~x); {15317#(<= 0 (+ g_~x 2147483637))} is VALID [2022-02-21 03:02:57,332 INFO L290 TraceCheckUtils]: 4: Hoare triple {15330#(<= 0 (+ |g_#in~x| 2147483637))} ~x := #in~x; {15317#(<= 0 (+ g_~x 2147483637))} is VALID [2022-02-21 03:02:57,332 INFO L272 TraceCheckUtils]: 3: Hoare triple {15334#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483637))} call main_#t~ret3#1 := g(main_~x~0#1); {15330#(<= 0 (+ |g_#in~x| 2147483637))} is VALID [2022-02-21 03:02:57,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {14951#true} assume !(main_~x~0#1 < 0); {15334#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483637))} is VALID [2022-02-21 03:02:57,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {14951#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {14951#true} is VALID [2022-02-21 03:02:57,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {14951#true} assume { :begin_inline_ULTIMATE.init } true; {14951#true} is VALID [2022-02-21 03:02:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:57,333 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021749474] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:02:57,333 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:02:57,333 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2022-02-21 03:02:57,333 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027357203] [2022-02-21 03:02:57,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:02:57,334 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 26 states have internal predecessors, (92), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-02-21 03:02:57,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:57,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 48 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 26 states have internal predecessors, (92), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:57,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:57,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-02-21 03:02:57,412 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:57,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-02-21 03:02:57,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2022-02-21 03:02:57,413 INFO L87 Difference]: Start difference. First operand 482 states and 566 transitions. Second operand has 48 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 26 states have internal predecessors, (92), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:00,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:00,642 INFO L93 Difference]: Finished difference Result 703 states and 908 transitions. [2022-02-21 03:03:00,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-02-21 03:03:00,643 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 26 states have internal predecessors, (92), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-02-21 03:03:00,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:00,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 26 states have internal predecessors, (92), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:00,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 402 transitions. [2022-02-21 03:03:00,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 26 states have internal predecessors, (92), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:00,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 402 transitions. [2022-02-21 03:03:00,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 402 transitions. [2022-02-21 03:03:00,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 402 edges. 402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:00,948 INFO L225 Difference]: With dead ends: 703 [2022-02-21 03:03:00,949 INFO L226 Difference]: Without dead ends: 702 [2022-02-21 03:03:00,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2534, Invalid=5656, Unknown=0, NotChecked=0, Total=8190 [2022-02-21 03:03:00,953 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 836 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 473 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 473 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:00,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [840 Valid, 426 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [473 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-21 03:03:00,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2022-02-21 03:03:01,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 698. [2022-02-21 03:03:01,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:01,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 702 states. Second operand has 698 states, 505 states have (on average 1.0811881188118813) internal successors, (546), 542 states have internal predecessors, (546), 118 states have call successors, (118), 39 states have call predecessors, (118), 74 states have return successors, (154), 116 states have call predecessors, (154), 115 states have call successors, (154) [2022-02-21 03:03:01,330 INFO L74 IsIncluded]: Start isIncluded. First operand 702 states. Second operand has 698 states, 505 states have (on average 1.0811881188118813) internal successors, (546), 542 states have internal predecessors, (546), 118 states have call successors, (118), 39 states have call predecessors, (118), 74 states have return successors, (154), 116 states have call predecessors, (154), 115 states have call successors, (154) [2022-02-21 03:03:01,331 INFO L87 Difference]: Start difference. First operand 702 states. Second operand has 698 states, 505 states have (on average 1.0811881188118813) internal successors, (546), 542 states have internal predecessors, (546), 118 states have call successors, (118), 39 states have call predecessors, (118), 74 states have return successors, (154), 116 states have call predecessors, (154), 115 states have call successors, (154) [2022-02-21 03:03:01,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:01,354 INFO L93 Difference]: Finished difference Result 702 states and 896 transitions. [2022-02-21 03:03:01,354 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 896 transitions. [2022-02-21 03:03:01,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:01,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:01,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 698 states, 505 states have (on average 1.0811881188118813) internal successors, (546), 542 states have internal predecessors, (546), 118 states have call successors, (118), 39 states have call predecessors, (118), 74 states have return successors, (154), 116 states have call predecessors, (154), 115 states have call successors, (154) Second operand 702 states. [2022-02-21 03:03:01,359 INFO L87 Difference]: Start difference. First operand has 698 states, 505 states have (on average 1.0811881188118813) internal successors, (546), 542 states have internal predecessors, (546), 118 states have call successors, (118), 39 states have call predecessors, (118), 74 states have return successors, (154), 116 states have call predecessors, (154), 115 states have call successors, (154) Second operand 702 states. [2022-02-21 03:03:01,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:01,381 INFO L93 Difference]: Finished difference Result 702 states and 896 transitions. [2022-02-21 03:03:01,381 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 896 transitions. [2022-02-21 03:03:01,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:01,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:01,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:01,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:01,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 505 states have (on average 1.0811881188118813) internal successors, (546), 542 states have internal predecessors, (546), 118 states have call successors, (118), 39 states have call predecessors, (118), 74 states have return successors, (154), 116 states have call predecessors, (154), 115 states have call successors, (154) [2022-02-21 03:03:01,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 818 transitions. [2022-02-21 03:03:01,406 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 818 transitions. Word has length 58 [2022-02-21 03:03:01,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:01,407 INFO L470 AbstractCegarLoop]: Abstraction has 698 states and 818 transitions. [2022-02-21 03:03:01,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 26 states have internal predecessors, (92), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:01,407 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 818 transitions. [2022-02-21 03:03:01,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-21 03:03:01,409 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:01,409 INFO L514 BasicCegarLoop]: trace histogram [9, 7, 7, 6, 6, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:01,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:03:01,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-02-21 03:03:01,623 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:03:01,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:01,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1212467695, now seen corresponding path program 3 times [2022-02-21 03:03:01,623 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:01,623 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933750025] [2022-02-21 03:03:01,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:01,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:01,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:03:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:01,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 03:03:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:01,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {18548#true} ~x := #in~x; {18548#true} is VALID [2022-02-21 03:03:01,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {18548#true} assume 0 == ~x;#res := 1; {18548#true} is VALID [2022-02-21 03:03:01,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {18548#true} assume true; {18548#true} is VALID [2022-02-21 03:03:01,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18548#true} {18548#true} #32#return; {18548#true} is VALID [2022-02-21 03:03:01,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:03:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:01,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {18548#true} ~x := #in~x; {18548#true} is VALID [2022-02-21 03:03:01,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {18548#true} assume 0 == ~x;#res := 1; {18590#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:01,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {18590#(<= 1 |g_#res|)} assume true; {18590#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:01,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18590#(<= 1 |g_#res|)} {18548#true} #34#return; {18589#(<= 1 |g_#t~ret1|)} is VALID [2022-02-21 03:03:01,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {18548#true} ~x := #in~x; {18548#true} is VALID [2022-02-21 03:03:01,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {18548#true} assume !(0 == ~x); {18548#true} is VALID [2022-02-21 03:03:01,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {18548#true} assume ~x - 1 <= 2147483647; {18548#true} is VALID [2022-02-21 03:03:01,775 INFO L290 TraceCheckUtils]: 3: Hoare triple {18548#true} assume ~x - 1 >= -2147483648; {18548#true} is VALID [2022-02-21 03:03:01,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {18548#true} call #t~ret0 := g(~x - 1); {18548#true} is VALID [2022-02-21 03:03:01,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {18548#true} ~x := #in~x; {18548#true} is VALID [2022-02-21 03:03:01,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {18548#true} assume 0 == ~x;#res := 1; {18548#true} is VALID [2022-02-21 03:03:01,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {18548#true} assume true; {18548#true} is VALID [2022-02-21 03:03:01,776 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {18548#true} {18548#true} #32#return; {18548#true} is VALID [2022-02-21 03:03:01,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {18548#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {18548#true} is VALID [2022-02-21 03:03:01,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {18548#true} assume #t~ret0 - 1 <= 2147483647; {18548#true} is VALID [2022-02-21 03:03:01,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {18548#true} assume #t~ret0 - 1 >= -2147483648; {18548#true} is VALID [2022-02-21 03:03:01,776 INFO L272 TraceCheckUtils]: 12: Hoare triple {18548#true} call #t~ret1 := g(#t~ret0 - 1); {18548#true} is VALID [2022-02-21 03:03:01,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {18548#true} ~x := #in~x; {18548#true} is VALID [2022-02-21 03:03:01,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {18548#true} assume 0 == ~x;#res := 1; {18590#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:01,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {18590#(<= 1 |g_#res|)} assume true; {18590#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:01,778 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {18590#(<= 1 |g_#res|)} {18548#true} #34#return; {18589#(<= 1 |g_#t~ret1|)} is VALID [2022-02-21 03:03:01,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {18589#(<= 1 |g_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret0;havoc #t~ret1; {18590#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:01,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {18590#(<= 1 |g_#res|)} assume true; {18590#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:01,779 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {18590#(<= 1 |g_#res|)} {18548#true} #32#return; {18570#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:03:01,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {18548#true} assume { :begin_inline_ULTIMATE.init } true; {18548#true} is VALID [2022-02-21 03:03:01,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {18548#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {18548#true} is VALID [2022-02-21 03:03:01,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {18548#true} assume !(main_~x~0#1 < 0); {18548#true} is VALID [2022-02-21 03:03:01,779 INFO L272 TraceCheckUtils]: 3: Hoare triple {18548#true} call main_#t~ret3#1 := g(main_~x~0#1); {18548#true} is VALID [2022-02-21 03:03:01,779 INFO L290 TraceCheckUtils]: 4: Hoare triple {18548#true} ~x := #in~x; {18548#true} is VALID [2022-02-21 03:03:01,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {18548#true} assume !(0 == ~x); {18548#true} is VALID [2022-02-21 03:03:01,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {18548#true} assume ~x - 1 <= 2147483647; {18548#true} is VALID [2022-02-21 03:03:01,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {18548#true} assume ~x - 1 >= -2147483648; {18548#true} is VALID [2022-02-21 03:03:01,780 INFO L272 TraceCheckUtils]: 8: Hoare triple {18548#true} call #t~ret0 := g(~x - 1); {18548#true} is VALID [2022-02-21 03:03:01,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {18548#true} ~x := #in~x; {18548#true} is VALID [2022-02-21 03:03:01,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {18548#true} assume !(0 == ~x); {18548#true} is VALID [2022-02-21 03:03:01,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {18548#true} assume ~x - 1 <= 2147483647; {18548#true} is VALID [2022-02-21 03:03:01,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {18548#true} assume ~x - 1 >= -2147483648; {18548#true} is VALID [2022-02-21 03:03:01,781 INFO L272 TraceCheckUtils]: 13: Hoare triple {18548#true} call #t~ret0 := g(~x - 1); {18548#true} is VALID [2022-02-21 03:03:01,781 INFO L290 TraceCheckUtils]: 14: Hoare triple {18548#true} ~x := #in~x; {18548#true} is VALID [2022-02-21 03:03:01,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {18548#true} assume 0 == ~x;#res := 1; {18548#true} is VALID [2022-02-21 03:03:01,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {18548#true} assume true; {18548#true} is VALID [2022-02-21 03:03:01,781 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18548#true} {18548#true} #32#return; {18548#true} is VALID [2022-02-21 03:03:01,781 INFO L290 TraceCheckUtils]: 18: Hoare triple {18548#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {18548#true} is VALID [2022-02-21 03:03:01,781 INFO L290 TraceCheckUtils]: 19: Hoare triple {18548#true} assume #t~ret0 - 1 <= 2147483647; {18548#true} is VALID [2022-02-21 03:03:01,781 INFO L290 TraceCheckUtils]: 20: Hoare triple {18548#true} assume #t~ret0 - 1 >= -2147483648; {18548#true} is VALID [2022-02-21 03:03:01,781 INFO L272 TraceCheckUtils]: 21: Hoare triple {18548#true} call #t~ret1 := g(#t~ret0 - 1); {18548#true} is VALID [2022-02-21 03:03:01,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {18548#true} ~x := #in~x; {18548#true} is VALID [2022-02-21 03:03:01,782 INFO L290 TraceCheckUtils]: 23: Hoare triple {18548#true} assume 0 == ~x;#res := 1; {18590#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:01,782 INFO L290 TraceCheckUtils]: 24: Hoare triple {18590#(<= 1 |g_#res|)} assume true; {18590#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:01,783 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {18590#(<= 1 |g_#res|)} {18548#true} #34#return; {18589#(<= 1 |g_#t~ret1|)} is VALID [2022-02-21 03:03:01,783 INFO L290 TraceCheckUtils]: 26: Hoare triple {18589#(<= 1 |g_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret0;havoc #t~ret1; {18590#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:01,783 INFO L290 TraceCheckUtils]: 27: Hoare triple {18590#(<= 1 |g_#res|)} assume true; {18590#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:01,784 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {18590#(<= 1 |g_#res|)} {18548#true} #32#return; {18570#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:03:01,784 INFO L290 TraceCheckUtils]: 29: Hoare triple {18570#(<= 1 |g_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {18570#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:03:01,784 INFO L290 TraceCheckUtils]: 30: Hoare triple {18570#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 <= 2147483647; {18570#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:03:01,785 INFO L290 TraceCheckUtils]: 31: Hoare triple {18570#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 >= -2147483648; {18570#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:03:01,785 INFO L272 TraceCheckUtils]: 32: Hoare triple {18570#(<= 1 |g_#t~ret0|)} call #t~ret1 := g(#t~ret0 - 1); {18571#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:03:01,786 INFO L290 TraceCheckUtils]: 33: Hoare triple {18571#(<= 0 |g_#in~x|)} ~x := #in~x; {18572#(<= 0 g_~x)} is VALID [2022-02-21 03:03:01,786 INFO L290 TraceCheckUtils]: 34: Hoare triple {18572#(<= 0 g_~x)} assume !(0 == ~x); {18572#(<= 0 g_~x)} is VALID [2022-02-21 03:03:01,786 INFO L290 TraceCheckUtils]: 35: Hoare triple {18572#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {18572#(<= 0 g_~x)} is VALID [2022-02-21 03:03:01,786 INFO L290 TraceCheckUtils]: 36: Hoare triple {18572#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {18572#(<= 0 g_~x)} is VALID [2022-02-21 03:03:01,787 INFO L272 TraceCheckUtils]: 37: Hoare triple {18572#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {18573#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:03:01,787 INFO L290 TraceCheckUtils]: 38: Hoare triple {18573#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {18574#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:01,788 INFO L290 TraceCheckUtils]: 39: Hoare triple {18574#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {18574#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:01,788 INFO L290 TraceCheckUtils]: 40: Hoare triple {18574#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {18574#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:01,788 INFO L290 TraceCheckUtils]: 41: Hoare triple {18574#(<= 0 (+ g_~x 1))} assume ~x - 1 >= -2147483648; {18574#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:01,789 INFO L272 TraceCheckUtils]: 42: Hoare triple {18574#(<= 0 (+ g_~x 1))} call #t~ret0 := g(~x - 1); {18575#(<= 0 (+ |g_#in~x| 2))} is VALID [2022-02-21 03:03:01,789 INFO L290 TraceCheckUtils]: 43: Hoare triple {18575#(<= 0 (+ |g_#in~x| 2))} ~x := #in~x; {18576#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:01,789 INFO L290 TraceCheckUtils]: 44: Hoare triple {18576#(<= 0 (+ 2 g_~x))} assume !(0 == ~x); {18576#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:01,790 INFO L290 TraceCheckUtils]: 45: Hoare triple {18576#(<= 0 (+ 2 g_~x))} assume ~x - 1 <= 2147483647; {18576#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:01,790 INFO L290 TraceCheckUtils]: 46: Hoare triple {18576#(<= 0 (+ 2 g_~x))} assume ~x - 1 >= -2147483648; {18576#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:01,790 INFO L272 TraceCheckUtils]: 47: Hoare triple {18576#(<= 0 (+ 2 g_~x))} call #t~ret0 := g(~x - 1); {18577#(<= 0 (+ |g_#in~x| 3))} is VALID [2022-02-21 03:03:01,791 INFO L290 TraceCheckUtils]: 48: Hoare triple {18577#(<= 0 (+ |g_#in~x| 3))} ~x := #in~x; {18578#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:01,791 INFO L290 TraceCheckUtils]: 49: Hoare triple {18578#(<= 0 (+ 3 g_~x))} assume !(0 == ~x); {18578#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:01,791 INFO L290 TraceCheckUtils]: 50: Hoare triple {18578#(<= 0 (+ 3 g_~x))} assume ~x - 1 <= 2147483647; {18578#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:01,792 INFO L290 TraceCheckUtils]: 51: Hoare triple {18578#(<= 0 (+ 3 g_~x))} assume ~x - 1 >= -2147483648; {18578#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:01,792 INFO L272 TraceCheckUtils]: 52: Hoare triple {18578#(<= 0 (+ 3 g_~x))} call #t~ret0 := g(~x - 1); {18579#(<= 0 (+ |g_#in~x| 4))} is VALID [2022-02-21 03:03:01,792 INFO L290 TraceCheckUtils]: 53: Hoare triple {18579#(<= 0 (+ |g_#in~x| 4))} ~x := #in~x; {18580#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:01,793 INFO L290 TraceCheckUtils]: 54: Hoare triple {18580#(<= 0 (+ g_~x 4))} assume !(0 == ~x); {18580#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:01,793 INFO L290 TraceCheckUtils]: 55: Hoare triple {18580#(<= 0 (+ g_~x 4))} assume ~x - 1 <= 2147483647; {18580#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:01,793 INFO L290 TraceCheckUtils]: 56: Hoare triple {18580#(<= 0 (+ g_~x 4))} assume !(~x - 1 >= -2147483648); {18549#false} is VALID [2022-02-21 03:03:01,793 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 76 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-02-21 03:03:01,794 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:01,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933750025] [2022-02-21 03:03:01,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933750025] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:01,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830261096] [2022-02-21 03:03:01,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:03:01,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:01,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:01,800 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:03:01,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-21 03:03:01,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-02-21 03:03:01,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:03:01,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-21 03:03:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:01,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:02,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {18548#true} assume { :begin_inline_ULTIMATE.init } true; {18548#true} is VALID [2022-02-21 03:03:02,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {18548#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {18548#true} is VALID [2022-02-21 03:03:02,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {18548#true} assume !(main_~x~0#1 < 0); {18548#true} is VALID [2022-02-21 03:03:02,065 INFO L272 TraceCheckUtils]: 3: Hoare triple {18548#true} call main_#t~ret3#1 := g(main_~x~0#1); {18548#true} is VALID [2022-02-21 03:03:02,065 INFO L290 TraceCheckUtils]: 4: Hoare triple {18548#true} ~x := #in~x; {18548#true} is VALID [2022-02-21 03:03:02,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {18548#true} assume !(0 == ~x); {18548#true} is VALID [2022-02-21 03:03:02,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {18548#true} assume ~x - 1 <= 2147483647; {18548#true} is VALID [2022-02-21 03:03:02,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {18548#true} assume ~x - 1 >= -2147483648; {18548#true} is VALID [2022-02-21 03:03:02,065 INFO L272 TraceCheckUtils]: 8: Hoare triple {18548#true} call #t~ret0 := g(~x - 1); {18548#true} is VALID [2022-02-21 03:03:02,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {18548#true} ~x := #in~x; {18548#true} is VALID [2022-02-21 03:03:02,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {18548#true} assume !(0 == ~x); {18548#true} is VALID [2022-02-21 03:03:02,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {18548#true} assume ~x - 1 <= 2147483647; {18548#true} is VALID [2022-02-21 03:03:02,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {18548#true} assume ~x - 1 >= -2147483648; {18548#true} is VALID [2022-02-21 03:03:02,065 INFO L272 TraceCheckUtils]: 13: Hoare triple {18548#true} call #t~ret0 := g(~x - 1); {18548#true} is VALID [2022-02-21 03:03:02,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {18548#true} ~x := #in~x; {18548#true} is VALID [2022-02-21 03:03:02,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {18548#true} assume 0 == ~x;#res := 1; {18548#true} is VALID [2022-02-21 03:03:02,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {18548#true} assume true; {18548#true} is VALID [2022-02-21 03:03:02,066 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18548#true} {18548#true} #32#return; {18548#true} is VALID [2022-02-21 03:03:02,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {18548#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {18548#true} is VALID [2022-02-21 03:03:02,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {18548#true} assume #t~ret0 - 1 <= 2147483647; {18548#true} is VALID [2022-02-21 03:03:02,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {18548#true} assume #t~ret0 - 1 >= -2147483648; {18548#true} is VALID [2022-02-21 03:03:02,066 INFO L272 TraceCheckUtils]: 21: Hoare triple {18548#true} call #t~ret1 := g(#t~ret0 - 1); {18548#true} is VALID [2022-02-21 03:03:02,066 INFO L290 TraceCheckUtils]: 22: Hoare triple {18548#true} ~x := #in~x; {18548#true} is VALID [2022-02-21 03:03:02,066 INFO L290 TraceCheckUtils]: 23: Hoare triple {18548#true} assume 0 == ~x;#res := 1; {18590#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:02,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {18590#(<= 1 |g_#res|)} assume true; {18590#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:02,067 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {18590#(<= 1 |g_#res|)} {18548#true} #34#return; {18589#(<= 1 |g_#t~ret1|)} is VALID [2022-02-21 03:03:02,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {18589#(<= 1 |g_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret0;havoc #t~ret1; {18590#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:02,068 INFO L290 TraceCheckUtils]: 27: Hoare triple {18590#(<= 1 |g_#res|)} assume true; {18590#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:02,068 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {18590#(<= 1 |g_#res|)} {18548#true} #32#return; {18570#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:03:02,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {18570#(<= 1 |g_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {18570#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:03:02,069 INFO L290 TraceCheckUtils]: 30: Hoare triple {18570#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 <= 2147483647; {18570#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:03:02,069 INFO L290 TraceCheckUtils]: 31: Hoare triple {18570#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 >= -2147483648; {18570#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:03:02,070 INFO L272 TraceCheckUtils]: 32: Hoare triple {18570#(<= 1 |g_#t~ret0|)} call #t~ret1 := g(#t~ret0 - 1); {18571#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:03:02,070 INFO L290 TraceCheckUtils]: 33: Hoare triple {18571#(<= 0 |g_#in~x|)} ~x := #in~x; {18572#(<= 0 g_~x)} is VALID [2022-02-21 03:03:02,070 INFO L290 TraceCheckUtils]: 34: Hoare triple {18572#(<= 0 g_~x)} assume !(0 == ~x); {18572#(<= 0 g_~x)} is VALID [2022-02-21 03:03:02,071 INFO L290 TraceCheckUtils]: 35: Hoare triple {18572#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {18572#(<= 0 g_~x)} is VALID [2022-02-21 03:03:02,071 INFO L290 TraceCheckUtils]: 36: Hoare triple {18572#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {18572#(<= 0 g_~x)} is VALID [2022-02-21 03:03:02,071 INFO L272 TraceCheckUtils]: 37: Hoare triple {18572#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {18573#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:03:02,072 INFO L290 TraceCheckUtils]: 38: Hoare triple {18573#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {18574#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:02,072 INFO L290 TraceCheckUtils]: 39: Hoare triple {18574#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {18574#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:02,072 INFO L290 TraceCheckUtils]: 40: Hoare triple {18574#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {18574#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:02,073 INFO L290 TraceCheckUtils]: 41: Hoare triple {18574#(<= 0 (+ g_~x 1))} assume ~x - 1 >= -2147483648; {18574#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:02,073 INFO L272 TraceCheckUtils]: 42: Hoare triple {18574#(<= 0 (+ g_~x 1))} call #t~ret0 := g(~x - 1); {18575#(<= 0 (+ |g_#in~x| 2))} is VALID [2022-02-21 03:03:02,073 INFO L290 TraceCheckUtils]: 43: Hoare triple {18575#(<= 0 (+ |g_#in~x| 2))} ~x := #in~x; {18576#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:02,074 INFO L290 TraceCheckUtils]: 44: Hoare triple {18576#(<= 0 (+ 2 g_~x))} assume !(0 == ~x); {18576#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:02,074 INFO L290 TraceCheckUtils]: 45: Hoare triple {18576#(<= 0 (+ 2 g_~x))} assume ~x - 1 <= 2147483647; {18576#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:02,074 INFO L290 TraceCheckUtils]: 46: Hoare triple {18576#(<= 0 (+ 2 g_~x))} assume ~x - 1 >= -2147483648; {18576#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:02,075 INFO L272 TraceCheckUtils]: 47: Hoare triple {18576#(<= 0 (+ 2 g_~x))} call #t~ret0 := g(~x - 1); {18577#(<= 0 (+ |g_#in~x| 3))} is VALID [2022-02-21 03:03:02,075 INFO L290 TraceCheckUtils]: 48: Hoare triple {18577#(<= 0 (+ |g_#in~x| 3))} ~x := #in~x; {18578#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:02,076 INFO L290 TraceCheckUtils]: 49: Hoare triple {18578#(<= 0 (+ 3 g_~x))} assume !(0 == ~x); {18578#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:02,076 INFO L290 TraceCheckUtils]: 50: Hoare triple {18578#(<= 0 (+ 3 g_~x))} assume ~x - 1 <= 2147483647; {18578#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:02,076 INFO L290 TraceCheckUtils]: 51: Hoare triple {18578#(<= 0 (+ 3 g_~x))} assume ~x - 1 >= -2147483648; {18578#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:02,077 INFO L272 TraceCheckUtils]: 52: Hoare triple {18578#(<= 0 (+ 3 g_~x))} call #t~ret0 := g(~x - 1); {18579#(<= 0 (+ |g_#in~x| 4))} is VALID [2022-02-21 03:03:02,077 INFO L290 TraceCheckUtils]: 53: Hoare triple {18579#(<= 0 (+ |g_#in~x| 4))} ~x := #in~x; {18580#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:02,077 INFO L290 TraceCheckUtils]: 54: Hoare triple {18580#(<= 0 (+ g_~x 4))} assume !(0 == ~x); {18580#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:02,078 INFO L290 TraceCheckUtils]: 55: Hoare triple {18580#(<= 0 (+ g_~x 4))} assume ~x - 1 <= 2147483647; {18580#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:02,078 INFO L290 TraceCheckUtils]: 56: Hoare triple {18580#(<= 0 (+ g_~x 4))} assume !(~x - 1 >= -2147483648); {18549#false} is VALID [2022-02-21 03:03:02,078 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 76 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-02-21 03:03:02,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:02,591 INFO L290 TraceCheckUtils]: 56: Hoare triple {18762#(<= 0 (+ 2147483647 g_~x))} assume !(~x - 1 >= -2147483648); {18549#false} is VALID [2022-02-21 03:03:02,592 INFO L290 TraceCheckUtils]: 55: Hoare triple {18762#(<= 0 (+ 2147483647 g_~x))} assume ~x - 1 <= 2147483647; {18762#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:03:02,592 INFO L290 TraceCheckUtils]: 54: Hoare triple {18762#(<= 0 (+ 2147483647 g_~x))} assume !(0 == ~x); {18762#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:03:02,592 INFO L290 TraceCheckUtils]: 53: Hoare triple {18772#(<= 0 (+ 2147483647 |g_#in~x|))} ~x := #in~x; {18762#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:03:02,593 INFO L272 TraceCheckUtils]: 52: Hoare triple {18776#(<= 0 (+ g_~x 2147483646))} call #t~ret0 := g(~x - 1); {18772#(<= 0 (+ 2147483647 |g_#in~x|))} is VALID [2022-02-21 03:03:02,593 INFO L290 TraceCheckUtils]: 51: Hoare triple {18776#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 >= -2147483648; {18776#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:03:02,593 INFO L290 TraceCheckUtils]: 50: Hoare triple {18776#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 <= 2147483647; {18776#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:03:02,594 INFO L290 TraceCheckUtils]: 49: Hoare triple {18776#(<= 0 (+ g_~x 2147483646))} assume !(0 == ~x); {18776#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:03:02,594 INFO L290 TraceCheckUtils]: 48: Hoare triple {18789#(<= 0 (+ |g_#in~x| 2147483646))} ~x := #in~x; {18776#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:03:02,595 INFO L272 TraceCheckUtils]: 47: Hoare triple {18793#(<= 0 (+ 2147483645 g_~x))} call #t~ret0 := g(~x - 1); {18789#(<= 0 (+ |g_#in~x| 2147483646))} is VALID [2022-02-21 03:03:02,595 INFO L290 TraceCheckUtils]: 46: Hoare triple {18793#(<= 0 (+ 2147483645 g_~x))} assume ~x - 1 >= -2147483648; {18793#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:03:02,595 INFO L290 TraceCheckUtils]: 45: Hoare triple {18793#(<= 0 (+ 2147483645 g_~x))} assume ~x - 1 <= 2147483647; {18793#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:03:02,595 INFO L290 TraceCheckUtils]: 44: Hoare triple {18793#(<= 0 (+ 2147483645 g_~x))} assume !(0 == ~x); {18793#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:03:02,596 INFO L290 TraceCheckUtils]: 43: Hoare triple {18806#(<= 0 (+ 2147483645 |g_#in~x|))} ~x := #in~x; {18793#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:03:02,596 INFO L272 TraceCheckUtils]: 42: Hoare triple {18810#(<= 0 (+ g_~x 2147483644))} call #t~ret0 := g(~x - 1); {18806#(<= 0 (+ 2147483645 |g_#in~x|))} is VALID [2022-02-21 03:03:02,597 INFO L290 TraceCheckUtils]: 41: Hoare triple {18810#(<= 0 (+ g_~x 2147483644))} assume ~x - 1 >= -2147483648; {18810#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:03:02,597 INFO L290 TraceCheckUtils]: 40: Hoare triple {18810#(<= 0 (+ g_~x 2147483644))} assume ~x - 1 <= 2147483647; {18810#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:03:02,597 INFO L290 TraceCheckUtils]: 39: Hoare triple {18810#(<= 0 (+ g_~x 2147483644))} assume !(0 == ~x); {18810#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:03:02,597 INFO L290 TraceCheckUtils]: 38: Hoare triple {18823#(<= 0 (+ |g_#in~x| 2147483644))} ~x := #in~x; {18810#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:03:02,598 INFO L272 TraceCheckUtils]: 37: Hoare triple {18827#(<= 0 (+ 2147483643 g_~x))} call #t~ret0 := g(~x - 1); {18823#(<= 0 (+ |g_#in~x| 2147483644))} is VALID [2022-02-21 03:03:02,598 INFO L290 TraceCheckUtils]: 36: Hoare triple {18827#(<= 0 (+ 2147483643 g_~x))} assume ~x - 1 >= -2147483648; {18827#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:03:02,598 INFO L290 TraceCheckUtils]: 35: Hoare triple {18827#(<= 0 (+ 2147483643 g_~x))} assume ~x - 1 <= 2147483647; {18827#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:03:02,599 INFO L290 TraceCheckUtils]: 34: Hoare triple {18827#(<= 0 (+ 2147483643 g_~x))} assume !(0 == ~x); {18827#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:03:02,599 INFO L290 TraceCheckUtils]: 33: Hoare triple {18840#(<= 0 (+ 2147483643 |g_#in~x|))} ~x := #in~x; {18827#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:03:02,600 INFO L272 TraceCheckUtils]: 32: Hoare triple {18844#(<= 0 (+ 2147483642 |g_#t~ret0|))} call #t~ret1 := g(#t~ret0 - 1); {18840#(<= 0 (+ 2147483643 |g_#in~x|))} is VALID [2022-02-21 03:03:02,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {18844#(<= 0 (+ 2147483642 |g_#t~ret0|))} assume #t~ret0 - 1 >= -2147483648; {18844#(<= 0 (+ 2147483642 |g_#t~ret0|))} is VALID [2022-02-21 03:03:02,600 INFO L290 TraceCheckUtils]: 30: Hoare triple {18844#(<= 0 (+ 2147483642 |g_#t~ret0|))} assume #t~ret0 - 1 <= 2147483647; {18844#(<= 0 (+ 2147483642 |g_#t~ret0|))} is VALID [2022-02-21 03:03:02,601 INFO L290 TraceCheckUtils]: 29: Hoare triple {18844#(<= 0 (+ 2147483642 |g_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {18844#(<= 0 (+ 2147483642 |g_#t~ret0|))} is VALID [2022-02-21 03:03:02,601 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {18860#(<= 0 (+ |g_#res| 2147483642))} {18548#true} #32#return; {18844#(<= 0 (+ 2147483642 |g_#t~ret0|))} is VALID [2022-02-21 03:03:02,602 INFO L290 TraceCheckUtils]: 27: Hoare triple {18860#(<= 0 (+ |g_#res| 2147483642))} assume true; {18860#(<= 0 (+ |g_#res| 2147483642))} is VALID [2022-02-21 03:03:02,602 INFO L290 TraceCheckUtils]: 26: Hoare triple {18867#(<= 0 (+ 2147483642 |g_#t~ret1|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret0;havoc #t~ret1; {18860#(<= 0 (+ |g_#res| 2147483642))} is VALID [2022-02-21 03:03:02,603 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {18860#(<= 0 (+ |g_#res| 2147483642))} {18548#true} #34#return; {18867#(<= 0 (+ 2147483642 |g_#t~ret1|))} is VALID [2022-02-21 03:03:02,603 INFO L290 TraceCheckUtils]: 24: Hoare triple {18860#(<= 0 (+ |g_#res| 2147483642))} assume true; {18860#(<= 0 (+ |g_#res| 2147483642))} is VALID [2022-02-21 03:03:02,603 INFO L290 TraceCheckUtils]: 23: Hoare triple {18548#true} assume 0 == ~x;#res := 1; {18860#(<= 0 (+ |g_#res| 2147483642))} is VALID [2022-02-21 03:03:02,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {18548#true} ~x := #in~x; {18548#true} is VALID [2022-02-21 03:03:02,604 INFO L272 TraceCheckUtils]: 21: Hoare triple {18548#true} call #t~ret1 := g(#t~ret0 - 1); {18548#true} is VALID [2022-02-21 03:03:02,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {18548#true} assume #t~ret0 - 1 >= -2147483648; {18548#true} is VALID [2022-02-21 03:03:02,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {18548#true} assume #t~ret0 - 1 <= 2147483647; {18548#true} is VALID [2022-02-21 03:03:02,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {18548#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {18548#true} is VALID [2022-02-21 03:03:02,604 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18548#true} {18548#true} #32#return; {18548#true} is VALID [2022-02-21 03:03:02,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {18548#true} assume true; {18548#true} is VALID [2022-02-21 03:03:02,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {18548#true} assume 0 == ~x;#res := 1; {18548#true} is VALID [2022-02-21 03:03:02,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {18548#true} ~x := #in~x; {18548#true} is VALID [2022-02-21 03:03:02,605 INFO L272 TraceCheckUtils]: 13: Hoare triple {18548#true} call #t~ret0 := g(~x - 1); {18548#true} is VALID [2022-02-21 03:03:02,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {18548#true} assume ~x - 1 >= -2147483648; {18548#true} is VALID [2022-02-21 03:03:02,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {18548#true} assume ~x - 1 <= 2147483647; {18548#true} is VALID [2022-02-21 03:03:02,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {18548#true} assume !(0 == ~x); {18548#true} is VALID [2022-02-21 03:03:02,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {18548#true} ~x := #in~x; {18548#true} is VALID [2022-02-21 03:03:02,605 INFO L272 TraceCheckUtils]: 8: Hoare triple {18548#true} call #t~ret0 := g(~x - 1); {18548#true} is VALID [2022-02-21 03:03:02,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {18548#true} assume ~x - 1 >= -2147483648; {18548#true} is VALID [2022-02-21 03:03:02,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {18548#true} assume ~x - 1 <= 2147483647; {18548#true} is VALID [2022-02-21 03:03:02,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {18548#true} assume !(0 == ~x); {18548#true} is VALID [2022-02-21 03:03:02,605 INFO L290 TraceCheckUtils]: 4: Hoare triple {18548#true} ~x := #in~x; {18548#true} is VALID [2022-02-21 03:03:02,606 INFO L272 TraceCheckUtils]: 3: Hoare triple {18548#true} call main_#t~ret3#1 := g(main_~x~0#1); {18548#true} is VALID [2022-02-21 03:03:02,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {18548#true} assume !(main_~x~0#1 < 0); {18548#true} is VALID [2022-02-21 03:03:02,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {18548#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {18548#true} is VALID [2022-02-21 03:03:02,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {18548#true} assume { :begin_inline_ULTIMATE.init } true; {18548#true} is VALID [2022-02-21 03:03:02,606 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 76 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-02-21 03:03:02,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830261096] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:02,607 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:02,607 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2022-02-21 03:03:02,607 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585563043] [2022-02-21 03:03:02,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:02,608 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 16 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2022-02-21 03:03:02,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:02,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 28 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 16 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-21 03:03:02,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:02,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-21 03:03:02,663 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:02,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-21 03:03:02,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2022-02-21 03:03:02,664 INFO L87 Difference]: Start difference. First operand 698 states and 818 transitions. Second operand has 28 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 16 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-21 03:03:04,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:04,961 INFO L93 Difference]: Finished difference Result 807 states and 950 transitions. [2022-02-21 03:03:04,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-02-21 03:03:04,961 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 16 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2022-02-21 03:03:04,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:04,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 16 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-21 03:03:04,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 186 transitions. [2022-02-21 03:03:04,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 16 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-21 03:03:04,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 186 transitions. [2022-02-21 03:03:04,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states and 186 transitions. [2022-02-21 03:03:05,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:05,130 INFO L225 Difference]: With dead ends: 807 [2022-02-21 03:03:05,131 INFO L226 Difference]: Without dead ends: 806 [2022-02-21 03:03:05,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1646 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1544, Invalid=4936, Unknown=0, NotChecked=0, Total=6480 [2022-02-21 03:03:05,133 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 280 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:05,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 189 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-21 03:03:05,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2022-02-21 03:03:05,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 410. [2022-02-21 03:03:05,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:05,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 806 states. Second operand has 410 states, 307 states have (on average 1.1140065146579805) internal successors, (342), 308 states have internal predecessors, (342), 69 states have call successors, (69), 34 states have call predecessors, (69), 33 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2022-02-21 03:03:05,362 INFO L74 IsIncluded]: Start isIncluded. First operand 806 states. Second operand has 410 states, 307 states have (on average 1.1140065146579805) internal successors, (342), 308 states have internal predecessors, (342), 69 states have call successors, (69), 34 states have call predecessors, (69), 33 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2022-02-21 03:03:05,362 INFO L87 Difference]: Start difference. First operand 806 states. Second operand has 410 states, 307 states have (on average 1.1140065146579805) internal successors, (342), 308 states have internal predecessors, (342), 69 states have call successors, (69), 34 states have call predecessors, (69), 33 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2022-02-21 03:03:05,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:05,394 INFO L93 Difference]: Finished difference Result 806 states and 944 transitions. [2022-02-21 03:03:05,394 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 944 transitions. [2022-02-21 03:03:05,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:05,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:05,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 410 states, 307 states have (on average 1.1140065146579805) internal successors, (342), 308 states have internal predecessors, (342), 69 states have call successors, (69), 34 states have call predecessors, (69), 33 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) Second operand 806 states. [2022-02-21 03:03:05,399 INFO L87 Difference]: Start difference. First operand has 410 states, 307 states have (on average 1.1140065146579805) internal successors, (342), 308 states have internal predecessors, (342), 69 states have call successors, (69), 34 states have call predecessors, (69), 33 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) Second operand 806 states. [2022-02-21 03:03:05,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:05,428 INFO L93 Difference]: Finished difference Result 806 states and 944 transitions. [2022-02-21 03:03:05,428 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 944 transitions. [2022-02-21 03:03:05,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:05,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:05,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:05,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:05,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 307 states have (on average 1.1140065146579805) internal successors, (342), 308 states have internal predecessors, (342), 69 states have call successors, (69), 34 states have call predecessors, (69), 33 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2022-02-21 03:03:05,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 478 transitions. [2022-02-21 03:03:05,442 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 478 transitions. Word has length 57 [2022-02-21 03:03:05,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:05,443 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 478 transitions. [2022-02-21 03:03:05,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 16 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-21 03:03:05,443 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 478 transitions. [2022-02-21 03:03:05,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-21 03:03:05,445 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:05,446 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:05,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:03:05,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:05,659 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:03:05,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:05,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2093556360, now seen corresponding path program 4 times [2022-02-21 03:03:05,660 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:05,660 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796461296] [2022-02-21 03:03:05,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:05,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:05,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:03:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:05,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {22172#true} ~x := #in~x; {22172#true} is VALID [2022-02-21 03:03:05,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {22172#true} assume 0 == ~x;#res := 1; {22201#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:05,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {22201#(<= 1 |g_#res|)} assume true; {22201#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:05,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22201#(<= 1 |g_#res|)} {22172#true} #32#return; {22178#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:03:05,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {22172#true} assume { :begin_inline_ULTIMATE.init } true; {22172#true} is VALID [2022-02-21 03:03:05,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {22172#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {22172#true} is VALID [2022-02-21 03:03:05,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {22172#true} assume !(main_~x~0#1 < 0); {22172#true} is VALID [2022-02-21 03:03:05,924 INFO L272 TraceCheckUtils]: 3: Hoare triple {22172#true} call main_#t~ret3#1 := g(main_~x~0#1); {22172#true} is VALID [2022-02-21 03:03:05,925 INFO L290 TraceCheckUtils]: 4: Hoare triple {22172#true} ~x := #in~x; {22172#true} is VALID [2022-02-21 03:03:05,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {22172#true} assume !(0 == ~x); {22172#true} is VALID [2022-02-21 03:03:05,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {22172#true} assume ~x - 1 <= 2147483647; {22172#true} is VALID [2022-02-21 03:03:05,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {22172#true} assume ~x - 1 >= -2147483648; {22172#true} is VALID [2022-02-21 03:03:05,925 INFO L272 TraceCheckUtils]: 8: Hoare triple {22172#true} call #t~ret0 := g(~x - 1); {22172#true} is VALID [2022-02-21 03:03:05,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {22172#true} ~x := #in~x; {22172#true} is VALID [2022-02-21 03:03:05,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {22172#true} assume 0 == ~x;#res := 1; {22201#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:05,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {22201#(<= 1 |g_#res|)} assume true; {22201#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:05,933 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {22201#(<= 1 |g_#res|)} {22172#true} #32#return; {22178#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:03:05,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {22178#(<= 1 |g_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {22178#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:03:05,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {22178#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 <= 2147483647; {22178#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:03:05,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {22178#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 >= -2147483648; {22178#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:03:05,934 INFO L272 TraceCheckUtils]: 16: Hoare triple {22178#(<= 1 |g_#t~ret0|)} call #t~ret1 := g(#t~ret0 - 1); {22179#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:03:05,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {22179#(<= 0 |g_#in~x|)} ~x := #in~x; {22180#(<= 0 g_~x)} is VALID [2022-02-21 03:03:05,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {22180#(<= 0 g_~x)} assume !(0 == ~x); {22180#(<= 0 g_~x)} is VALID [2022-02-21 03:03:05,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {22180#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {22180#(<= 0 g_~x)} is VALID [2022-02-21 03:03:05,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {22180#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {22180#(<= 0 g_~x)} is VALID [2022-02-21 03:03:05,936 INFO L272 TraceCheckUtils]: 21: Hoare triple {22180#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {22181#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:03:05,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {22181#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {22182#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:05,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {22182#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {22182#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:05,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {22182#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {22182#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:05,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {22182#(<= 0 (+ g_~x 1))} assume ~x - 1 >= -2147483648; {22182#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:05,938 INFO L272 TraceCheckUtils]: 26: Hoare triple {22182#(<= 0 (+ g_~x 1))} call #t~ret0 := g(~x - 1); {22183#(<= 0 (+ |g_#in~x| 2))} is VALID [2022-02-21 03:03:05,939 INFO L290 TraceCheckUtils]: 27: Hoare triple {22183#(<= 0 (+ |g_#in~x| 2))} ~x := #in~x; {22184#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:05,939 INFO L290 TraceCheckUtils]: 28: Hoare triple {22184#(<= 0 (+ 2 g_~x))} assume !(0 == ~x); {22184#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:05,939 INFO L290 TraceCheckUtils]: 29: Hoare triple {22184#(<= 0 (+ 2 g_~x))} assume ~x - 1 <= 2147483647; {22184#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:05,940 INFO L290 TraceCheckUtils]: 30: Hoare triple {22184#(<= 0 (+ 2 g_~x))} assume ~x - 1 >= -2147483648; {22184#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:05,940 INFO L272 TraceCheckUtils]: 31: Hoare triple {22184#(<= 0 (+ 2 g_~x))} call #t~ret0 := g(~x - 1); {22185#(<= 0 (+ |g_#in~x| 3))} is VALID [2022-02-21 03:03:05,940 INFO L290 TraceCheckUtils]: 32: Hoare triple {22185#(<= 0 (+ |g_#in~x| 3))} ~x := #in~x; {22186#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:05,941 INFO L290 TraceCheckUtils]: 33: Hoare triple {22186#(<= 0 (+ 3 g_~x))} assume !(0 == ~x); {22186#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:05,941 INFO L290 TraceCheckUtils]: 34: Hoare triple {22186#(<= 0 (+ 3 g_~x))} assume ~x - 1 <= 2147483647; {22186#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:05,942 INFO L290 TraceCheckUtils]: 35: Hoare triple {22186#(<= 0 (+ 3 g_~x))} assume ~x - 1 >= -2147483648; {22186#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:05,942 INFO L272 TraceCheckUtils]: 36: Hoare triple {22186#(<= 0 (+ 3 g_~x))} call #t~ret0 := g(~x - 1); {22187#(<= 0 (+ |g_#in~x| 4))} is VALID [2022-02-21 03:03:05,942 INFO L290 TraceCheckUtils]: 37: Hoare triple {22187#(<= 0 (+ |g_#in~x| 4))} ~x := #in~x; {22188#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:05,943 INFO L290 TraceCheckUtils]: 38: Hoare triple {22188#(<= 0 (+ g_~x 4))} assume !(0 == ~x); {22188#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:05,943 INFO L290 TraceCheckUtils]: 39: Hoare triple {22188#(<= 0 (+ g_~x 4))} assume ~x - 1 <= 2147483647; {22188#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:05,943 INFO L290 TraceCheckUtils]: 40: Hoare triple {22188#(<= 0 (+ g_~x 4))} assume ~x - 1 >= -2147483648; {22188#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:05,944 INFO L272 TraceCheckUtils]: 41: Hoare triple {22188#(<= 0 (+ g_~x 4))} call #t~ret0 := g(~x - 1); {22189#(<= 0 (+ 5 |g_#in~x|))} is VALID [2022-02-21 03:03:05,944 INFO L290 TraceCheckUtils]: 42: Hoare triple {22189#(<= 0 (+ 5 |g_#in~x|))} ~x := #in~x; {22190#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:05,944 INFO L290 TraceCheckUtils]: 43: Hoare triple {22190#(<= 0 (+ 5 g_~x))} assume !(0 == ~x); {22190#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:05,945 INFO L290 TraceCheckUtils]: 44: Hoare triple {22190#(<= 0 (+ 5 g_~x))} assume ~x - 1 <= 2147483647; {22190#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:05,945 INFO L290 TraceCheckUtils]: 45: Hoare triple {22190#(<= 0 (+ 5 g_~x))} assume ~x - 1 >= -2147483648; {22190#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:05,945 INFO L272 TraceCheckUtils]: 46: Hoare triple {22190#(<= 0 (+ 5 g_~x))} call #t~ret0 := g(~x - 1); {22191#(<= 0 (+ |g_#in~x| 6))} is VALID [2022-02-21 03:03:05,946 INFO L290 TraceCheckUtils]: 47: Hoare triple {22191#(<= 0 (+ |g_#in~x| 6))} ~x := #in~x; {22192#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:05,946 INFO L290 TraceCheckUtils]: 48: Hoare triple {22192#(<= 0 (+ 6 g_~x))} assume !(0 == ~x); {22192#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:05,946 INFO L290 TraceCheckUtils]: 49: Hoare triple {22192#(<= 0 (+ 6 g_~x))} assume ~x - 1 <= 2147483647; {22192#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:05,947 INFO L290 TraceCheckUtils]: 50: Hoare triple {22192#(<= 0 (+ 6 g_~x))} assume ~x - 1 >= -2147483648; {22192#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:05,948 INFO L272 TraceCheckUtils]: 51: Hoare triple {22192#(<= 0 (+ 6 g_~x))} call #t~ret0 := g(~x - 1); {22193#(<= 0 (+ 7 |g_#in~x|))} is VALID [2022-02-21 03:03:05,948 INFO L290 TraceCheckUtils]: 52: Hoare triple {22193#(<= 0 (+ 7 |g_#in~x|))} ~x := #in~x; {22194#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:05,948 INFO L290 TraceCheckUtils]: 53: Hoare triple {22194#(<= 0 (+ 7 g_~x))} assume !(0 == ~x); {22194#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:05,949 INFO L290 TraceCheckUtils]: 54: Hoare triple {22194#(<= 0 (+ 7 g_~x))} assume ~x - 1 <= 2147483647; {22194#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:05,949 INFO L290 TraceCheckUtils]: 55: Hoare triple {22194#(<= 0 (+ 7 g_~x))} assume ~x - 1 >= -2147483648; {22194#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:05,949 INFO L272 TraceCheckUtils]: 56: Hoare triple {22194#(<= 0 (+ 7 g_~x))} call #t~ret0 := g(~x - 1); {22195#(<= 0 (+ |g_#in~x| 8))} is VALID [2022-02-21 03:03:05,950 INFO L290 TraceCheckUtils]: 57: Hoare triple {22195#(<= 0 (+ |g_#in~x| 8))} ~x := #in~x; {22196#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:05,950 INFO L290 TraceCheckUtils]: 58: Hoare triple {22196#(<= 0 (+ g_~x 8))} assume !(0 == ~x); {22196#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:05,950 INFO L290 TraceCheckUtils]: 59: Hoare triple {22196#(<= 0 (+ g_~x 8))} assume ~x - 1 <= 2147483647; {22196#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:05,951 INFO L290 TraceCheckUtils]: 60: Hoare triple {22196#(<= 0 (+ g_~x 8))} assume ~x - 1 >= -2147483648; {22196#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:05,951 INFO L272 TraceCheckUtils]: 61: Hoare triple {22196#(<= 0 (+ g_~x 8))} call #t~ret0 := g(~x - 1); {22197#(<= 0 (+ |g_#in~x| 9))} is VALID [2022-02-21 03:03:05,952 INFO L290 TraceCheckUtils]: 62: Hoare triple {22197#(<= 0 (+ |g_#in~x| 9))} ~x := #in~x; {22198#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:05,952 INFO L290 TraceCheckUtils]: 63: Hoare triple {22198#(<= 0 (+ 9 g_~x))} assume !(0 == ~x); {22198#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:05,952 INFO L290 TraceCheckUtils]: 64: Hoare triple {22198#(<= 0 (+ 9 g_~x))} assume ~x - 1 <= 2147483647; {22198#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:05,953 INFO L290 TraceCheckUtils]: 65: Hoare triple {22198#(<= 0 (+ 9 g_~x))} assume ~x - 1 >= -2147483648; {22198#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:05,953 INFO L272 TraceCheckUtils]: 66: Hoare triple {22198#(<= 0 (+ 9 g_~x))} call #t~ret0 := g(~x - 1); {22199#(<= 0 (+ |g_#in~x| 10))} is VALID [2022-02-21 03:03:05,954 INFO L290 TraceCheckUtils]: 67: Hoare triple {22199#(<= 0 (+ |g_#in~x| 10))} ~x := #in~x; {22200#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:05,954 INFO L290 TraceCheckUtils]: 68: Hoare triple {22200#(<= 0 (+ g_~x 10))} assume !(0 == ~x); {22200#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:05,954 INFO L290 TraceCheckUtils]: 69: Hoare triple {22200#(<= 0 (+ g_~x 10))} assume ~x - 1 <= 2147483647; {22200#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:05,955 INFO L290 TraceCheckUtils]: 70: Hoare triple {22200#(<= 0 (+ g_~x 10))} assume !(~x - 1 >= -2147483648); {22173#false} is VALID [2022-02-21 03:03:05,955 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 76 proven. 265 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:03:05,956 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:05,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796461296] [2022-02-21 03:03:05,956 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796461296] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:05,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87315574] [2022-02-21 03:03:05,956 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-21 03:03:05,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:05,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:05,958 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:03:05,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-21 03:03:05,994 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-21 03:03:05,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:03:05,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 03:03:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:06,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:06,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {22172#true} assume { :begin_inline_ULTIMATE.init } true; {22172#true} is VALID [2022-02-21 03:03:06,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {22172#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {22172#true} is VALID [2022-02-21 03:03:06,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {22172#true} assume !(main_~x~0#1 < 0); {22172#true} is VALID [2022-02-21 03:03:06,148 INFO L272 TraceCheckUtils]: 3: Hoare triple {22172#true} call main_#t~ret3#1 := g(main_~x~0#1); {22172#true} is VALID [2022-02-21 03:03:06,148 INFO L290 TraceCheckUtils]: 4: Hoare triple {22172#true} ~x := #in~x; {22172#true} is VALID [2022-02-21 03:03:06,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {22172#true} assume !(0 == ~x); {22172#true} is VALID [2022-02-21 03:03:06,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {22172#true} assume ~x - 1 <= 2147483647; {22172#true} is VALID [2022-02-21 03:03:06,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {22172#true} assume ~x - 1 >= -2147483648; {22172#true} is VALID [2022-02-21 03:03:06,148 INFO L272 TraceCheckUtils]: 8: Hoare triple {22172#true} call #t~ret0 := g(~x - 1); {22172#true} is VALID [2022-02-21 03:03:06,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {22172#true} ~x := #in~x; {22172#true} is VALID [2022-02-21 03:03:06,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {22172#true} assume 0 == ~x;#res := 1; {22235#(= |g_#res| 1)} is VALID [2022-02-21 03:03:06,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {22235#(= |g_#res| 1)} assume true; {22235#(= |g_#res| 1)} is VALID [2022-02-21 03:03:06,149 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {22235#(= |g_#res| 1)} {22172#true} #32#return; {22242#(= |g_#t~ret0| 1)} is VALID [2022-02-21 03:03:06,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {22242#(= |g_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {22242#(= |g_#t~ret0| 1)} is VALID [2022-02-21 03:03:06,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {22242#(= |g_#t~ret0| 1)} assume #t~ret0 - 1 <= 2147483647; {22242#(= |g_#t~ret0| 1)} is VALID [2022-02-21 03:03:06,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {22242#(= |g_#t~ret0| 1)} assume #t~ret0 - 1 >= -2147483648; {22242#(= |g_#t~ret0| 1)} is VALID [2022-02-21 03:03:06,150 INFO L272 TraceCheckUtils]: 16: Hoare triple {22242#(= |g_#t~ret0| 1)} call #t~ret1 := g(#t~ret0 - 1); {22255#(= |g_#in~x| 0)} is VALID [2022-02-21 03:03:06,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {22255#(= |g_#in~x| 0)} ~x := #in~x; {22259#(= g_~x 0)} is VALID [2022-02-21 03:03:06,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {22259#(= g_~x 0)} assume !(0 == ~x); {22173#false} is VALID [2022-02-21 03:03:06,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {22173#false} assume ~x - 1 <= 2147483647; {22173#false} is VALID [2022-02-21 03:03:06,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {22173#false} assume ~x - 1 >= -2147483648; {22173#false} is VALID [2022-02-21 03:03:06,151 INFO L272 TraceCheckUtils]: 21: Hoare triple {22173#false} call #t~ret0 := g(~x - 1); {22173#false} is VALID [2022-02-21 03:03:06,151 INFO L290 TraceCheckUtils]: 22: Hoare triple {22173#false} ~x := #in~x; {22173#false} is VALID [2022-02-21 03:03:06,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {22173#false} assume !(0 == ~x); {22173#false} is VALID [2022-02-21 03:03:06,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {22173#false} assume ~x - 1 <= 2147483647; {22173#false} is VALID [2022-02-21 03:03:06,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {22173#false} assume ~x - 1 >= -2147483648; {22173#false} is VALID [2022-02-21 03:03:06,152 INFO L272 TraceCheckUtils]: 26: Hoare triple {22173#false} call #t~ret0 := g(~x - 1); {22173#false} is VALID [2022-02-21 03:03:06,152 INFO L290 TraceCheckUtils]: 27: Hoare triple {22173#false} ~x := #in~x; {22173#false} is VALID [2022-02-21 03:03:06,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {22173#false} assume !(0 == ~x); {22173#false} is VALID [2022-02-21 03:03:06,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {22173#false} assume ~x - 1 <= 2147483647; {22173#false} is VALID [2022-02-21 03:03:06,152 INFO L290 TraceCheckUtils]: 30: Hoare triple {22173#false} assume ~x - 1 >= -2147483648; {22173#false} is VALID [2022-02-21 03:03:06,152 INFO L272 TraceCheckUtils]: 31: Hoare triple {22173#false} call #t~ret0 := g(~x - 1); {22173#false} is VALID [2022-02-21 03:03:06,152 INFO L290 TraceCheckUtils]: 32: Hoare triple {22173#false} ~x := #in~x; {22173#false} is VALID [2022-02-21 03:03:06,153 INFO L290 TraceCheckUtils]: 33: Hoare triple {22173#false} assume !(0 == ~x); {22173#false} is VALID [2022-02-21 03:03:06,153 INFO L290 TraceCheckUtils]: 34: Hoare triple {22173#false} assume ~x - 1 <= 2147483647; {22173#false} is VALID [2022-02-21 03:03:06,153 INFO L290 TraceCheckUtils]: 35: Hoare triple {22173#false} assume ~x - 1 >= -2147483648; {22173#false} is VALID [2022-02-21 03:03:06,153 INFO L272 TraceCheckUtils]: 36: Hoare triple {22173#false} call #t~ret0 := g(~x - 1); {22173#false} is VALID [2022-02-21 03:03:06,153 INFO L290 TraceCheckUtils]: 37: Hoare triple {22173#false} ~x := #in~x; {22173#false} is VALID [2022-02-21 03:03:06,153 INFO L290 TraceCheckUtils]: 38: Hoare triple {22173#false} assume !(0 == ~x); {22173#false} is VALID [2022-02-21 03:03:06,153 INFO L290 TraceCheckUtils]: 39: Hoare triple {22173#false} assume ~x - 1 <= 2147483647; {22173#false} is VALID [2022-02-21 03:03:06,153 INFO L290 TraceCheckUtils]: 40: Hoare triple {22173#false} assume ~x - 1 >= -2147483648; {22173#false} is VALID [2022-02-21 03:03:06,153 INFO L272 TraceCheckUtils]: 41: Hoare triple {22173#false} call #t~ret0 := g(~x - 1); {22173#false} is VALID [2022-02-21 03:03:06,154 INFO L290 TraceCheckUtils]: 42: Hoare triple {22173#false} ~x := #in~x; {22173#false} is VALID [2022-02-21 03:03:06,154 INFO L290 TraceCheckUtils]: 43: Hoare triple {22173#false} assume !(0 == ~x); {22173#false} is VALID [2022-02-21 03:03:06,154 INFO L290 TraceCheckUtils]: 44: Hoare triple {22173#false} assume ~x - 1 <= 2147483647; {22173#false} is VALID [2022-02-21 03:03:06,154 INFO L290 TraceCheckUtils]: 45: Hoare triple {22173#false} assume ~x - 1 >= -2147483648; {22173#false} is VALID [2022-02-21 03:03:06,154 INFO L272 TraceCheckUtils]: 46: Hoare triple {22173#false} call #t~ret0 := g(~x - 1); {22173#false} is VALID [2022-02-21 03:03:06,154 INFO L290 TraceCheckUtils]: 47: Hoare triple {22173#false} ~x := #in~x; {22173#false} is VALID [2022-02-21 03:03:06,154 INFO L290 TraceCheckUtils]: 48: Hoare triple {22173#false} assume !(0 == ~x); {22173#false} is VALID [2022-02-21 03:03:06,154 INFO L290 TraceCheckUtils]: 49: Hoare triple {22173#false} assume ~x - 1 <= 2147483647; {22173#false} is VALID [2022-02-21 03:03:06,155 INFO L290 TraceCheckUtils]: 50: Hoare triple {22173#false} assume ~x - 1 >= -2147483648; {22173#false} is VALID [2022-02-21 03:03:06,155 INFO L272 TraceCheckUtils]: 51: Hoare triple {22173#false} call #t~ret0 := g(~x - 1); {22173#false} is VALID [2022-02-21 03:03:06,155 INFO L290 TraceCheckUtils]: 52: Hoare triple {22173#false} ~x := #in~x; {22173#false} is VALID [2022-02-21 03:03:06,155 INFO L290 TraceCheckUtils]: 53: Hoare triple {22173#false} assume !(0 == ~x); {22173#false} is VALID [2022-02-21 03:03:06,155 INFO L290 TraceCheckUtils]: 54: Hoare triple {22173#false} assume ~x - 1 <= 2147483647; {22173#false} is VALID [2022-02-21 03:03:06,155 INFO L290 TraceCheckUtils]: 55: Hoare triple {22173#false} assume ~x - 1 >= -2147483648; {22173#false} is VALID [2022-02-21 03:03:06,155 INFO L272 TraceCheckUtils]: 56: Hoare triple {22173#false} call #t~ret0 := g(~x - 1); {22173#false} is VALID [2022-02-21 03:03:06,155 INFO L290 TraceCheckUtils]: 57: Hoare triple {22173#false} ~x := #in~x; {22173#false} is VALID [2022-02-21 03:03:06,155 INFO L290 TraceCheckUtils]: 58: Hoare triple {22173#false} assume !(0 == ~x); {22173#false} is VALID [2022-02-21 03:03:06,156 INFO L290 TraceCheckUtils]: 59: Hoare triple {22173#false} assume ~x - 1 <= 2147483647; {22173#false} is VALID [2022-02-21 03:03:06,156 INFO L290 TraceCheckUtils]: 60: Hoare triple {22173#false} assume ~x - 1 >= -2147483648; {22173#false} is VALID [2022-02-21 03:03:06,156 INFO L272 TraceCheckUtils]: 61: Hoare triple {22173#false} call #t~ret0 := g(~x - 1); {22173#false} is VALID [2022-02-21 03:03:06,156 INFO L290 TraceCheckUtils]: 62: Hoare triple {22173#false} ~x := #in~x; {22173#false} is VALID [2022-02-21 03:03:06,156 INFO L290 TraceCheckUtils]: 63: Hoare triple {22173#false} assume !(0 == ~x); {22173#false} is VALID [2022-02-21 03:03:06,156 INFO L290 TraceCheckUtils]: 64: Hoare triple {22173#false} assume ~x - 1 <= 2147483647; {22173#false} is VALID [2022-02-21 03:03:06,156 INFO L290 TraceCheckUtils]: 65: Hoare triple {22173#false} assume ~x - 1 >= -2147483648; {22173#false} is VALID [2022-02-21 03:03:06,156 INFO L272 TraceCheckUtils]: 66: Hoare triple {22173#false} call #t~ret0 := g(~x - 1); {22173#false} is VALID [2022-02-21 03:03:06,157 INFO L290 TraceCheckUtils]: 67: Hoare triple {22173#false} ~x := #in~x; {22173#false} is VALID [2022-02-21 03:03:06,157 INFO L290 TraceCheckUtils]: 68: Hoare triple {22173#false} assume !(0 == ~x); {22173#false} is VALID [2022-02-21 03:03:06,157 INFO L290 TraceCheckUtils]: 69: Hoare triple {22173#false} assume ~x - 1 <= 2147483647; {22173#false} is VALID [2022-02-21 03:03:06,157 INFO L290 TraceCheckUtils]: 70: Hoare triple {22173#false} assume !(~x - 1 >= -2147483648); {22173#false} is VALID [2022-02-21 03:03:06,157 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2022-02-21 03:03:06,157 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:03:06,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87315574] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:06,158 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:03:06,158 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [25] total 30 [2022-02-21 03:03:06,158 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650007493] [2022-02-21 03:03:06,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:06,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-02-21 03:03:06,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:06,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:03:06,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:06,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:03:06,176 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:06,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:03:06,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=679, Unknown=0, NotChecked=0, Total=870 [2022-02-21 03:03:06,177 INFO L87 Difference]: Start difference. First operand 410 states and 478 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:03:06,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:06,728 INFO L93 Difference]: Finished difference Result 940 states and 1197 transitions. [2022-02-21 03:03:06,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:03:06,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-02-21 03:03:06,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:06,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:03:06,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-02-21 03:03:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:03:06,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-02-21 03:03:06,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-02-21 03:03:06,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:06,781 INFO L225 Difference]: With dead ends: 940 [2022-02-21 03:03:06,782 INFO L226 Difference]: Without dead ends: 643 [2022-02-21 03:03:06,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2022-02-21 03:03:06,785 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:06,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 69 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:06,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2022-02-21 03:03:07,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 608. [2022-02-21 03:03:07,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:07,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 643 states. Second operand has 608 states, 440 states have (on average 1.0772727272727274) internal successors, (474), 472 states have internal predecessors, (474), 102 states have call successors, (102), 35 states have call predecessors, (102), 65 states have return successors, (133), 100 states have call predecessors, (133), 100 states have call successors, (133) [2022-02-21 03:03:07,085 INFO L74 IsIncluded]: Start isIncluded. First operand 643 states. Second operand has 608 states, 440 states have (on average 1.0772727272727274) internal successors, (474), 472 states have internal predecessors, (474), 102 states have call successors, (102), 35 states have call predecessors, (102), 65 states have return successors, (133), 100 states have call predecessors, (133), 100 states have call successors, (133) [2022-02-21 03:03:07,086 INFO L87 Difference]: Start difference. First operand 643 states. Second operand has 608 states, 440 states have (on average 1.0772727272727274) internal successors, (474), 472 states have internal predecessors, (474), 102 states have call successors, (102), 35 states have call predecessors, (102), 65 states have return successors, (133), 100 states have call predecessors, (133), 100 states have call successors, (133) [2022-02-21 03:03:07,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:07,109 INFO L93 Difference]: Finished difference Result 643 states and 776 transitions. [2022-02-21 03:03:07,109 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 776 transitions. [2022-02-21 03:03:07,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:07,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:07,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 608 states, 440 states have (on average 1.0772727272727274) internal successors, (474), 472 states have internal predecessors, (474), 102 states have call successors, (102), 35 states have call predecessors, (102), 65 states have return successors, (133), 100 states have call predecessors, (133), 100 states have call successors, (133) Second operand 643 states. [2022-02-21 03:03:07,113 INFO L87 Difference]: Start difference. First operand has 608 states, 440 states have (on average 1.0772727272727274) internal successors, (474), 472 states have internal predecessors, (474), 102 states have call successors, (102), 35 states have call predecessors, (102), 65 states have return successors, (133), 100 states have call predecessors, (133), 100 states have call successors, (133) Second operand 643 states. [2022-02-21 03:03:07,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:07,132 INFO L93 Difference]: Finished difference Result 643 states and 776 transitions. [2022-02-21 03:03:07,132 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 776 transitions. [2022-02-21 03:03:07,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:07,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:07,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:07,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:07,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 440 states have (on average 1.0772727272727274) internal successors, (474), 472 states have internal predecessors, (474), 102 states have call successors, (102), 35 states have call predecessors, (102), 65 states have return successors, (133), 100 states have call predecessors, (133), 100 states have call successors, (133) [2022-02-21 03:03:07,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 709 transitions. [2022-02-21 03:03:07,153 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 709 transitions. Word has length 71 [2022-02-21 03:03:07,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:07,154 INFO L470 AbstractCegarLoop]: Abstraction has 608 states and 709 transitions. [2022-02-21 03:03:07,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:03:07,154 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 709 transitions. [2022-02-21 03:03:07,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-02-21 03:03:07,156 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:07,156 INFO L514 BasicCegarLoop]: trace histogram [15, 13, 13, 12, 12, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:07,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:03:07,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-02-21 03:03:07,371 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:03:07,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:07,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1208023025, now seen corresponding path program 4 times [2022-02-21 03:03:07,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:07,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981334919] [2022-02-21 03:03:07,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:07,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:07,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:03:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:07,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 03:03:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:07,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {25589#true} ~x := #in~x; {25589#true} is VALID [2022-02-21 03:03:07,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {25589#true} assume 0 == ~x;#res := 1; {25589#true} is VALID [2022-02-21 03:03:07,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {25589#true} assume true; {25589#true} is VALID [2022-02-21 03:03:07,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25589#true} {25589#true} #32#return; {25589#true} is VALID [2022-02-21 03:03:07,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:03:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:07,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {25589#true} ~x := #in~x; {25589#true} is VALID [2022-02-21 03:03:07,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {25589#true} assume 0 == ~x;#res := 1; {25643#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:07,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {25643#(<= 1 |g_#res|)} assume true; {25643#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:07,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25643#(<= 1 |g_#res|)} {25589#true} #34#return; {25642#(<= 1 |g_#t~ret1|)} is VALID [2022-02-21 03:03:07,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {25589#true} ~x := #in~x; {25589#true} is VALID [2022-02-21 03:03:07,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {25589#true} assume !(0 == ~x); {25589#true} is VALID [2022-02-21 03:03:07,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {25589#true} assume ~x - 1 <= 2147483647; {25589#true} is VALID [2022-02-21 03:03:07,655 INFO L290 TraceCheckUtils]: 3: Hoare triple {25589#true} assume ~x - 1 >= -2147483648; {25589#true} is VALID [2022-02-21 03:03:07,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {25589#true} call #t~ret0 := g(~x - 1); {25589#true} is VALID [2022-02-21 03:03:07,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {25589#true} ~x := #in~x; {25589#true} is VALID [2022-02-21 03:03:07,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {25589#true} assume 0 == ~x;#res := 1; {25589#true} is VALID [2022-02-21 03:03:07,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {25589#true} assume true; {25589#true} is VALID [2022-02-21 03:03:07,655 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {25589#true} {25589#true} #32#return; {25589#true} is VALID [2022-02-21 03:03:07,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {25589#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {25589#true} is VALID [2022-02-21 03:03:07,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {25589#true} assume #t~ret0 - 1 <= 2147483647; {25589#true} is VALID [2022-02-21 03:03:07,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {25589#true} assume #t~ret0 - 1 >= -2147483648; {25589#true} is VALID [2022-02-21 03:03:07,656 INFO L272 TraceCheckUtils]: 12: Hoare triple {25589#true} call #t~ret1 := g(#t~ret0 - 1); {25589#true} is VALID [2022-02-21 03:03:07,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {25589#true} ~x := #in~x; {25589#true} is VALID [2022-02-21 03:03:07,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {25589#true} assume 0 == ~x;#res := 1; {25643#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:07,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {25643#(<= 1 |g_#res|)} assume true; {25643#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:07,657 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {25643#(<= 1 |g_#res|)} {25589#true} #34#return; {25642#(<= 1 |g_#t~ret1|)} is VALID [2022-02-21 03:03:07,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {25642#(<= 1 |g_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret0;havoc #t~ret1; {25643#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:07,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {25643#(<= 1 |g_#res|)} assume true; {25643#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:07,658 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {25643#(<= 1 |g_#res|)} {25589#true} #32#return; {25611#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:03:07,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {25589#true} assume { :begin_inline_ULTIMATE.init } true; {25589#true} is VALID [2022-02-21 03:03:07,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {25589#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {25589#true} is VALID [2022-02-21 03:03:07,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {25589#true} assume !(main_~x~0#1 < 0); {25589#true} is VALID [2022-02-21 03:03:07,667 INFO L272 TraceCheckUtils]: 3: Hoare triple {25589#true} call main_#t~ret3#1 := g(main_~x~0#1); {25589#true} is VALID [2022-02-21 03:03:07,667 INFO L290 TraceCheckUtils]: 4: Hoare triple {25589#true} ~x := #in~x; {25589#true} is VALID [2022-02-21 03:03:07,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {25589#true} assume !(0 == ~x); {25589#true} is VALID [2022-02-21 03:03:07,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {25589#true} assume ~x - 1 <= 2147483647; {25589#true} is VALID [2022-02-21 03:03:07,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {25589#true} assume ~x - 1 >= -2147483648; {25589#true} is VALID [2022-02-21 03:03:07,668 INFO L272 TraceCheckUtils]: 8: Hoare triple {25589#true} call #t~ret0 := g(~x - 1); {25589#true} is VALID [2022-02-21 03:03:07,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {25589#true} ~x := #in~x; {25589#true} is VALID [2022-02-21 03:03:07,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {25589#true} assume !(0 == ~x); {25589#true} is VALID [2022-02-21 03:03:07,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {25589#true} assume ~x - 1 <= 2147483647; {25589#true} is VALID [2022-02-21 03:03:07,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {25589#true} assume ~x - 1 >= -2147483648; {25589#true} is VALID [2022-02-21 03:03:07,668 INFO L272 TraceCheckUtils]: 13: Hoare triple {25589#true} call #t~ret0 := g(~x - 1); {25589#true} is VALID [2022-02-21 03:03:07,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {25589#true} ~x := #in~x; {25589#true} is VALID [2022-02-21 03:03:07,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {25589#true} assume 0 == ~x;#res := 1; {25589#true} is VALID [2022-02-21 03:03:07,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {25589#true} assume true; {25589#true} is VALID [2022-02-21 03:03:07,669 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {25589#true} {25589#true} #32#return; {25589#true} is VALID [2022-02-21 03:03:07,669 INFO L290 TraceCheckUtils]: 18: Hoare triple {25589#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {25589#true} is VALID [2022-02-21 03:03:07,669 INFO L290 TraceCheckUtils]: 19: Hoare triple {25589#true} assume #t~ret0 - 1 <= 2147483647; {25589#true} is VALID [2022-02-21 03:03:07,669 INFO L290 TraceCheckUtils]: 20: Hoare triple {25589#true} assume #t~ret0 - 1 >= -2147483648; {25589#true} is VALID [2022-02-21 03:03:07,669 INFO L272 TraceCheckUtils]: 21: Hoare triple {25589#true} call #t~ret1 := g(#t~ret0 - 1); {25589#true} is VALID [2022-02-21 03:03:07,669 INFO L290 TraceCheckUtils]: 22: Hoare triple {25589#true} ~x := #in~x; {25589#true} is VALID [2022-02-21 03:03:07,670 INFO L290 TraceCheckUtils]: 23: Hoare triple {25589#true} assume 0 == ~x;#res := 1; {25643#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:07,670 INFO L290 TraceCheckUtils]: 24: Hoare triple {25643#(<= 1 |g_#res|)} assume true; {25643#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:07,671 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {25643#(<= 1 |g_#res|)} {25589#true} #34#return; {25642#(<= 1 |g_#t~ret1|)} is VALID [2022-02-21 03:03:07,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {25642#(<= 1 |g_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret0;havoc #t~ret1; {25643#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:07,671 INFO L290 TraceCheckUtils]: 27: Hoare triple {25643#(<= 1 |g_#res|)} assume true; {25643#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:07,672 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {25643#(<= 1 |g_#res|)} {25589#true} #32#return; {25611#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:03:07,672 INFO L290 TraceCheckUtils]: 29: Hoare triple {25611#(<= 1 |g_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {25611#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:03:07,672 INFO L290 TraceCheckUtils]: 30: Hoare triple {25611#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 <= 2147483647; {25611#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:03:07,673 INFO L290 TraceCheckUtils]: 31: Hoare triple {25611#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 >= -2147483648; {25611#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:03:07,673 INFO L272 TraceCheckUtils]: 32: Hoare triple {25611#(<= 1 |g_#t~ret0|)} call #t~ret1 := g(#t~ret0 - 1); {25612#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:03:07,673 INFO L290 TraceCheckUtils]: 33: Hoare triple {25612#(<= 0 |g_#in~x|)} ~x := #in~x; {25613#(<= 0 g_~x)} is VALID [2022-02-21 03:03:07,674 INFO L290 TraceCheckUtils]: 34: Hoare triple {25613#(<= 0 g_~x)} assume !(0 == ~x); {25613#(<= 0 g_~x)} is VALID [2022-02-21 03:03:07,674 INFO L290 TraceCheckUtils]: 35: Hoare triple {25613#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {25613#(<= 0 g_~x)} is VALID [2022-02-21 03:03:07,674 INFO L290 TraceCheckUtils]: 36: Hoare triple {25613#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {25613#(<= 0 g_~x)} is VALID [2022-02-21 03:03:07,675 INFO L272 TraceCheckUtils]: 37: Hoare triple {25613#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {25614#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:03:07,675 INFO L290 TraceCheckUtils]: 38: Hoare triple {25614#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {25615#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:07,675 INFO L290 TraceCheckUtils]: 39: Hoare triple {25615#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {25615#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:07,675 INFO L290 TraceCheckUtils]: 40: Hoare triple {25615#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {25615#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:07,676 INFO L290 TraceCheckUtils]: 41: Hoare triple {25615#(<= 0 (+ g_~x 1))} assume ~x - 1 >= -2147483648; {25615#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:07,676 INFO L272 TraceCheckUtils]: 42: Hoare triple {25615#(<= 0 (+ g_~x 1))} call #t~ret0 := g(~x - 1); {25616#(<= 0 (+ |g_#in~x| 2))} is VALID [2022-02-21 03:03:07,677 INFO L290 TraceCheckUtils]: 43: Hoare triple {25616#(<= 0 (+ |g_#in~x| 2))} ~x := #in~x; {25617#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:07,677 INFO L290 TraceCheckUtils]: 44: Hoare triple {25617#(<= 0 (+ 2 g_~x))} assume !(0 == ~x); {25617#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:07,677 INFO L290 TraceCheckUtils]: 45: Hoare triple {25617#(<= 0 (+ 2 g_~x))} assume ~x - 1 <= 2147483647; {25617#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:07,677 INFO L290 TraceCheckUtils]: 46: Hoare triple {25617#(<= 0 (+ 2 g_~x))} assume ~x - 1 >= -2147483648; {25617#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:07,678 INFO L272 TraceCheckUtils]: 47: Hoare triple {25617#(<= 0 (+ 2 g_~x))} call #t~ret0 := g(~x - 1); {25618#(<= 0 (+ |g_#in~x| 3))} is VALID [2022-02-21 03:03:07,678 INFO L290 TraceCheckUtils]: 48: Hoare triple {25618#(<= 0 (+ |g_#in~x| 3))} ~x := #in~x; {25619#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:07,679 INFO L290 TraceCheckUtils]: 49: Hoare triple {25619#(<= 0 (+ 3 g_~x))} assume !(0 == ~x); {25619#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:07,679 INFO L290 TraceCheckUtils]: 50: Hoare triple {25619#(<= 0 (+ 3 g_~x))} assume ~x - 1 <= 2147483647; {25619#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:07,679 INFO L290 TraceCheckUtils]: 51: Hoare triple {25619#(<= 0 (+ 3 g_~x))} assume ~x - 1 >= -2147483648; {25619#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:07,680 INFO L272 TraceCheckUtils]: 52: Hoare triple {25619#(<= 0 (+ 3 g_~x))} call #t~ret0 := g(~x - 1); {25620#(<= 0 (+ |g_#in~x| 4))} is VALID [2022-02-21 03:03:07,680 INFO L290 TraceCheckUtils]: 53: Hoare triple {25620#(<= 0 (+ |g_#in~x| 4))} ~x := #in~x; {25621#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:07,680 INFO L290 TraceCheckUtils]: 54: Hoare triple {25621#(<= 0 (+ g_~x 4))} assume !(0 == ~x); {25621#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:07,680 INFO L290 TraceCheckUtils]: 55: Hoare triple {25621#(<= 0 (+ g_~x 4))} assume ~x - 1 <= 2147483647; {25621#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:07,681 INFO L290 TraceCheckUtils]: 56: Hoare triple {25621#(<= 0 (+ g_~x 4))} assume ~x - 1 >= -2147483648; {25621#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:07,681 INFO L272 TraceCheckUtils]: 57: Hoare triple {25621#(<= 0 (+ g_~x 4))} call #t~ret0 := g(~x - 1); {25622#(<= 0 (+ 5 |g_#in~x|))} is VALID [2022-02-21 03:03:07,682 INFO L290 TraceCheckUtils]: 58: Hoare triple {25622#(<= 0 (+ 5 |g_#in~x|))} ~x := #in~x; {25623#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:07,682 INFO L290 TraceCheckUtils]: 59: Hoare triple {25623#(<= 0 (+ 5 g_~x))} assume !(0 == ~x); {25623#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:07,682 INFO L290 TraceCheckUtils]: 60: Hoare triple {25623#(<= 0 (+ 5 g_~x))} assume ~x - 1 <= 2147483647; {25623#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:07,682 INFO L290 TraceCheckUtils]: 61: Hoare triple {25623#(<= 0 (+ 5 g_~x))} assume ~x - 1 >= -2147483648; {25623#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:07,683 INFO L272 TraceCheckUtils]: 62: Hoare triple {25623#(<= 0 (+ 5 g_~x))} call #t~ret0 := g(~x - 1); {25624#(<= 0 (+ |g_#in~x| 6))} is VALID [2022-02-21 03:03:07,683 INFO L290 TraceCheckUtils]: 63: Hoare triple {25624#(<= 0 (+ |g_#in~x| 6))} ~x := #in~x; {25625#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:07,684 INFO L290 TraceCheckUtils]: 64: Hoare triple {25625#(<= 0 (+ 6 g_~x))} assume !(0 == ~x); {25625#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:07,684 INFO L290 TraceCheckUtils]: 65: Hoare triple {25625#(<= 0 (+ 6 g_~x))} assume ~x - 1 <= 2147483647; {25625#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:07,684 INFO L290 TraceCheckUtils]: 66: Hoare triple {25625#(<= 0 (+ 6 g_~x))} assume ~x - 1 >= -2147483648; {25625#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:07,685 INFO L272 TraceCheckUtils]: 67: Hoare triple {25625#(<= 0 (+ 6 g_~x))} call #t~ret0 := g(~x - 1); {25626#(<= 0 (+ 7 |g_#in~x|))} is VALID [2022-02-21 03:03:07,685 INFO L290 TraceCheckUtils]: 68: Hoare triple {25626#(<= 0 (+ 7 |g_#in~x|))} ~x := #in~x; {25627#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:07,685 INFO L290 TraceCheckUtils]: 69: Hoare triple {25627#(<= 0 (+ 7 g_~x))} assume !(0 == ~x); {25627#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:07,686 INFO L290 TraceCheckUtils]: 70: Hoare triple {25627#(<= 0 (+ 7 g_~x))} assume ~x - 1 <= 2147483647; {25627#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:07,686 INFO L290 TraceCheckUtils]: 71: Hoare triple {25627#(<= 0 (+ 7 g_~x))} assume ~x - 1 >= -2147483648; {25627#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:07,686 INFO L272 TraceCheckUtils]: 72: Hoare triple {25627#(<= 0 (+ 7 g_~x))} call #t~ret0 := g(~x - 1); {25628#(<= 0 (+ |g_#in~x| 8))} is VALID [2022-02-21 03:03:07,687 INFO L290 TraceCheckUtils]: 73: Hoare triple {25628#(<= 0 (+ |g_#in~x| 8))} ~x := #in~x; {25629#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:07,687 INFO L290 TraceCheckUtils]: 74: Hoare triple {25629#(<= 0 (+ g_~x 8))} assume !(0 == ~x); {25629#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:07,687 INFO L290 TraceCheckUtils]: 75: Hoare triple {25629#(<= 0 (+ g_~x 8))} assume ~x - 1 <= 2147483647; {25629#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:07,688 INFO L290 TraceCheckUtils]: 76: Hoare triple {25629#(<= 0 (+ g_~x 8))} assume ~x - 1 >= -2147483648; {25629#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:07,688 INFO L272 TraceCheckUtils]: 77: Hoare triple {25629#(<= 0 (+ g_~x 8))} call #t~ret0 := g(~x - 1); {25630#(<= 0 (+ |g_#in~x| 9))} is VALID [2022-02-21 03:03:07,688 INFO L290 TraceCheckUtils]: 78: Hoare triple {25630#(<= 0 (+ |g_#in~x| 9))} ~x := #in~x; {25631#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:07,689 INFO L290 TraceCheckUtils]: 79: Hoare triple {25631#(<= 0 (+ 9 g_~x))} assume !(0 == ~x); {25631#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:07,689 INFO L290 TraceCheckUtils]: 80: Hoare triple {25631#(<= 0 (+ 9 g_~x))} assume ~x - 1 <= 2147483647; {25631#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:07,689 INFO L290 TraceCheckUtils]: 81: Hoare triple {25631#(<= 0 (+ 9 g_~x))} assume ~x - 1 >= -2147483648; {25631#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:07,690 INFO L272 TraceCheckUtils]: 82: Hoare triple {25631#(<= 0 (+ 9 g_~x))} call #t~ret0 := g(~x - 1); {25632#(<= 0 (+ |g_#in~x| 10))} is VALID [2022-02-21 03:03:07,690 INFO L290 TraceCheckUtils]: 83: Hoare triple {25632#(<= 0 (+ |g_#in~x| 10))} ~x := #in~x; {25633#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:07,690 INFO L290 TraceCheckUtils]: 84: Hoare triple {25633#(<= 0 (+ g_~x 10))} assume !(0 == ~x); {25633#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:07,691 INFO L290 TraceCheckUtils]: 85: Hoare triple {25633#(<= 0 (+ g_~x 10))} assume ~x - 1 <= 2147483647; {25633#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:07,691 INFO L290 TraceCheckUtils]: 86: Hoare triple {25633#(<= 0 (+ g_~x 10))} assume !(~x - 1 >= -2147483648); {25590#false} is VALID [2022-02-21 03:03:07,692 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 160 proven. 265 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-02-21 03:03:07,692 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:07,692 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981334919] [2022-02-21 03:03:07,692 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981334919] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:07,692 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441107659] [2022-02-21 03:03:07,693 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-21 03:03:07,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:07,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:07,696 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:03:07,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-21 03:03:07,739 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-21 03:03:07,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:03:07,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-21 03:03:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:07,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:08,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {25589#true} assume { :begin_inline_ULTIMATE.init } true; {25589#true} is VALID [2022-02-21 03:03:08,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {25589#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {25589#true} is VALID [2022-02-21 03:03:08,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {25589#true} assume !(main_~x~0#1 < 0); {25589#true} is VALID [2022-02-21 03:03:08,192 INFO L272 TraceCheckUtils]: 3: Hoare triple {25589#true} call main_#t~ret3#1 := g(main_~x~0#1); {25589#true} is VALID [2022-02-21 03:03:08,192 INFO L290 TraceCheckUtils]: 4: Hoare triple {25589#true} ~x := #in~x; {25589#true} is VALID [2022-02-21 03:03:08,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {25589#true} assume !(0 == ~x); {25589#true} is VALID [2022-02-21 03:03:08,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {25589#true} assume ~x - 1 <= 2147483647; {25589#true} is VALID [2022-02-21 03:03:08,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {25589#true} assume ~x - 1 >= -2147483648; {25589#true} is VALID [2022-02-21 03:03:08,193 INFO L272 TraceCheckUtils]: 8: Hoare triple {25589#true} call #t~ret0 := g(~x - 1); {25589#true} is VALID [2022-02-21 03:03:08,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {25589#true} ~x := #in~x; {25589#true} is VALID [2022-02-21 03:03:08,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {25589#true} assume !(0 == ~x); {25589#true} is VALID [2022-02-21 03:03:08,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {25589#true} assume ~x - 1 <= 2147483647; {25589#true} is VALID [2022-02-21 03:03:08,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {25589#true} assume ~x - 1 >= -2147483648; {25589#true} is VALID [2022-02-21 03:03:08,193 INFO L272 TraceCheckUtils]: 13: Hoare triple {25589#true} call #t~ret0 := g(~x - 1); {25589#true} is VALID [2022-02-21 03:03:08,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {25589#true} ~x := #in~x; {25589#true} is VALID [2022-02-21 03:03:08,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {25589#true} assume 0 == ~x;#res := 1; {25589#true} is VALID [2022-02-21 03:03:08,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {25589#true} assume true; {25589#true} is VALID [2022-02-21 03:03:08,193 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {25589#true} {25589#true} #32#return; {25589#true} is VALID [2022-02-21 03:03:08,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {25589#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {25589#true} is VALID [2022-02-21 03:03:08,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {25589#true} assume #t~ret0 - 1 <= 2147483647; {25589#true} is VALID [2022-02-21 03:03:08,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {25589#true} assume #t~ret0 - 1 >= -2147483648; {25589#true} is VALID [2022-02-21 03:03:08,193 INFO L272 TraceCheckUtils]: 21: Hoare triple {25589#true} call #t~ret1 := g(#t~ret0 - 1); {25589#true} is VALID [2022-02-21 03:03:08,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {25589#true} ~x := #in~x; {25589#true} is VALID [2022-02-21 03:03:08,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {25589#true} assume 0 == ~x;#res := 1; {25643#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:08,194 INFO L290 TraceCheckUtils]: 24: Hoare triple {25643#(<= 1 |g_#res|)} assume true; {25643#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:08,195 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {25643#(<= 1 |g_#res|)} {25589#true} #34#return; {25642#(<= 1 |g_#t~ret1|)} is VALID [2022-02-21 03:03:08,195 INFO L290 TraceCheckUtils]: 26: Hoare triple {25642#(<= 1 |g_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret0;havoc #t~ret1; {25643#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:08,195 INFO L290 TraceCheckUtils]: 27: Hoare triple {25643#(<= 1 |g_#res|)} assume true; {25643#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:08,196 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {25643#(<= 1 |g_#res|)} {25589#true} #32#return; {25611#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:03:08,196 INFO L290 TraceCheckUtils]: 29: Hoare triple {25611#(<= 1 |g_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {25611#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:03:08,196 INFO L290 TraceCheckUtils]: 30: Hoare triple {25611#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 <= 2147483647; {25611#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:03:08,197 INFO L290 TraceCheckUtils]: 31: Hoare triple {25611#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 >= -2147483648; {25611#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:03:08,197 INFO L272 TraceCheckUtils]: 32: Hoare triple {25611#(<= 1 |g_#t~ret0|)} call #t~ret1 := g(#t~ret0 - 1); {25612#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:03:08,198 INFO L290 TraceCheckUtils]: 33: Hoare triple {25612#(<= 0 |g_#in~x|)} ~x := #in~x; {25613#(<= 0 g_~x)} is VALID [2022-02-21 03:03:08,198 INFO L290 TraceCheckUtils]: 34: Hoare triple {25613#(<= 0 g_~x)} assume !(0 == ~x); {25613#(<= 0 g_~x)} is VALID [2022-02-21 03:03:08,198 INFO L290 TraceCheckUtils]: 35: Hoare triple {25613#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {25613#(<= 0 g_~x)} is VALID [2022-02-21 03:03:08,198 INFO L290 TraceCheckUtils]: 36: Hoare triple {25613#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {25613#(<= 0 g_~x)} is VALID [2022-02-21 03:03:08,199 INFO L272 TraceCheckUtils]: 37: Hoare triple {25613#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {25614#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:03:08,199 INFO L290 TraceCheckUtils]: 38: Hoare triple {25614#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {25615#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:08,200 INFO L290 TraceCheckUtils]: 39: Hoare triple {25615#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {25615#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:08,200 INFO L290 TraceCheckUtils]: 40: Hoare triple {25615#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {25615#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:08,200 INFO L290 TraceCheckUtils]: 41: Hoare triple {25615#(<= 0 (+ g_~x 1))} assume ~x - 1 >= -2147483648; {25615#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:08,201 INFO L272 TraceCheckUtils]: 42: Hoare triple {25615#(<= 0 (+ g_~x 1))} call #t~ret0 := g(~x - 1); {25616#(<= 0 (+ |g_#in~x| 2))} is VALID [2022-02-21 03:03:08,201 INFO L290 TraceCheckUtils]: 43: Hoare triple {25616#(<= 0 (+ |g_#in~x| 2))} ~x := #in~x; {25617#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:08,201 INFO L290 TraceCheckUtils]: 44: Hoare triple {25617#(<= 0 (+ 2 g_~x))} assume !(0 == ~x); {25617#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:08,201 INFO L290 TraceCheckUtils]: 45: Hoare triple {25617#(<= 0 (+ 2 g_~x))} assume ~x - 1 <= 2147483647; {25617#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:08,202 INFO L290 TraceCheckUtils]: 46: Hoare triple {25617#(<= 0 (+ 2 g_~x))} assume ~x - 1 >= -2147483648; {25617#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:08,202 INFO L272 TraceCheckUtils]: 47: Hoare triple {25617#(<= 0 (+ 2 g_~x))} call #t~ret0 := g(~x - 1); {25618#(<= 0 (+ |g_#in~x| 3))} is VALID [2022-02-21 03:03:08,203 INFO L290 TraceCheckUtils]: 48: Hoare triple {25618#(<= 0 (+ |g_#in~x| 3))} ~x := #in~x; {25619#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:08,203 INFO L290 TraceCheckUtils]: 49: Hoare triple {25619#(<= 0 (+ 3 g_~x))} assume !(0 == ~x); {25619#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:08,203 INFO L290 TraceCheckUtils]: 50: Hoare triple {25619#(<= 0 (+ 3 g_~x))} assume ~x - 1 <= 2147483647; {25619#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:08,203 INFO L290 TraceCheckUtils]: 51: Hoare triple {25619#(<= 0 (+ 3 g_~x))} assume ~x - 1 >= -2147483648; {25619#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:08,204 INFO L272 TraceCheckUtils]: 52: Hoare triple {25619#(<= 0 (+ 3 g_~x))} call #t~ret0 := g(~x - 1); {25620#(<= 0 (+ |g_#in~x| 4))} is VALID [2022-02-21 03:03:08,204 INFO L290 TraceCheckUtils]: 53: Hoare triple {25620#(<= 0 (+ |g_#in~x| 4))} ~x := #in~x; {25621#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:08,205 INFO L290 TraceCheckUtils]: 54: Hoare triple {25621#(<= 0 (+ g_~x 4))} assume !(0 == ~x); {25621#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:08,205 INFO L290 TraceCheckUtils]: 55: Hoare triple {25621#(<= 0 (+ g_~x 4))} assume ~x - 1 <= 2147483647; {25621#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:08,205 INFO L290 TraceCheckUtils]: 56: Hoare triple {25621#(<= 0 (+ g_~x 4))} assume ~x - 1 >= -2147483648; {25621#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:08,206 INFO L272 TraceCheckUtils]: 57: Hoare triple {25621#(<= 0 (+ g_~x 4))} call #t~ret0 := g(~x - 1); {25622#(<= 0 (+ 5 |g_#in~x|))} is VALID [2022-02-21 03:03:08,206 INFO L290 TraceCheckUtils]: 58: Hoare triple {25622#(<= 0 (+ 5 |g_#in~x|))} ~x := #in~x; {25623#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:08,206 INFO L290 TraceCheckUtils]: 59: Hoare triple {25623#(<= 0 (+ 5 g_~x))} assume !(0 == ~x); {25623#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:08,207 INFO L290 TraceCheckUtils]: 60: Hoare triple {25623#(<= 0 (+ 5 g_~x))} assume ~x - 1 <= 2147483647; {25623#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:08,207 INFO L290 TraceCheckUtils]: 61: Hoare triple {25623#(<= 0 (+ 5 g_~x))} assume ~x - 1 >= -2147483648; {25623#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:08,207 INFO L272 TraceCheckUtils]: 62: Hoare triple {25623#(<= 0 (+ 5 g_~x))} call #t~ret0 := g(~x - 1); {25624#(<= 0 (+ |g_#in~x| 6))} is VALID [2022-02-21 03:03:08,208 INFO L290 TraceCheckUtils]: 63: Hoare triple {25624#(<= 0 (+ |g_#in~x| 6))} ~x := #in~x; {25625#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:08,208 INFO L290 TraceCheckUtils]: 64: Hoare triple {25625#(<= 0 (+ 6 g_~x))} assume !(0 == ~x); {25625#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:08,208 INFO L290 TraceCheckUtils]: 65: Hoare triple {25625#(<= 0 (+ 6 g_~x))} assume ~x - 1 <= 2147483647; {25625#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:08,209 INFO L290 TraceCheckUtils]: 66: Hoare triple {25625#(<= 0 (+ 6 g_~x))} assume ~x - 1 >= -2147483648; {25625#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:08,209 INFO L272 TraceCheckUtils]: 67: Hoare triple {25625#(<= 0 (+ 6 g_~x))} call #t~ret0 := g(~x - 1); {25626#(<= 0 (+ 7 |g_#in~x|))} is VALID [2022-02-21 03:03:08,210 INFO L290 TraceCheckUtils]: 68: Hoare triple {25626#(<= 0 (+ 7 |g_#in~x|))} ~x := #in~x; {25627#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:08,210 INFO L290 TraceCheckUtils]: 69: Hoare triple {25627#(<= 0 (+ 7 g_~x))} assume !(0 == ~x); {25627#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:08,210 INFO L290 TraceCheckUtils]: 70: Hoare triple {25627#(<= 0 (+ 7 g_~x))} assume ~x - 1 <= 2147483647; {25627#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:08,211 INFO L290 TraceCheckUtils]: 71: Hoare triple {25627#(<= 0 (+ 7 g_~x))} assume ~x - 1 >= -2147483648; {25627#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:08,211 INFO L272 TraceCheckUtils]: 72: Hoare triple {25627#(<= 0 (+ 7 g_~x))} call #t~ret0 := g(~x - 1); {25628#(<= 0 (+ |g_#in~x| 8))} is VALID [2022-02-21 03:03:08,212 INFO L290 TraceCheckUtils]: 73: Hoare triple {25628#(<= 0 (+ |g_#in~x| 8))} ~x := #in~x; {25629#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:08,212 INFO L290 TraceCheckUtils]: 74: Hoare triple {25629#(<= 0 (+ g_~x 8))} assume !(0 == ~x); {25629#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:08,212 INFO L290 TraceCheckUtils]: 75: Hoare triple {25629#(<= 0 (+ g_~x 8))} assume ~x - 1 <= 2147483647; {25629#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:08,212 INFO L290 TraceCheckUtils]: 76: Hoare triple {25629#(<= 0 (+ g_~x 8))} assume ~x - 1 >= -2147483648; {25629#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:08,213 INFO L272 TraceCheckUtils]: 77: Hoare triple {25629#(<= 0 (+ g_~x 8))} call #t~ret0 := g(~x - 1); {25630#(<= 0 (+ |g_#in~x| 9))} is VALID [2022-02-21 03:03:08,213 INFO L290 TraceCheckUtils]: 78: Hoare triple {25630#(<= 0 (+ |g_#in~x| 9))} ~x := #in~x; {25631#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:08,214 INFO L290 TraceCheckUtils]: 79: Hoare triple {25631#(<= 0 (+ 9 g_~x))} assume !(0 == ~x); {25631#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:08,214 INFO L290 TraceCheckUtils]: 80: Hoare triple {25631#(<= 0 (+ 9 g_~x))} assume ~x - 1 <= 2147483647; {25631#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:08,230 INFO L290 TraceCheckUtils]: 81: Hoare triple {25631#(<= 0 (+ 9 g_~x))} assume ~x - 1 >= -2147483648; {25631#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:08,231 INFO L272 TraceCheckUtils]: 82: Hoare triple {25631#(<= 0 (+ 9 g_~x))} call #t~ret0 := g(~x - 1); {25632#(<= 0 (+ |g_#in~x| 10))} is VALID [2022-02-21 03:03:08,231 INFO L290 TraceCheckUtils]: 83: Hoare triple {25632#(<= 0 (+ |g_#in~x| 10))} ~x := #in~x; {25633#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:08,232 INFO L290 TraceCheckUtils]: 84: Hoare triple {25633#(<= 0 (+ g_~x 10))} assume !(0 == ~x); {25633#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:08,232 INFO L290 TraceCheckUtils]: 85: Hoare triple {25633#(<= 0 (+ g_~x 10))} assume ~x - 1 <= 2147483647; {25633#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:08,233 INFO L290 TraceCheckUtils]: 86: Hoare triple {25633#(<= 0 (+ g_~x 10))} assume !(~x - 1 >= -2147483648); {25590#false} is VALID [2022-02-21 03:03:08,233 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 160 proven. 265 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-02-21 03:03:08,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:09,228 INFO L290 TraceCheckUtils]: 86: Hoare triple {25905#(<= 0 (+ 2147483647 g_~x))} assume !(~x - 1 >= -2147483648); {25590#false} is VALID [2022-02-21 03:03:09,229 INFO L290 TraceCheckUtils]: 85: Hoare triple {25905#(<= 0 (+ 2147483647 g_~x))} assume ~x - 1 <= 2147483647; {25905#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:03:09,229 INFO L290 TraceCheckUtils]: 84: Hoare triple {25905#(<= 0 (+ 2147483647 g_~x))} assume !(0 == ~x); {25905#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:03:09,230 INFO L290 TraceCheckUtils]: 83: Hoare triple {25915#(<= 0 (+ 2147483647 |g_#in~x|))} ~x := #in~x; {25905#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:03:09,230 INFO L272 TraceCheckUtils]: 82: Hoare triple {25919#(<= 0 (+ g_~x 2147483646))} call #t~ret0 := g(~x - 1); {25915#(<= 0 (+ 2147483647 |g_#in~x|))} is VALID [2022-02-21 03:03:09,230 INFO L290 TraceCheckUtils]: 81: Hoare triple {25919#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 >= -2147483648; {25919#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:03:09,231 INFO L290 TraceCheckUtils]: 80: Hoare triple {25919#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 <= 2147483647; {25919#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:03:09,231 INFO L290 TraceCheckUtils]: 79: Hoare triple {25919#(<= 0 (+ g_~x 2147483646))} assume !(0 == ~x); {25919#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:03:09,231 INFO L290 TraceCheckUtils]: 78: Hoare triple {25932#(<= 0 (+ |g_#in~x| 2147483646))} ~x := #in~x; {25919#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:03:09,232 INFO L272 TraceCheckUtils]: 77: Hoare triple {25936#(<= 0 (+ 2147483645 g_~x))} call #t~ret0 := g(~x - 1); {25932#(<= 0 (+ |g_#in~x| 2147483646))} is VALID [2022-02-21 03:03:09,232 INFO L290 TraceCheckUtils]: 76: Hoare triple {25936#(<= 0 (+ 2147483645 g_~x))} assume ~x - 1 >= -2147483648; {25936#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:03:09,232 INFO L290 TraceCheckUtils]: 75: Hoare triple {25936#(<= 0 (+ 2147483645 g_~x))} assume ~x - 1 <= 2147483647; {25936#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:03:09,232 INFO L290 TraceCheckUtils]: 74: Hoare triple {25936#(<= 0 (+ 2147483645 g_~x))} assume !(0 == ~x); {25936#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:03:09,233 INFO L290 TraceCheckUtils]: 73: Hoare triple {25949#(<= 0 (+ 2147483645 |g_#in~x|))} ~x := #in~x; {25936#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:03:09,233 INFO L272 TraceCheckUtils]: 72: Hoare triple {25953#(<= 0 (+ g_~x 2147483644))} call #t~ret0 := g(~x - 1); {25949#(<= 0 (+ 2147483645 |g_#in~x|))} is VALID [2022-02-21 03:03:09,234 INFO L290 TraceCheckUtils]: 71: Hoare triple {25953#(<= 0 (+ g_~x 2147483644))} assume ~x - 1 >= -2147483648; {25953#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:03:09,234 INFO L290 TraceCheckUtils]: 70: Hoare triple {25953#(<= 0 (+ g_~x 2147483644))} assume ~x - 1 <= 2147483647; {25953#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:03:09,234 INFO L290 TraceCheckUtils]: 69: Hoare triple {25953#(<= 0 (+ g_~x 2147483644))} assume !(0 == ~x); {25953#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:03:09,234 INFO L290 TraceCheckUtils]: 68: Hoare triple {25966#(<= 0 (+ |g_#in~x| 2147483644))} ~x := #in~x; {25953#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:03:09,236 INFO L272 TraceCheckUtils]: 67: Hoare triple {25970#(<= 0 (+ 2147483643 g_~x))} call #t~ret0 := g(~x - 1); {25966#(<= 0 (+ |g_#in~x| 2147483644))} is VALID [2022-02-21 03:03:09,237 INFO L290 TraceCheckUtils]: 66: Hoare triple {25970#(<= 0 (+ 2147483643 g_~x))} assume ~x - 1 >= -2147483648; {25970#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:03:09,237 INFO L290 TraceCheckUtils]: 65: Hoare triple {25970#(<= 0 (+ 2147483643 g_~x))} assume ~x - 1 <= 2147483647; {25970#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:03:09,237 INFO L290 TraceCheckUtils]: 64: Hoare triple {25970#(<= 0 (+ 2147483643 g_~x))} assume !(0 == ~x); {25970#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:03:09,238 INFO L290 TraceCheckUtils]: 63: Hoare triple {25983#(<= 0 (+ 2147483643 |g_#in~x|))} ~x := #in~x; {25970#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:03:09,238 INFO L272 TraceCheckUtils]: 62: Hoare triple {25987#(<= 0 (+ g_~x 2147483642))} call #t~ret0 := g(~x - 1); {25983#(<= 0 (+ 2147483643 |g_#in~x|))} is VALID [2022-02-21 03:03:09,238 INFO L290 TraceCheckUtils]: 61: Hoare triple {25987#(<= 0 (+ g_~x 2147483642))} assume ~x - 1 >= -2147483648; {25987#(<= 0 (+ g_~x 2147483642))} is VALID [2022-02-21 03:03:09,239 INFO L290 TraceCheckUtils]: 60: Hoare triple {25987#(<= 0 (+ g_~x 2147483642))} assume ~x - 1 <= 2147483647; {25987#(<= 0 (+ g_~x 2147483642))} is VALID [2022-02-21 03:03:09,239 INFO L290 TraceCheckUtils]: 59: Hoare triple {25987#(<= 0 (+ g_~x 2147483642))} assume !(0 == ~x); {25987#(<= 0 (+ g_~x 2147483642))} is VALID [2022-02-21 03:03:09,239 INFO L290 TraceCheckUtils]: 58: Hoare triple {26000#(<= 0 (+ |g_#in~x| 2147483642))} ~x := #in~x; {25987#(<= 0 (+ g_~x 2147483642))} is VALID [2022-02-21 03:03:09,240 INFO L272 TraceCheckUtils]: 57: Hoare triple {26004#(<= 0 (+ g_~x 2147483641))} call #t~ret0 := g(~x - 1); {26000#(<= 0 (+ |g_#in~x| 2147483642))} is VALID [2022-02-21 03:03:09,242 INFO L290 TraceCheckUtils]: 56: Hoare triple {26004#(<= 0 (+ g_~x 2147483641))} assume ~x - 1 >= -2147483648; {26004#(<= 0 (+ g_~x 2147483641))} is VALID [2022-02-21 03:03:09,242 INFO L290 TraceCheckUtils]: 55: Hoare triple {26004#(<= 0 (+ g_~x 2147483641))} assume ~x - 1 <= 2147483647; {26004#(<= 0 (+ g_~x 2147483641))} is VALID [2022-02-21 03:03:09,245 INFO L290 TraceCheckUtils]: 54: Hoare triple {26004#(<= 0 (+ g_~x 2147483641))} assume !(0 == ~x); {26004#(<= 0 (+ g_~x 2147483641))} is VALID [2022-02-21 03:03:09,245 INFO L290 TraceCheckUtils]: 53: Hoare triple {26017#(<= 0 (+ |g_#in~x| 2147483641))} ~x := #in~x; {26004#(<= 0 (+ g_~x 2147483641))} is VALID [2022-02-21 03:03:09,246 INFO L272 TraceCheckUtils]: 52: Hoare triple {26021#(<= 0 (+ g_~x 2147483640))} call #t~ret0 := g(~x - 1); {26017#(<= 0 (+ |g_#in~x| 2147483641))} is VALID [2022-02-21 03:03:09,246 INFO L290 TraceCheckUtils]: 51: Hoare triple {26021#(<= 0 (+ g_~x 2147483640))} assume ~x - 1 >= -2147483648; {26021#(<= 0 (+ g_~x 2147483640))} is VALID [2022-02-21 03:03:09,247 INFO L290 TraceCheckUtils]: 50: Hoare triple {26021#(<= 0 (+ g_~x 2147483640))} assume ~x - 1 <= 2147483647; {26021#(<= 0 (+ g_~x 2147483640))} is VALID [2022-02-21 03:03:09,247 INFO L290 TraceCheckUtils]: 49: Hoare triple {26021#(<= 0 (+ g_~x 2147483640))} assume !(0 == ~x); {26021#(<= 0 (+ g_~x 2147483640))} is VALID [2022-02-21 03:03:09,247 INFO L290 TraceCheckUtils]: 48: Hoare triple {26034#(<= 0 (+ |g_#in~x| 2147483640))} ~x := #in~x; {26021#(<= 0 (+ g_~x 2147483640))} is VALID [2022-02-21 03:03:09,248 INFO L272 TraceCheckUtils]: 47: Hoare triple {26038#(<= 0 (+ g_~x 2147483639))} call #t~ret0 := g(~x - 1); {26034#(<= 0 (+ |g_#in~x| 2147483640))} is VALID [2022-02-21 03:03:09,248 INFO L290 TraceCheckUtils]: 46: Hoare triple {26038#(<= 0 (+ g_~x 2147483639))} assume ~x - 1 >= -2147483648; {26038#(<= 0 (+ g_~x 2147483639))} is VALID [2022-02-21 03:03:09,248 INFO L290 TraceCheckUtils]: 45: Hoare triple {26038#(<= 0 (+ g_~x 2147483639))} assume ~x - 1 <= 2147483647; {26038#(<= 0 (+ g_~x 2147483639))} is VALID [2022-02-21 03:03:09,248 INFO L290 TraceCheckUtils]: 44: Hoare triple {26038#(<= 0 (+ g_~x 2147483639))} assume !(0 == ~x); {26038#(<= 0 (+ g_~x 2147483639))} is VALID [2022-02-21 03:03:09,249 INFO L290 TraceCheckUtils]: 43: Hoare triple {26051#(<= 0 (+ |g_#in~x| 2147483639))} ~x := #in~x; {26038#(<= 0 (+ g_~x 2147483639))} is VALID [2022-02-21 03:03:09,249 INFO L272 TraceCheckUtils]: 42: Hoare triple {26055#(<= 0 (+ 2147483638 g_~x))} call #t~ret0 := g(~x - 1); {26051#(<= 0 (+ |g_#in~x| 2147483639))} is VALID [2022-02-21 03:03:09,249 INFO L290 TraceCheckUtils]: 41: Hoare triple {26055#(<= 0 (+ 2147483638 g_~x))} assume ~x - 1 >= -2147483648; {26055#(<= 0 (+ 2147483638 g_~x))} is VALID [2022-02-21 03:03:09,250 INFO L290 TraceCheckUtils]: 40: Hoare triple {26055#(<= 0 (+ 2147483638 g_~x))} assume ~x - 1 <= 2147483647; {26055#(<= 0 (+ 2147483638 g_~x))} is VALID [2022-02-21 03:03:09,250 INFO L290 TraceCheckUtils]: 39: Hoare triple {26055#(<= 0 (+ 2147483638 g_~x))} assume !(0 == ~x); {26055#(<= 0 (+ 2147483638 g_~x))} is VALID [2022-02-21 03:03:09,250 INFO L290 TraceCheckUtils]: 38: Hoare triple {26068#(<= 0 (+ 2147483638 |g_#in~x|))} ~x := #in~x; {26055#(<= 0 (+ 2147483638 g_~x))} is VALID [2022-02-21 03:03:09,251 INFO L272 TraceCheckUtils]: 37: Hoare triple {26072#(<= 0 (+ g_~x 2147483637))} call #t~ret0 := g(~x - 1); {26068#(<= 0 (+ 2147483638 |g_#in~x|))} is VALID [2022-02-21 03:03:09,251 INFO L290 TraceCheckUtils]: 36: Hoare triple {26072#(<= 0 (+ g_~x 2147483637))} assume ~x - 1 >= -2147483648; {26072#(<= 0 (+ g_~x 2147483637))} is VALID [2022-02-21 03:03:09,252 INFO L290 TraceCheckUtils]: 35: Hoare triple {26072#(<= 0 (+ g_~x 2147483637))} assume ~x - 1 <= 2147483647; {26072#(<= 0 (+ g_~x 2147483637))} is VALID [2022-02-21 03:03:09,252 INFO L290 TraceCheckUtils]: 34: Hoare triple {26072#(<= 0 (+ g_~x 2147483637))} assume !(0 == ~x); {26072#(<= 0 (+ g_~x 2147483637))} is VALID [2022-02-21 03:03:09,252 INFO L290 TraceCheckUtils]: 33: Hoare triple {26085#(<= 0 (+ |g_#in~x| 2147483637))} ~x := #in~x; {26072#(<= 0 (+ g_~x 2147483637))} is VALID [2022-02-21 03:03:09,253 INFO L272 TraceCheckUtils]: 32: Hoare triple {26089#(<= 0 (+ |g_#t~ret0| 2147483636))} call #t~ret1 := g(#t~ret0 - 1); {26085#(<= 0 (+ |g_#in~x| 2147483637))} is VALID [2022-02-21 03:03:09,253 INFO L290 TraceCheckUtils]: 31: Hoare triple {26089#(<= 0 (+ |g_#t~ret0| 2147483636))} assume #t~ret0 - 1 >= -2147483648; {26089#(<= 0 (+ |g_#t~ret0| 2147483636))} is VALID [2022-02-21 03:03:09,253 INFO L290 TraceCheckUtils]: 30: Hoare triple {26089#(<= 0 (+ |g_#t~ret0| 2147483636))} assume #t~ret0 - 1 <= 2147483647; {26089#(<= 0 (+ |g_#t~ret0| 2147483636))} is VALID [2022-02-21 03:03:09,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {26089#(<= 0 (+ |g_#t~ret0| 2147483636))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {26089#(<= 0 (+ |g_#t~ret0| 2147483636))} is VALID [2022-02-21 03:03:09,254 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {26105#(<= 0 (+ |g_#res| 2147483636))} {25589#true} #32#return; {26089#(<= 0 (+ |g_#t~ret0| 2147483636))} is VALID [2022-02-21 03:03:09,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {26105#(<= 0 (+ |g_#res| 2147483636))} assume true; {26105#(<= 0 (+ |g_#res| 2147483636))} is VALID [2022-02-21 03:03:09,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {26112#(<= 0 (+ |g_#t~ret1| 2147483636))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret0;havoc #t~ret1; {26105#(<= 0 (+ |g_#res| 2147483636))} is VALID [2022-02-21 03:03:09,255 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {26105#(<= 0 (+ |g_#res| 2147483636))} {25589#true} #34#return; {26112#(<= 0 (+ |g_#t~ret1| 2147483636))} is VALID [2022-02-21 03:03:09,256 INFO L290 TraceCheckUtils]: 24: Hoare triple {26105#(<= 0 (+ |g_#res| 2147483636))} assume true; {26105#(<= 0 (+ |g_#res| 2147483636))} is VALID [2022-02-21 03:03:09,256 INFO L290 TraceCheckUtils]: 23: Hoare triple {25589#true} assume 0 == ~x;#res := 1; {26105#(<= 0 (+ |g_#res| 2147483636))} is VALID [2022-02-21 03:03:09,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {25589#true} ~x := #in~x; {25589#true} is VALID [2022-02-21 03:03:09,256 INFO L272 TraceCheckUtils]: 21: Hoare triple {25589#true} call #t~ret1 := g(#t~ret0 - 1); {25589#true} is VALID [2022-02-21 03:03:09,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {25589#true} assume #t~ret0 - 1 >= -2147483648; {25589#true} is VALID [2022-02-21 03:03:09,256 INFO L290 TraceCheckUtils]: 19: Hoare triple {25589#true} assume #t~ret0 - 1 <= 2147483647; {25589#true} is VALID [2022-02-21 03:03:09,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {25589#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {25589#true} is VALID [2022-02-21 03:03:09,256 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {25589#true} {25589#true} #32#return; {25589#true} is VALID [2022-02-21 03:03:09,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {25589#true} assume true; {25589#true} is VALID [2022-02-21 03:03:09,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {25589#true} assume 0 == ~x;#res := 1; {25589#true} is VALID [2022-02-21 03:03:09,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {25589#true} ~x := #in~x; {25589#true} is VALID [2022-02-21 03:03:09,257 INFO L272 TraceCheckUtils]: 13: Hoare triple {25589#true} call #t~ret0 := g(~x - 1); {25589#true} is VALID [2022-02-21 03:03:09,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {25589#true} assume ~x - 1 >= -2147483648; {25589#true} is VALID [2022-02-21 03:03:09,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {25589#true} assume ~x - 1 <= 2147483647; {25589#true} is VALID [2022-02-21 03:03:09,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {25589#true} assume !(0 == ~x); {25589#true} is VALID [2022-02-21 03:03:09,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {25589#true} ~x := #in~x; {25589#true} is VALID [2022-02-21 03:03:09,257 INFO L272 TraceCheckUtils]: 8: Hoare triple {25589#true} call #t~ret0 := g(~x - 1); {25589#true} is VALID [2022-02-21 03:03:09,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {25589#true} assume ~x - 1 >= -2147483648; {25589#true} is VALID [2022-02-21 03:03:09,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {25589#true} assume ~x - 1 <= 2147483647; {25589#true} is VALID [2022-02-21 03:03:09,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {25589#true} assume !(0 == ~x); {25589#true} is VALID [2022-02-21 03:03:09,258 INFO L290 TraceCheckUtils]: 4: Hoare triple {25589#true} ~x := #in~x; {25589#true} is VALID [2022-02-21 03:03:09,258 INFO L272 TraceCheckUtils]: 3: Hoare triple {25589#true} call main_#t~ret3#1 := g(main_~x~0#1); {25589#true} is VALID [2022-02-21 03:03:09,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {25589#true} assume !(main_~x~0#1 < 0); {25589#true} is VALID [2022-02-21 03:03:09,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {25589#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {25589#true} is VALID [2022-02-21 03:03:09,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {25589#true} assume { :begin_inline_ULTIMATE.init } true; {25589#true} is VALID [2022-02-21 03:03:09,259 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 160 proven. 265 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-02-21 03:03:09,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441107659] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:09,259 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:09,259 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2022-02-21 03:03:09,259 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524198645] [2022-02-21 03:03:09,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:09,261 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.196078431372549) internal successors, (112), 28 states have internal predecessors, (112), 23 states have call successors, (25), 23 states have call predecessors, (25), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 87 [2022-02-21 03:03:09,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:09,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 52 states, 51 states have (on average 2.196078431372549) internal successors, (112), 28 states have internal predecessors, (112), 23 states have call successors, (25), 23 states have call predecessors, (25), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-21 03:03:09,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:09,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-02-21 03:03:09,344 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:09,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-02-21 03:03:09,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=2086, Unknown=0, NotChecked=0, Total=2652 [2022-02-21 03:03:09,345 INFO L87 Difference]: Start difference. First operand 608 states and 709 transitions. Second operand has 52 states, 51 states have (on average 2.196078431372549) internal successors, (112), 28 states have internal predecessors, (112), 23 states have call successors, (25), 23 states have call predecessors, (25), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-21 03:03:14,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:14,416 INFO L93 Difference]: Finished difference Result 825 states and 973 transitions. [2022-02-21 03:03:14,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2022-02-21 03:03:14,417 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.196078431372549) internal successors, (112), 28 states have internal predecessors, (112), 23 states have call successors, (25), 23 states have call predecessors, (25), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 87 [2022-02-21 03:03:14,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:14,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 2.196078431372549) internal successors, (112), 28 states have internal predecessors, (112), 23 states have call successors, (25), 23 states have call predecessors, (25), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-21 03:03:14,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 384 transitions. [2022-02-21 03:03:14,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 2.196078431372549) internal successors, (112), 28 states have internal predecessors, (112), 23 states have call successors, (25), 23 states have call predecessors, (25), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-21 03:03:14,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 384 transitions. [2022-02-21 03:03:14,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 138 states and 384 transitions. [2022-02-21 03:03:14,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 384 edges. 384 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:14,717 INFO L225 Difference]: With dead ends: 825 [2022-02-21 03:03:14,717 INFO L226 Difference]: Without dead ends: 824 [2022-02-21 03:03:14,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7836 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=6524, Invalid=20536, Unknown=0, NotChecked=0, Total=27060 [2022-02-21 03:03:14,723 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 745 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 458 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 458 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:14,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [747 Valid, 198 Invalid, 1358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [458 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-21 03:03:14,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2022-02-21 03:03:15,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 824. [2022-02-21 03:03:15,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:15,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 824 states. Second operand has 824 states, 596 states have (on average 1.0771812080536913) internal successors, (642), 640 states have internal predecessors, (642), 138 states have call successors, (138), 47 states have call predecessors, (138), 89 states have return successors, (181), 136 states have call predecessors, (181), 136 states have call successors, (181) [2022-02-21 03:03:15,239 INFO L74 IsIncluded]: Start isIncluded. First operand 824 states. Second operand has 824 states, 596 states have (on average 1.0771812080536913) internal successors, (642), 640 states have internal predecessors, (642), 138 states have call successors, (138), 47 states have call predecessors, (138), 89 states have return successors, (181), 136 states have call predecessors, (181), 136 states have call successors, (181) [2022-02-21 03:03:15,239 INFO L87 Difference]: Start difference. First operand 824 states. Second operand has 824 states, 596 states have (on average 1.0771812080536913) internal successors, (642), 640 states have internal predecessors, (642), 138 states have call successors, (138), 47 states have call predecessors, (138), 89 states have return successors, (181), 136 states have call predecessors, (181), 136 states have call successors, (181) [2022-02-21 03:03:15,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:15,265 INFO L93 Difference]: Finished difference Result 824 states and 961 transitions. [2022-02-21 03:03:15,265 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 961 transitions. [2022-02-21 03:03:15,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:15,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:15,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 824 states, 596 states have (on average 1.0771812080536913) internal successors, (642), 640 states have internal predecessors, (642), 138 states have call successors, (138), 47 states have call predecessors, (138), 89 states have return successors, (181), 136 states have call predecessors, (181), 136 states have call successors, (181) Second operand 824 states. [2022-02-21 03:03:15,270 INFO L87 Difference]: Start difference. First operand has 824 states, 596 states have (on average 1.0771812080536913) internal successors, (642), 640 states have internal predecessors, (642), 138 states have call successors, (138), 47 states have call predecessors, (138), 89 states have return successors, (181), 136 states have call predecessors, (181), 136 states have call successors, (181) Second operand 824 states. [2022-02-21 03:03:15,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:15,296 INFO L93 Difference]: Finished difference Result 824 states and 961 transitions. [2022-02-21 03:03:15,297 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 961 transitions. [2022-02-21 03:03:15,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:15,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:15,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:15,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:15,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 596 states have (on average 1.0771812080536913) internal successors, (642), 640 states have internal predecessors, (642), 138 states have call successors, (138), 47 states have call predecessors, (138), 89 states have return successors, (181), 136 states have call predecessors, (181), 136 states have call successors, (181) [2022-02-21 03:03:15,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 961 transitions. [2022-02-21 03:03:15,335 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 961 transitions. Word has length 87 [2022-02-21 03:03:15,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:15,336 INFO L470 AbstractCegarLoop]: Abstraction has 824 states and 961 transitions. [2022-02-21 03:03:15,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.196078431372549) internal successors, (112), 28 states have internal predecessors, (112), 23 states have call successors, (25), 23 states have call predecessors, (25), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-21 03:03:15,336 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 961 transitions. [2022-02-21 03:03:15,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-02-21 03:03:15,343 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:15,344 INFO L514 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1, 1, 1, 1] [2022-02-21 03:03:15,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:03:15,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-02-21 03:03:15,562 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:03:15,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:15,563 INFO L85 PathProgramCache]: Analyzing trace with hash -102214958, now seen corresponding path program 4 times [2022-02-21 03:03:15,563 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:15,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849268639] [2022-02-21 03:03:15,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:15,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:16,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {30103#true} assume { :begin_inline_ULTIMATE.init } true; {30103#true} is VALID [2022-02-21 03:03:16,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {30103#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {30103#true} is VALID [2022-02-21 03:03:16,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {30103#true} assume !(main_~x~0#1 < 0); {30105#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:03:16,290 INFO L272 TraceCheckUtils]: 3: Hoare triple {30105#(<= 0 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret3#1 := g(main_~x~0#1); {30106#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:03:16,290 INFO L290 TraceCheckUtils]: 4: Hoare triple {30106#(<= 0 |g_#in~x|)} ~x := #in~x; {30107#(<= 0 g_~x)} is VALID [2022-02-21 03:03:16,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {30107#(<= 0 g_~x)} assume !(0 == ~x); {30107#(<= 0 g_~x)} is VALID [2022-02-21 03:03:16,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {30107#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {30107#(<= 0 g_~x)} is VALID [2022-02-21 03:03:16,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {30107#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {30107#(<= 0 g_~x)} is VALID [2022-02-21 03:03:16,292 INFO L272 TraceCheckUtils]: 8: Hoare triple {30107#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {30108#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:03:16,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {30108#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {30109#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:16,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {30109#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {30109#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:16,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {30109#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {30109#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:16,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {30109#(<= 0 (+ g_~x 1))} assume ~x - 1 >= -2147483648; {30109#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:16,293 INFO L272 TraceCheckUtils]: 13: Hoare triple {30109#(<= 0 (+ g_~x 1))} call #t~ret0 := g(~x - 1); {30110#(<= 0 (+ |g_#in~x| 2))} is VALID [2022-02-21 03:03:16,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {30110#(<= 0 (+ |g_#in~x| 2))} ~x := #in~x; {30111#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:16,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {30111#(<= 0 (+ 2 g_~x))} assume !(0 == ~x); {30111#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:16,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {30111#(<= 0 (+ 2 g_~x))} assume ~x - 1 <= 2147483647; {30111#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:16,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {30111#(<= 0 (+ 2 g_~x))} assume ~x - 1 >= -2147483648; {30111#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:16,295 INFO L272 TraceCheckUtils]: 18: Hoare triple {30111#(<= 0 (+ 2 g_~x))} call #t~ret0 := g(~x - 1); {30112#(<= 0 (+ |g_#in~x| 3))} is VALID [2022-02-21 03:03:16,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {30112#(<= 0 (+ |g_#in~x| 3))} ~x := #in~x; {30113#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:16,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {30113#(<= 0 (+ 3 g_~x))} assume !(0 == ~x); {30113#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:16,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {30113#(<= 0 (+ 3 g_~x))} assume ~x - 1 <= 2147483647; {30113#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:16,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {30113#(<= 0 (+ 3 g_~x))} assume ~x - 1 >= -2147483648; {30113#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:16,296 INFO L272 TraceCheckUtils]: 23: Hoare triple {30113#(<= 0 (+ 3 g_~x))} call #t~ret0 := g(~x - 1); {30114#(<= 0 (+ |g_#in~x| 4))} is VALID [2022-02-21 03:03:16,297 INFO L290 TraceCheckUtils]: 24: Hoare triple {30114#(<= 0 (+ |g_#in~x| 4))} ~x := #in~x; {30115#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:16,297 INFO L290 TraceCheckUtils]: 25: Hoare triple {30115#(<= 0 (+ g_~x 4))} assume !(0 == ~x); {30115#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:16,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {30115#(<= 0 (+ g_~x 4))} assume ~x - 1 <= 2147483647; {30115#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:16,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {30115#(<= 0 (+ g_~x 4))} assume ~x - 1 >= -2147483648; {30115#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:16,298 INFO L272 TraceCheckUtils]: 28: Hoare triple {30115#(<= 0 (+ g_~x 4))} call #t~ret0 := g(~x - 1); {30116#(<= 0 (+ 5 |g_#in~x|))} is VALID [2022-02-21 03:03:16,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {30116#(<= 0 (+ 5 |g_#in~x|))} ~x := #in~x; {30117#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:16,299 INFO L290 TraceCheckUtils]: 30: Hoare triple {30117#(<= 0 (+ 5 g_~x))} assume !(0 == ~x); {30117#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:16,299 INFO L290 TraceCheckUtils]: 31: Hoare triple {30117#(<= 0 (+ 5 g_~x))} assume ~x - 1 <= 2147483647; {30117#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:16,299 INFO L290 TraceCheckUtils]: 32: Hoare triple {30117#(<= 0 (+ 5 g_~x))} assume ~x - 1 >= -2147483648; {30117#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:16,300 INFO L272 TraceCheckUtils]: 33: Hoare triple {30117#(<= 0 (+ 5 g_~x))} call #t~ret0 := g(~x - 1); {30118#(<= 0 (+ |g_#in~x| 6))} is VALID [2022-02-21 03:03:16,300 INFO L290 TraceCheckUtils]: 34: Hoare triple {30118#(<= 0 (+ |g_#in~x| 6))} ~x := #in~x; {30119#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:16,300 INFO L290 TraceCheckUtils]: 35: Hoare triple {30119#(<= 0 (+ 6 g_~x))} assume !(0 == ~x); {30119#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:16,301 INFO L290 TraceCheckUtils]: 36: Hoare triple {30119#(<= 0 (+ 6 g_~x))} assume ~x - 1 <= 2147483647; {30119#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:16,301 INFO L290 TraceCheckUtils]: 37: Hoare triple {30119#(<= 0 (+ 6 g_~x))} assume ~x - 1 >= -2147483648; {30119#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:16,310 INFO L272 TraceCheckUtils]: 38: Hoare triple {30119#(<= 0 (+ 6 g_~x))} call #t~ret0 := g(~x - 1); {30120#(<= 0 (+ 7 |g_#in~x|))} is VALID [2022-02-21 03:03:16,310 INFO L290 TraceCheckUtils]: 39: Hoare triple {30120#(<= 0 (+ 7 |g_#in~x|))} ~x := #in~x; {30121#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:16,310 INFO L290 TraceCheckUtils]: 40: Hoare triple {30121#(<= 0 (+ 7 g_~x))} assume !(0 == ~x); {30121#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:16,311 INFO L290 TraceCheckUtils]: 41: Hoare triple {30121#(<= 0 (+ 7 g_~x))} assume ~x - 1 <= 2147483647; {30121#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:16,311 INFO L290 TraceCheckUtils]: 42: Hoare triple {30121#(<= 0 (+ 7 g_~x))} assume ~x - 1 >= -2147483648; {30121#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:16,312 INFO L272 TraceCheckUtils]: 43: Hoare triple {30121#(<= 0 (+ 7 g_~x))} call #t~ret0 := g(~x - 1); {30122#(<= 0 (+ |g_#in~x| 8))} is VALID [2022-02-21 03:03:16,312 INFO L290 TraceCheckUtils]: 44: Hoare triple {30122#(<= 0 (+ |g_#in~x| 8))} ~x := #in~x; {30123#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:16,312 INFO L290 TraceCheckUtils]: 45: Hoare triple {30123#(<= 0 (+ g_~x 8))} assume !(0 == ~x); {30123#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:16,312 INFO L290 TraceCheckUtils]: 46: Hoare triple {30123#(<= 0 (+ g_~x 8))} assume ~x - 1 <= 2147483647; {30123#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:16,313 INFO L290 TraceCheckUtils]: 47: Hoare triple {30123#(<= 0 (+ g_~x 8))} assume ~x - 1 >= -2147483648; {30123#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:16,313 INFO L272 TraceCheckUtils]: 48: Hoare triple {30123#(<= 0 (+ g_~x 8))} call #t~ret0 := g(~x - 1); {30124#(<= 0 (+ |g_#in~x| 9))} is VALID [2022-02-21 03:03:16,314 INFO L290 TraceCheckUtils]: 49: Hoare triple {30124#(<= 0 (+ |g_#in~x| 9))} ~x := #in~x; {30125#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:16,314 INFO L290 TraceCheckUtils]: 50: Hoare triple {30125#(<= 0 (+ 9 g_~x))} assume !(0 == ~x); {30125#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:16,314 INFO L290 TraceCheckUtils]: 51: Hoare triple {30125#(<= 0 (+ 9 g_~x))} assume ~x - 1 <= 2147483647; {30125#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:16,315 INFO L290 TraceCheckUtils]: 52: Hoare triple {30125#(<= 0 (+ 9 g_~x))} assume ~x - 1 >= -2147483648; {30125#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:16,315 INFO L272 TraceCheckUtils]: 53: Hoare triple {30125#(<= 0 (+ 9 g_~x))} call #t~ret0 := g(~x - 1); {30126#(<= 0 (+ |g_#in~x| 10))} is VALID [2022-02-21 03:03:16,315 INFO L290 TraceCheckUtils]: 54: Hoare triple {30126#(<= 0 (+ |g_#in~x| 10))} ~x := #in~x; {30127#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:16,316 INFO L290 TraceCheckUtils]: 55: Hoare triple {30127#(<= 0 (+ g_~x 10))} assume !(0 == ~x); {30127#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:16,316 INFO L290 TraceCheckUtils]: 56: Hoare triple {30127#(<= 0 (+ g_~x 10))} assume ~x - 1 <= 2147483647; {30127#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:16,316 INFO L290 TraceCheckUtils]: 57: Hoare triple {30127#(<= 0 (+ g_~x 10))} assume ~x - 1 >= -2147483648; {30127#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:16,317 INFO L272 TraceCheckUtils]: 58: Hoare triple {30127#(<= 0 (+ g_~x 10))} call #t~ret0 := g(~x - 1); {30128#(<= 0 (+ |g_#in~x| 11))} is VALID [2022-02-21 03:03:16,317 INFO L290 TraceCheckUtils]: 59: Hoare triple {30128#(<= 0 (+ |g_#in~x| 11))} ~x := #in~x; {30129#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:03:16,317 INFO L290 TraceCheckUtils]: 60: Hoare triple {30129#(<= 0 (+ g_~x 11))} assume !(0 == ~x); {30129#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:03:16,318 INFO L290 TraceCheckUtils]: 61: Hoare triple {30129#(<= 0 (+ g_~x 11))} assume ~x - 1 <= 2147483647; {30129#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:03:16,318 INFO L290 TraceCheckUtils]: 62: Hoare triple {30129#(<= 0 (+ g_~x 11))} assume ~x - 1 >= -2147483648; {30129#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:03:16,318 INFO L272 TraceCheckUtils]: 63: Hoare triple {30129#(<= 0 (+ g_~x 11))} call #t~ret0 := g(~x - 1); {30130#(<= 0 (+ |g_#in~x| 12))} is VALID [2022-02-21 03:03:16,319 INFO L290 TraceCheckUtils]: 64: Hoare triple {30130#(<= 0 (+ |g_#in~x| 12))} ~x := #in~x; {30131#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:03:16,319 INFO L290 TraceCheckUtils]: 65: Hoare triple {30131#(<= 0 (+ g_~x 12))} assume !(0 == ~x); {30131#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:03:16,319 INFO L290 TraceCheckUtils]: 66: Hoare triple {30131#(<= 0 (+ g_~x 12))} assume ~x - 1 <= 2147483647; {30131#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:03:16,319 INFO L290 TraceCheckUtils]: 67: Hoare triple {30131#(<= 0 (+ g_~x 12))} assume ~x - 1 >= -2147483648; {30131#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:03:16,320 INFO L272 TraceCheckUtils]: 68: Hoare triple {30131#(<= 0 (+ g_~x 12))} call #t~ret0 := g(~x - 1); {30132#(<= 0 (+ |g_#in~x| 13))} is VALID [2022-02-21 03:03:16,320 INFO L290 TraceCheckUtils]: 69: Hoare triple {30132#(<= 0 (+ |g_#in~x| 13))} ~x := #in~x; {30133#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:03:16,320 INFO L290 TraceCheckUtils]: 70: Hoare triple {30133#(<= 0 (+ g_~x 13))} assume !(0 == ~x); {30133#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:03:16,321 INFO L290 TraceCheckUtils]: 71: Hoare triple {30133#(<= 0 (+ g_~x 13))} assume ~x - 1 <= 2147483647; {30133#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:03:16,321 INFO L290 TraceCheckUtils]: 72: Hoare triple {30133#(<= 0 (+ g_~x 13))} assume ~x - 1 >= -2147483648; {30133#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:03:16,321 INFO L272 TraceCheckUtils]: 73: Hoare triple {30133#(<= 0 (+ g_~x 13))} call #t~ret0 := g(~x - 1); {30134#(<= 0 (+ |g_#in~x| 14))} is VALID [2022-02-21 03:03:16,322 INFO L290 TraceCheckUtils]: 74: Hoare triple {30134#(<= 0 (+ |g_#in~x| 14))} ~x := #in~x; {30135#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:03:16,322 INFO L290 TraceCheckUtils]: 75: Hoare triple {30135#(<= 0 (+ 14 g_~x))} assume !(0 == ~x); {30135#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:03:16,323 INFO L290 TraceCheckUtils]: 76: Hoare triple {30135#(<= 0 (+ 14 g_~x))} assume ~x - 1 <= 2147483647; {30135#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:03:16,323 INFO L290 TraceCheckUtils]: 77: Hoare triple {30135#(<= 0 (+ 14 g_~x))} assume ~x - 1 >= -2147483648; {30135#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:03:16,324 INFO L272 TraceCheckUtils]: 78: Hoare triple {30135#(<= 0 (+ 14 g_~x))} call #t~ret0 := g(~x - 1); {30136#(<= 0 (+ |g_#in~x| 15))} is VALID [2022-02-21 03:03:16,324 INFO L290 TraceCheckUtils]: 79: Hoare triple {30136#(<= 0 (+ |g_#in~x| 15))} ~x := #in~x; {30137#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:03:16,324 INFO L290 TraceCheckUtils]: 80: Hoare triple {30137#(<= 0 (+ g_~x 15))} assume !(0 == ~x); {30137#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:03:16,324 INFO L290 TraceCheckUtils]: 81: Hoare triple {30137#(<= 0 (+ g_~x 15))} assume ~x - 1 <= 2147483647; {30137#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:03:16,325 INFO L290 TraceCheckUtils]: 82: Hoare triple {30137#(<= 0 (+ g_~x 15))} assume ~x - 1 >= -2147483648; {30137#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:03:16,325 INFO L272 TraceCheckUtils]: 83: Hoare triple {30137#(<= 0 (+ g_~x 15))} call #t~ret0 := g(~x - 1); {30138#(<= 0 (+ |g_#in~x| 16))} is VALID [2022-02-21 03:03:16,325 INFO L290 TraceCheckUtils]: 84: Hoare triple {30138#(<= 0 (+ |g_#in~x| 16))} ~x := #in~x; {30139#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:03:16,326 INFO L290 TraceCheckUtils]: 85: Hoare triple {30139#(<= 0 (+ 16 g_~x))} assume !(0 == ~x); {30139#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:03:16,326 INFO L290 TraceCheckUtils]: 86: Hoare triple {30139#(<= 0 (+ 16 g_~x))} assume ~x - 1 <= 2147483647; {30139#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:03:16,326 INFO L290 TraceCheckUtils]: 87: Hoare triple {30139#(<= 0 (+ 16 g_~x))} assume ~x - 1 >= -2147483648; {30139#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:03:16,327 INFO L272 TraceCheckUtils]: 88: Hoare triple {30139#(<= 0 (+ 16 g_~x))} call #t~ret0 := g(~x - 1); {30140#(<= 0 (+ |g_#in~x| 17))} is VALID [2022-02-21 03:03:16,327 INFO L290 TraceCheckUtils]: 89: Hoare triple {30140#(<= 0 (+ |g_#in~x| 17))} ~x := #in~x; {30141#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:03:16,328 INFO L290 TraceCheckUtils]: 90: Hoare triple {30141#(<= 0 (+ g_~x 17))} assume !(0 == ~x); {30141#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:03:16,328 INFO L290 TraceCheckUtils]: 91: Hoare triple {30141#(<= 0 (+ g_~x 17))} assume ~x - 1 <= 2147483647; {30141#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:03:16,328 INFO L290 TraceCheckUtils]: 92: Hoare triple {30141#(<= 0 (+ g_~x 17))} assume ~x - 1 >= -2147483648; {30141#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:03:16,329 INFO L272 TraceCheckUtils]: 93: Hoare triple {30141#(<= 0 (+ g_~x 17))} call #t~ret0 := g(~x - 1); {30142#(<= 0 (+ |g_#in~x| 18))} is VALID [2022-02-21 03:03:16,329 INFO L290 TraceCheckUtils]: 94: Hoare triple {30142#(<= 0 (+ |g_#in~x| 18))} ~x := #in~x; {30143#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:03:16,329 INFO L290 TraceCheckUtils]: 95: Hoare triple {30143#(<= 0 (+ g_~x 18))} assume !(0 == ~x); {30143#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:03:16,330 INFO L290 TraceCheckUtils]: 96: Hoare triple {30143#(<= 0 (+ g_~x 18))} assume ~x - 1 <= 2147483647; {30143#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:03:16,330 INFO L290 TraceCheckUtils]: 97: Hoare triple {30143#(<= 0 (+ g_~x 18))} assume ~x - 1 >= -2147483648; {30143#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:03:16,330 INFO L272 TraceCheckUtils]: 98: Hoare triple {30143#(<= 0 (+ g_~x 18))} call #t~ret0 := g(~x - 1); {30144#(<= 0 (+ 19 |g_#in~x|))} is VALID [2022-02-21 03:03:16,331 INFO L290 TraceCheckUtils]: 99: Hoare triple {30144#(<= 0 (+ 19 |g_#in~x|))} ~x := #in~x; {30145#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:03:16,331 INFO L290 TraceCheckUtils]: 100: Hoare triple {30145#(<= 0 (+ 19 g_~x))} assume !(0 == ~x); {30145#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:03:16,331 INFO L290 TraceCheckUtils]: 101: Hoare triple {30145#(<= 0 (+ 19 g_~x))} assume ~x - 1 <= 2147483647; {30145#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:03:16,332 INFO L290 TraceCheckUtils]: 102: Hoare triple {30145#(<= 0 (+ 19 g_~x))} assume ~x - 1 >= -2147483648; {30145#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:03:16,332 INFO L272 TraceCheckUtils]: 103: Hoare triple {30145#(<= 0 (+ 19 g_~x))} call #t~ret0 := g(~x - 1); {30146#(<= 0 (+ |g_#in~x| 20))} is VALID [2022-02-21 03:03:16,333 INFO L290 TraceCheckUtils]: 104: Hoare triple {30146#(<= 0 (+ |g_#in~x| 20))} ~x := #in~x; {30147#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:03:16,333 INFO L290 TraceCheckUtils]: 105: Hoare triple {30147#(<= 0 (+ g_~x 20))} assume !(0 == ~x); {30147#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:03:16,333 INFO L290 TraceCheckUtils]: 106: Hoare triple {30147#(<= 0 (+ g_~x 20))} assume ~x - 1 <= 2147483647; {30147#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:03:16,333 INFO L290 TraceCheckUtils]: 107: Hoare triple {30147#(<= 0 (+ g_~x 20))} assume ~x - 1 >= -2147483648; {30147#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:03:16,334 INFO L272 TraceCheckUtils]: 108: Hoare triple {30147#(<= 0 (+ g_~x 20))} call #t~ret0 := g(~x - 1); {30148#(<= 0 (+ |g_#in~x| 21))} is VALID [2022-02-21 03:03:16,334 INFO L290 TraceCheckUtils]: 109: Hoare triple {30148#(<= 0 (+ |g_#in~x| 21))} ~x := #in~x; {30149#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:03:16,335 INFO L290 TraceCheckUtils]: 110: Hoare triple {30149#(<= 0 (+ 21 g_~x))} assume !(0 == ~x); {30149#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:03:16,335 INFO L290 TraceCheckUtils]: 111: Hoare triple {30149#(<= 0 (+ 21 g_~x))} assume ~x - 1 <= 2147483647; {30149#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:03:16,335 INFO L290 TraceCheckUtils]: 112: Hoare triple {30149#(<= 0 (+ 21 g_~x))} assume ~x - 1 >= -2147483648; {30149#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:03:16,336 INFO L272 TraceCheckUtils]: 113: Hoare triple {30149#(<= 0 (+ 21 g_~x))} call #t~ret0 := g(~x - 1); {30150#(<= 0 (+ |g_#in~x| 22))} is VALID [2022-02-21 03:03:16,336 INFO L290 TraceCheckUtils]: 114: Hoare triple {30150#(<= 0 (+ |g_#in~x| 22))} ~x := #in~x; {30151#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:03:16,337 INFO L290 TraceCheckUtils]: 115: Hoare triple {30151#(<= 0 (+ 22 g_~x))} assume !(0 == ~x); {30151#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:03:16,337 INFO L290 TraceCheckUtils]: 116: Hoare triple {30151#(<= 0 (+ 22 g_~x))} assume ~x - 1 <= 2147483647; {30151#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:03:16,337 INFO L290 TraceCheckUtils]: 117: Hoare triple {30151#(<= 0 (+ 22 g_~x))} assume !(~x - 1 >= -2147483648); {30104#false} is VALID [2022-02-21 03:03:16,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:16,338 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:16,338 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849268639] [2022-02-21 03:03:16,338 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849268639] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:16,339 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786478298] [2022-02-21 03:03:16,339 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-21 03:03:16,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:16,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:16,340 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:03:16,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-21 03:03:16,389 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-21 03:03:16,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:03:16,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 48 conjunts are in the unsatisfiable core [2022-02-21 03:03:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:16,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:17,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {30103#true} assume { :begin_inline_ULTIMATE.init } true; {30103#true} is VALID [2022-02-21 03:03:17,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {30103#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {30103#true} is VALID [2022-02-21 03:03:17,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {30103#true} assume !(main_~x~0#1 < 0); {30105#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:03:17,099 INFO L272 TraceCheckUtils]: 3: Hoare triple {30105#(<= 0 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret3#1 := g(main_~x~0#1); {30106#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:03:17,099 INFO L290 TraceCheckUtils]: 4: Hoare triple {30106#(<= 0 |g_#in~x|)} ~x := #in~x; {30107#(<= 0 g_~x)} is VALID [2022-02-21 03:03:17,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {30107#(<= 0 g_~x)} assume !(0 == ~x); {30107#(<= 0 g_~x)} is VALID [2022-02-21 03:03:17,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {30107#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {30107#(<= 0 g_~x)} is VALID [2022-02-21 03:03:17,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {30107#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {30107#(<= 0 g_~x)} is VALID [2022-02-21 03:03:17,101 INFO L272 TraceCheckUtils]: 8: Hoare triple {30107#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {30108#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:03:17,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {30108#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {30109#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:17,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {30109#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {30109#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:17,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {30109#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {30109#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:17,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {30109#(<= 0 (+ g_~x 1))} assume ~x - 1 >= -2147483648; {30109#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:17,102 INFO L272 TraceCheckUtils]: 13: Hoare triple {30109#(<= 0 (+ g_~x 1))} call #t~ret0 := g(~x - 1); {30110#(<= 0 (+ |g_#in~x| 2))} is VALID [2022-02-21 03:03:17,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {30110#(<= 0 (+ |g_#in~x| 2))} ~x := #in~x; {30111#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:17,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {30111#(<= 0 (+ 2 g_~x))} assume !(0 == ~x); {30111#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:17,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {30111#(<= 0 (+ 2 g_~x))} assume ~x - 1 <= 2147483647; {30111#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:17,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {30111#(<= 0 (+ 2 g_~x))} assume ~x - 1 >= -2147483648; {30111#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:17,104 INFO L272 TraceCheckUtils]: 18: Hoare triple {30111#(<= 0 (+ 2 g_~x))} call #t~ret0 := g(~x - 1); {30112#(<= 0 (+ |g_#in~x| 3))} is VALID [2022-02-21 03:03:17,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {30112#(<= 0 (+ |g_#in~x| 3))} ~x := #in~x; {30113#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:17,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {30113#(<= 0 (+ 3 g_~x))} assume !(0 == ~x); {30113#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:17,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {30113#(<= 0 (+ 3 g_~x))} assume ~x - 1 <= 2147483647; {30113#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:17,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {30113#(<= 0 (+ 3 g_~x))} assume ~x - 1 >= -2147483648; {30113#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:17,106 INFO L272 TraceCheckUtils]: 23: Hoare triple {30113#(<= 0 (+ 3 g_~x))} call #t~ret0 := g(~x - 1); {30114#(<= 0 (+ |g_#in~x| 4))} is VALID [2022-02-21 03:03:17,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {30114#(<= 0 (+ |g_#in~x| 4))} ~x := #in~x; {30115#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:17,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {30115#(<= 0 (+ g_~x 4))} assume !(0 == ~x); {30115#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:17,106 INFO L290 TraceCheckUtils]: 26: Hoare triple {30115#(<= 0 (+ g_~x 4))} assume ~x - 1 <= 2147483647; {30115#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:17,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {30115#(<= 0 (+ g_~x 4))} assume ~x - 1 >= -2147483648; {30115#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:17,111 INFO L272 TraceCheckUtils]: 28: Hoare triple {30115#(<= 0 (+ g_~x 4))} call #t~ret0 := g(~x - 1); {30116#(<= 0 (+ 5 |g_#in~x|))} is VALID [2022-02-21 03:03:17,112 INFO L290 TraceCheckUtils]: 29: Hoare triple {30116#(<= 0 (+ 5 |g_#in~x|))} ~x := #in~x; {30117#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:17,112 INFO L290 TraceCheckUtils]: 30: Hoare triple {30117#(<= 0 (+ 5 g_~x))} assume !(0 == ~x); {30117#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:17,113 INFO L290 TraceCheckUtils]: 31: Hoare triple {30117#(<= 0 (+ 5 g_~x))} assume ~x - 1 <= 2147483647; {30117#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:17,113 INFO L290 TraceCheckUtils]: 32: Hoare triple {30117#(<= 0 (+ 5 g_~x))} assume ~x - 1 >= -2147483648; {30117#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:17,114 INFO L272 TraceCheckUtils]: 33: Hoare triple {30117#(<= 0 (+ 5 g_~x))} call #t~ret0 := g(~x - 1); {30118#(<= 0 (+ |g_#in~x| 6))} is VALID [2022-02-21 03:03:17,114 INFO L290 TraceCheckUtils]: 34: Hoare triple {30118#(<= 0 (+ |g_#in~x| 6))} ~x := #in~x; {30119#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:17,114 INFO L290 TraceCheckUtils]: 35: Hoare triple {30119#(<= 0 (+ 6 g_~x))} assume !(0 == ~x); {30119#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:17,115 INFO L290 TraceCheckUtils]: 36: Hoare triple {30119#(<= 0 (+ 6 g_~x))} assume ~x - 1 <= 2147483647; {30119#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:17,115 INFO L290 TraceCheckUtils]: 37: Hoare triple {30119#(<= 0 (+ 6 g_~x))} assume ~x - 1 >= -2147483648; {30119#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:17,116 INFO L272 TraceCheckUtils]: 38: Hoare triple {30119#(<= 0 (+ 6 g_~x))} call #t~ret0 := g(~x - 1); {30120#(<= 0 (+ 7 |g_#in~x|))} is VALID [2022-02-21 03:03:17,116 INFO L290 TraceCheckUtils]: 39: Hoare triple {30120#(<= 0 (+ 7 |g_#in~x|))} ~x := #in~x; {30121#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:17,116 INFO L290 TraceCheckUtils]: 40: Hoare triple {30121#(<= 0 (+ 7 g_~x))} assume !(0 == ~x); {30121#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:17,116 INFO L290 TraceCheckUtils]: 41: Hoare triple {30121#(<= 0 (+ 7 g_~x))} assume ~x - 1 <= 2147483647; {30121#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:17,117 INFO L290 TraceCheckUtils]: 42: Hoare triple {30121#(<= 0 (+ 7 g_~x))} assume ~x - 1 >= -2147483648; {30121#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:17,117 INFO L272 TraceCheckUtils]: 43: Hoare triple {30121#(<= 0 (+ 7 g_~x))} call #t~ret0 := g(~x - 1); {30122#(<= 0 (+ |g_#in~x| 8))} is VALID [2022-02-21 03:03:17,117 INFO L290 TraceCheckUtils]: 44: Hoare triple {30122#(<= 0 (+ |g_#in~x| 8))} ~x := #in~x; {30123#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:17,118 INFO L290 TraceCheckUtils]: 45: Hoare triple {30123#(<= 0 (+ g_~x 8))} assume !(0 == ~x); {30123#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:17,118 INFO L290 TraceCheckUtils]: 46: Hoare triple {30123#(<= 0 (+ g_~x 8))} assume ~x - 1 <= 2147483647; {30123#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:17,118 INFO L290 TraceCheckUtils]: 47: Hoare triple {30123#(<= 0 (+ g_~x 8))} assume ~x - 1 >= -2147483648; {30123#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:17,119 INFO L272 TraceCheckUtils]: 48: Hoare triple {30123#(<= 0 (+ g_~x 8))} call #t~ret0 := g(~x - 1); {30124#(<= 0 (+ |g_#in~x| 9))} is VALID [2022-02-21 03:03:17,119 INFO L290 TraceCheckUtils]: 49: Hoare triple {30124#(<= 0 (+ |g_#in~x| 9))} ~x := #in~x; {30125#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:17,119 INFO L290 TraceCheckUtils]: 50: Hoare triple {30125#(<= 0 (+ 9 g_~x))} assume !(0 == ~x); {30125#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:17,120 INFO L290 TraceCheckUtils]: 51: Hoare triple {30125#(<= 0 (+ 9 g_~x))} assume ~x - 1 <= 2147483647; {30125#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:17,120 INFO L290 TraceCheckUtils]: 52: Hoare triple {30125#(<= 0 (+ 9 g_~x))} assume ~x - 1 >= -2147483648; {30125#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:17,120 INFO L272 TraceCheckUtils]: 53: Hoare triple {30125#(<= 0 (+ 9 g_~x))} call #t~ret0 := g(~x - 1); {30126#(<= 0 (+ |g_#in~x| 10))} is VALID [2022-02-21 03:03:17,121 INFO L290 TraceCheckUtils]: 54: Hoare triple {30126#(<= 0 (+ |g_#in~x| 10))} ~x := #in~x; {30127#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:17,121 INFO L290 TraceCheckUtils]: 55: Hoare triple {30127#(<= 0 (+ g_~x 10))} assume !(0 == ~x); {30127#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:17,121 INFO L290 TraceCheckUtils]: 56: Hoare triple {30127#(<= 0 (+ g_~x 10))} assume ~x - 1 <= 2147483647; {30127#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:17,121 INFO L290 TraceCheckUtils]: 57: Hoare triple {30127#(<= 0 (+ g_~x 10))} assume ~x - 1 >= -2147483648; {30127#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:17,122 INFO L272 TraceCheckUtils]: 58: Hoare triple {30127#(<= 0 (+ g_~x 10))} call #t~ret0 := g(~x - 1); {30128#(<= 0 (+ |g_#in~x| 11))} is VALID [2022-02-21 03:03:17,122 INFO L290 TraceCheckUtils]: 59: Hoare triple {30128#(<= 0 (+ |g_#in~x| 11))} ~x := #in~x; {30129#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:03:17,122 INFO L290 TraceCheckUtils]: 60: Hoare triple {30129#(<= 0 (+ g_~x 11))} assume !(0 == ~x); {30129#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:03:17,123 INFO L290 TraceCheckUtils]: 61: Hoare triple {30129#(<= 0 (+ g_~x 11))} assume ~x - 1 <= 2147483647; {30129#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:03:17,123 INFO L290 TraceCheckUtils]: 62: Hoare triple {30129#(<= 0 (+ g_~x 11))} assume ~x - 1 >= -2147483648; {30129#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:03:17,123 INFO L272 TraceCheckUtils]: 63: Hoare triple {30129#(<= 0 (+ g_~x 11))} call #t~ret0 := g(~x - 1); {30130#(<= 0 (+ |g_#in~x| 12))} is VALID [2022-02-21 03:03:17,124 INFO L290 TraceCheckUtils]: 64: Hoare triple {30130#(<= 0 (+ |g_#in~x| 12))} ~x := #in~x; {30131#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:03:17,124 INFO L290 TraceCheckUtils]: 65: Hoare triple {30131#(<= 0 (+ g_~x 12))} assume !(0 == ~x); {30131#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:03:17,124 INFO L290 TraceCheckUtils]: 66: Hoare triple {30131#(<= 0 (+ g_~x 12))} assume ~x - 1 <= 2147483647; {30131#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:03:17,124 INFO L290 TraceCheckUtils]: 67: Hoare triple {30131#(<= 0 (+ g_~x 12))} assume ~x - 1 >= -2147483648; {30131#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:03:17,125 INFO L272 TraceCheckUtils]: 68: Hoare triple {30131#(<= 0 (+ g_~x 12))} call #t~ret0 := g(~x - 1); {30132#(<= 0 (+ |g_#in~x| 13))} is VALID [2022-02-21 03:03:17,125 INFO L290 TraceCheckUtils]: 69: Hoare triple {30132#(<= 0 (+ |g_#in~x| 13))} ~x := #in~x; {30133#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:03:17,126 INFO L290 TraceCheckUtils]: 70: Hoare triple {30133#(<= 0 (+ g_~x 13))} assume !(0 == ~x); {30133#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:03:17,126 INFO L290 TraceCheckUtils]: 71: Hoare triple {30133#(<= 0 (+ g_~x 13))} assume ~x - 1 <= 2147483647; {30133#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:03:17,126 INFO L290 TraceCheckUtils]: 72: Hoare triple {30133#(<= 0 (+ g_~x 13))} assume ~x - 1 >= -2147483648; {30133#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:03:17,127 INFO L272 TraceCheckUtils]: 73: Hoare triple {30133#(<= 0 (+ g_~x 13))} call #t~ret0 := g(~x - 1); {30134#(<= 0 (+ |g_#in~x| 14))} is VALID [2022-02-21 03:03:17,127 INFO L290 TraceCheckUtils]: 74: Hoare triple {30134#(<= 0 (+ |g_#in~x| 14))} ~x := #in~x; {30135#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:03:17,127 INFO L290 TraceCheckUtils]: 75: Hoare triple {30135#(<= 0 (+ 14 g_~x))} assume !(0 == ~x); {30135#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:03:17,128 INFO L290 TraceCheckUtils]: 76: Hoare triple {30135#(<= 0 (+ 14 g_~x))} assume ~x - 1 <= 2147483647; {30135#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:03:17,128 INFO L290 TraceCheckUtils]: 77: Hoare triple {30135#(<= 0 (+ 14 g_~x))} assume ~x - 1 >= -2147483648; {30135#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:03:17,128 INFO L272 TraceCheckUtils]: 78: Hoare triple {30135#(<= 0 (+ 14 g_~x))} call #t~ret0 := g(~x - 1); {30136#(<= 0 (+ |g_#in~x| 15))} is VALID [2022-02-21 03:03:17,129 INFO L290 TraceCheckUtils]: 79: Hoare triple {30136#(<= 0 (+ |g_#in~x| 15))} ~x := #in~x; {30137#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:03:17,129 INFO L290 TraceCheckUtils]: 80: Hoare triple {30137#(<= 0 (+ g_~x 15))} assume !(0 == ~x); {30137#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:03:17,129 INFO L290 TraceCheckUtils]: 81: Hoare triple {30137#(<= 0 (+ g_~x 15))} assume ~x - 1 <= 2147483647; {30137#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:03:17,129 INFO L290 TraceCheckUtils]: 82: Hoare triple {30137#(<= 0 (+ g_~x 15))} assume ~x - 1 >= -2147483648; {30137#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:03:17,130 INFO L272 TraceCheckUtils]: 83: Hoare triple {30137#(<= 0 (+ g_~x 15))} call #t~ret0 := g(~x - 1); {30138#(<= 0 (+ |g_#in~x| 16))} is VALID [2022-02-21 03:03:17,130 INFO L290 TraceCheckUtils]: 84: Hoare triple {30138#(<= 0 (+ |g_#in~x| 16))} ~x := #in~x; {30139#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:03:17,130 INFO L290 TraceCheckUtils]: 85: Hoare triple {30139#(<= 0 (+ 16 g_~x))} assume !(0 == ~x); {30139#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:03:17,131 INFO L290 TraceCheckUtils]: 86: Hoare triple {30139#(<= 0 (+ 16 g_~x))} assume ~x - 1 <= 2147483647; {30139#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:03:17,131 INFO L290 TraceCheckUtils]: 87: Hoare triple {30139#(<= 0 (+ 16 g_~x))} assume ~x - 1 >= -2147483648; {30139#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:03:17,132 INFO L272 TraceCheckUtils]: 88: Hoare triple {30139#(<= 0 (+ 16 g_~x))} call #t~ret0 := g(~x - 1); {30140#(<= 0 (+ |g_#in~x| 17))} is VALID [2022-02-21 03:03:17,132 INFO L290 TraceCheckUtils]: 89: Hoare triple {30140#(<= 0 (+ |g_#in~x| 17))} ~x := #in~x; {30141#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:03:17,132 INFO L290 TraceCheckUtils]: 90: Hoare triple {30141#(<= 0 (+ g_~x 17))} assume !(0 == ~x); {30141#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:03:17,133 INFO L290 TraceCheckUtils]: 91: Hoare triple {30141#(<= 0 (+ g_~x 17))} assume ~x - 1 <= 2147483647; {30141#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:03:17,133 INFO L290 TraceCheckUtils]: 92: Hoare triple {30141#(<= 0 (+ g_~x 17))} assume ~x - 1 >= -2147483648; {30141#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:03:17,133 INFO L272 TraceCheckUtils]: 93: Hoare triple {30141#(<= 0 (+ g_~x 17))} call #t~ret0 := g(~x - 1); {30142#(<= 0 (+ |g_#in~x| 18))} is VALID [2022-02-21 03:03:17,134 INFO L290 TraceCheckUtils]: 94: Hoare triple {30142#(<= 0 (+ |g_#in~x| 18))} ~x := #in~x; {30143#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:03:17,134 INFO L290 TraceCheckUtils]: 95: Hoare triple {30143#(<= 0 (+ g_~x 18))} assume !(0 == ~x); {30143#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:03:17,134 INFO L290 TraceCheckUtils]: 96: Hoare triple {30143#(<= 0 (+ g_~x 18))} assume ~x - 1 <= 2147483647; {30143#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:03:17,134 INFO L290 TraceCheckUtils]: 97: Hoare triple {30143#(<= 0 (+ g_~x 18))} assume ~x - 1 >= -2147483648; {30143#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:03:17,135 INFO L272 TraceCheckUtils]: 98: Hoare triple {30143#(<= 0 (+ g_~x 18))} call #t~ret0 := g(~x - 1); {30144#(<= 0 (+ 19 |g_#in~x|))} is VALID [2022-02-21 03:03:17,135 INFO L290 TraceCheckUtils]: 99: Hoare triple {30144#(<= 0 (+ 19 |g_#in~x|))} ~x := #in~x; {30145#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:03:17,136 INFO L290 TraceCheckUtils]: 100: Hoare triple {30145#(<= 0 (+ 19 g_~x))} assume !(0 == ~x); {30145#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:03:17,136 INFO L290 TraceCheckUtils]: 101: Hoare triple {30145#(<= 0 (+ 19 g_~x))} assume ~x - 1 <= 2147483647; {30145#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:03:17,136 INFO L290 TraceCheckUtils]: 102: Hoare triple {30145#(<= 0 (+ 19 g_~x))} assume ~x - 1 >= -2147483648; {30145#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:03:17,137 INFO L272 TraceCheckUtils]: 103: Hoare triple {30145#(<= 0 (+ 19 g_~x))} call #t~ret0 := g(~x - 1); {30146#(<= 0 (+ |g_#in~x| 20))} is VALID [2022-02-21 03:03:17,137 INFO L290 TraceCheckUtils]: 104: Hoare triple {30146#(<= 0 (+ |g_#in~x| 20))} ~x := #in~x; {30147#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:03:17,137 INFO L290 TraceCheckUtils]: 105: Hoare triple {30147#(<= 0 (+ g_~x 20))} assume !(0 == ~x); {30147#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:03:17,138 INFO L290 TraceCheckUtils]: 106: Hoare triple {30147#(<= 0 (+ g_~x 20))} assume ~x - 1 <= 2147483647; {30147#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:03:17,138 INFO L290 TraceCheckUtils]: 107: Hoare triple {30147#(<= 0 (+ g_~x 20))} assume ~x - 1 >= -2147483648; {30147#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:03:17,138 INFO L272 TraceCheckUtils]: 108: Hoare triple {30147#(<= 0 (+ g_~x 20))} call #t~ret0 := g(~x - 1); {30148#(<= 0 (+ |g_#in~x| 21))} is VALID [2022-02-21 03:03:17,139 INFO L290 TraceCheckUtils]: 109: Hoare triple {30148#(<= 0 (+ |g_#in~x| 21))} ~x := #in~x; {30149#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:03:17,139 INFO L290 TraceCheckUtils]: 110: Hoare triple {30149#(<= 0 (+ 21 g_~x))} assume !(0 == ~x); {30149#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:03:17,139 INFO L290 TraceCheckUtils]: 111: Hoare triple {30149#(<= 0 (+ 21 g_~x))} assume ~x - 1 <= 2147483647; {30149#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:03:17,139 INFO L290 TraceCheckUtils]: 112: Hoare triple {30149#(<= 0 (+ 21 g_~x))} assume ~x - 1 >= -2147483648; {30149#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:03:17,140 INFO L272 TraceCheckUtils]: 113: Hoare triple {30149#(<= 0 (+ 21 g_~x))} call #t~ret0 := g(~x - 1); {30150#(<= 0 (+ |g_#in~x| 22))} is VALID [2022-02-21 03:03:17,140 INFO L290 TraceCheckUtils]: 114: Hoare triple {30150#(<= 0 (+ |g_#in~x| 22))} ~x := #in~x; {30151#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:03:17,141 INFO L290 TraceCheckUtils]: 115: Hoare triple {30151#(<= 0 (+ 22 g_~x))} assume !(0 == ~x); {30151#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:03:17,141 INFO L290 TraceCheckUtils]: 116: Hoare triple {30151#(<= 0 (+ 22 g_~x))} assume ~x - 1 <= 2147483647; {30151#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:03:17,141 INFO L290 TraceCheckUtils]: 117: Hoare triple {30151#(<= 0 (+ 22 g_~x))} assume !(~x - 1 >= -2147483648); {30104#false} is VALID [2022-02-21 03:03:17,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:17,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:19,161 INFO L290 TraceCheckUtils]: 117: Hoare triple {30506#(<= 0 (+ 2147483647 g_~x))} assume !(~x - 1 >= -2147483648); {30104#false} is VALID [2022-02-21 03:03:19,162 INFO L290 TraceCheckUtils]: 116: Hoare triple {30506#(<= 0 (+ 2147483647 g_~x))} assume ~x - 1 <= 2147483647; {30506#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:03:19,162 INFO L290 TraceCheckUtils]: 115: Hoare triple {30506#(<= 0 (+ 2147483647 g_~x))} assume !(0 == ~x); {30506#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:03:19,163 INFO L290 TraceCheckUtils]: 114: Hoare triple {30516#(<= 0 (+ 2147483647 |g_#in~x|))} ~x := #in~x; {30506#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:03:19,163 INFO L272 TraceCheckUtils]: 113: Hoare triple {30520#(<= 0 (+ g_~x 2147483646))} call #t~ret0 := g(~x - 1); {30516#(<= 0 (+ 2147483647 |g_#in~x|))} is VALID [2022-02-21 03:03:19,163 INFO L290 TraceCheckUtils]: 112: Hoare triple {30520#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 >= -2147483648; {30520#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:03:19,164 INFO L290 TraceCheckUtils]: 111: Hoare triple {30520#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 <= 2147483647; {30520#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:03:19,164 INFO L290 TraceCheckUtils]: 110: Hoare triple {30520#(<= 0 (+ g_~x 2147483646))} assume !(0 == ~x); {30520#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:03:19,164 INFO L290 TraceCheckUtils]: 109: Hoare triple {30533#(<= 0 (+ |g_#in~x| 2147483646))} ~x := #in~x; {30520#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:03:19,165 INFO L272 TraceCheckUtils]: 108: Hoare triple {30537#(<= 0 (+ 2147483645 g_~x))} call #t~ret0 := g(~x - 1); {30533#(<= 0 (+ |g_#in~x| 2147483646))} is VALID [2022-02-21 03:03:19,165 INFO L290 TraceCheckUtils]: 107: Hoare triple {30537#(<= 0 (+ 2147483645 g_~x))} assume ~x - 1 >= -2147483648; {30537#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:03:19,165 INFO L290 TraceCheckUtils]: 106: Hoare triple {30537#(<= 0 (+ 2147483645 g_~x))} assume ~x - 1 <= 2147483647; {30537#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:03:19,165 INFO L290 TraceCheckUtils]: 105: Hoare triple {30537#(<= 0 (+ 2147483645 g_~x))} assume !(0 == ~x); {30537#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:03:19,166 INFO L290 TraceCheckUtils]: 104: Hoare triple {30550#(<= 0 (+ 2147483645 |g_#in~x|))} ~x := #in~x; {30537#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:03:19,166 INFO L272 TraceCheckUtils]: 103: Hoare triple {30554#(<= 0 (+ g_~x 2147483644))} call #t~ret0 := g(~x - 1); {30550#(<= 0 (+ 2147483645 |g_#in~x|))} is VALID [2022-02-21 03:03:19,166 INFO L290 TraceCheckUtils]: 102: Hoare triple {30554#(<= 0 (+ g_~x 2147483644))} assume ~x - 1 >= -2147483648; {30554#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:03:19,167 INFO L290 TraceCheckUtils]: 101: Hoare triple {30554#(<= 0 (+ g_~x 2147483644))} assume ~x - 1 <= 2147483647; {30554#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:03:19,167 INFO L290 TraceCheckUtils]: 100: Hoare triple {30554#(<= 0 (+ g_~x 2147483644))} assume !(0 == ~x); {30554#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:03:19,167 INFO L290 TraceCheckUtils]: 99: Hoare triple {30567#(<= 0 (+ |g_#in~x| 2147483644))} ~x := #in~x; {30554#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:03:19,168 INFO L272 TraceCheckUtils]: 98: Hoare triple {30571#(<= 0 (+ 2147483643 g_~x))} call #t~ret0 := g(~x - 1); {30567#(<= 0 (+ |g_#in~x| 2147483644))} is VALID [2022-02-21 03:03:19,168 INFO L290 TraceCheckUtils]: 97: Hoare triple {30571#(<= 0 (+ 2147483643 g_~x))} assume ~x - 1 >= -2147483648; {30571#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:03:19,168 INFO L290 TraceCheckUtils]: 96: Hoare triple {30571#(<= 0 (+ 2147483643 g_~x))} assume ~x - 1 <= 2147483647; {30571#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:03:19,169 INFO L290 TraceCheckUtils]: 95: Hoare triple {30571#(<= 0 (+ 2147483643 g_~x))} assume !(0 == ~x); {30571#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:03:19,169 INFO L290 TraceCheckUtils]: 94: Hoare triple {30584#(<= 0 (+ 2147483643 |g_#in~x|))} ~x := #in~x; {30571#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:03:19,169 INFO L272 TraceCheckUtils]: 93: Hoare triple {30588#(<= 0 (+ g_~x 2147483642))} call #t~ret0 := g(~x - 1); {30584#(<= 0 (+ 2147483643 |g_#in~x|))} is VALID [2022-02-21 03:03:19,170 INFO L290 TraceCheckUtils]: 92: Hoare triple {30588#(<= 0 (+ g_~x 2147483642))} assume ~x - 1 >= -2147483648; {30588#(<= 0 (+ g_~x 2147483642))} is VALID [2022-02-21 03:03:19,170 INFO L290 TraceCheckUtils]: 91: Hoare triple {30588#(<= 0 (+ g_~x 2147483642))} assume ~x - 1 <= 2147483647; {30588#(<= 0 (+ g_~x 2147483642))} is VALID [2022-02-21 03:03:19,170 INFO L290 TraceCheckUtils]: 90: Hoare triple {30588#(<= 0 (+ g_~x 2147483642))} assume !(0 == ~x); {30588#(<= 0 (+ g_~x 2147483642))} is VALID [2022-02-21 03:03:19,170 INFO L290 TraceCheckUtils]: 89: Hoare triple {30601#(<= 0 (+ |g_#in~x| 2147483642))} ~x := #in~x; {30588#(<= 0 (+ g_~x 2147483642))} is VALID [2022-02-21 03:03:19,171 INFO L272 TraceCheckUtils]: 88: Hoare triple {30605#(<= 0 (+ g_~x 2147483641))} call #t~ret0 := g(~x - 1); {30601#(<= 0 (+ |g_#in~x| 2147483642))} is VALID [2022-02-21 03:03:19,171 INFO L290 TraceCheckUtils]: 87: Hoare triple {30605#(<= 0 (+ g_~x 2147483641))} assume ~x - 1 >= -2147483648; {30605#(<= 0 (+ g_~x 2147483641))} is VALID [2022-02-21 03:03:19,171 INFO L290 TraceCheckUtils]: 86: Hoare triple {30605#(<= 0 (+ g_~x 2147483641))} assume ~x - 1 <= 2147483647; {30605#(<= 0 (+ g_~x 2147483641))} is VALID [2022-02-21 03:03:19,172 INFO L290 TraceCheckUtils]: 85: Hoare triple {30605#(<= 0 (+ g_~x 2147483641))} assume !(0 == ~x); {30605#(<= 0 (+ g_~x 2147483641))} is VALID [2022-02-21 03:03:19,172 INFO L290 TraceCheckUtils]: 84: Hoare triple {30618#(<= 0 (+ |g_#in~x| 2147483641))} ~x := #in~x; {30605#(<= 0 (+ g_~x 2147483641))} is VALID [2022-02-21 03:03:19,172 INFO L272 TraceCheckUtils]: 83: Hoare triple {30622#(<= 0 (+ g_~x 2147483640))} call #t~ret0 := g(~x - 1); {30618#(<= 0 (+ |g_#in~x| 2147483641))} is VALID [2022-02-21 03:03:19,173 INFO L290 TraceCheckUtils]: 82: Hoare triple {30622#(<= 0 (+ g_~x 2147483640))} assume ~x - 1 >= -2147483648; {30622#(<= 0 (+ g_~x 2147483640))} is VALID [2022-02-21 03:03:19,173 INFO L290 TraceCheckUtils]: 81: Hoare triple {30622#(<= 0 (+ g_~x 2147483640))} assume ~x - 1 <= 2147483647; {30622#(<= 0 (+ g_~x 2147483640))} is VALID [2022-02-21 03:03:19,173 INFO L290 TraceCheckUtils]: 80: Hoare triple {30622#(<= 0 (+ g_~x 2147483640))} assume !(0 == ~x); {30622#(<= 0 (+ g_~x 2147483640))} is VALID [2022-02-21 03:03:19,174 INFO L290 TraceCheckUtils]: 79: Hoare triple {30635#(<= 0 (+ |g_#in~x| 2147483640))} ~x := #in~x; {30622#(<= 0 (+ g_~x 2147483640))} is VALID [2022-02-21 03:03:19,174 INFO L272 TraceCheckUtils]: 78: Hoare triple {30639#(<= 0 (+ g_~x 2147483639))} call #t~ret0 := g(~x - 1); {30635#(<= 0 (+ |g_#in~x| 2147483640))} is VALID [2022-02-21 03:03:19,174 INFO L290 TraceCheckUtils]: 77: Hoare triple {30639#(<= 0 (+ g_~x 2147483639))} assume ~x - 1 >= -2147483648; {30639#(<= 0 (+ g_~x 2147483639))} is VALID [2022-02-21 03:03:19,174 INFO L290 TraceCheckUtils]: 76: Hoare triple {30639#(<= 0 (+ g_~x 2147483639))} assume ~x - 1 <= 2147483647; {30639#(<= 0 (+ g_~x 2147483639))} is VALID [2022-02-21 03:03:19,175 INFO L290 TraceCheckUtils]: 75: Hoare triple {30639#(<= 0 (+ g_~x 2147483639))} assume !(0 == ~x); {30639#(<= 0 (+ g_~x 2147483639))} is VALID [2022-02-21 03:03:19,175 INFO L290 TraceCheckUtils]: 74: Hoare triple {30652#(<= 0 (+ |g_#in~x| 2147483639))} ~x := #in~x; {30639#(<= 0 (+ g_~x 2147483639))} is VALID [2022-02-21 03:03:19,175 INFO L272 TraceCheckUtils]: 73: Hoare triple {30656#(<= 0 (+ 2147483638 g_~x))} call #t~ret0 := g(~x - 1); {30652#(<= 0 (+ |g_#in~x| 2147483639))} is VALID [2022-02-21 03:03:19,176 INFO L290 TraceCheckUtils]: 72: Hoare triple {30656#(<= 0 (+ 2147483638 g_~x))} assume ~x - 1 >= -2147483648; {30656#(<= 0 (+ 2147483638 g_~x))} is VALID [2022-02-21 03:03:19,176 INFO L290 TraceCheckUtils]: 71: Hoare triple {30656#(<= 0 (+ 2147483638 g_~x))} assume ~x - 1 <= 2147483647; {30656#(<= 0 (+ 2147483638 g_~x))} is VALID [2022-02-21 03:03:19,176 INFO L290 TraceCheckUtils]: 70: Hoare triple {30656#(<= 0 (+ 2147483638 g_~x))} assume !(0 == ~x); {30656#(<= 0 (+ 2147483638 g_~x))} is VALID [2022-02-21 03:03:19,177 INFO L290 TraceCheckUtils]: 69: Hoare triple {30669#(<= 0 (+ 2147483638 |g_#in~x|))} ~x := #in~x; {30656#(<= 0 (+ 2147483638 g_~x))} is VALID [2022-02-21 03:03:19,177 INFO L272 TraceCheckUtils]: 68: Hoare triple {30673#(<= 0 (+ g_~x 2147483637))} call #t~ret0 := g(~x - 1); {30669#(<= 0 (+ 2147483638 |g_#in~x|))} is VALID [2022-02-21 03:03:19,177 INFO L290 TraceCheckUtils]: 67: Hoare triple {30673#(<= 0 (+ g_~x 2147483637))} assume ~x - 1 >= -2147483648; {30673#(<= 0 (+ g_~x 2147483637))} is VALID [2022-02-21 03:03:19,178 INFO L290 TraceCheckUtils]: 66: Hoare triple {30673#(<= 0 (+ g_~x 2147483637))} assume ~x - 1 <= 2147483647; {30673#(<= 0 (+ g_~x 2147483637))} is VALID [2022-02-21 03:03:19,178 INFO L290 TraceCheckUtils]: 65: Hoare triple {30673#(<= 0 (+ g_~x 2147483637))} assume !(0 == ~x); {30673#(<= 0 (+ g_~x 2147483637))} is VALID [2022-02-21 03:03:19,178 INFO L290 TraceCheckUtils]: 64: Hoare triple {30686#(<= 0 (+ |g_#in~x| 2147483637))} ~x := #in~x; {30673#(<= 0 (+ g_~x 2147483637))} is VALID [2022-02-21 03:03:19,179 INFO L272 TraceCheckUtils]: 63: Hoare triple {30690#(<= 0 (+ g_~x 2147483636))} call #t~ret0 := g(~x - 1); {30686#(<= 0 (+ |g_#in~x| 2147483637))} is VALID [2022-02-21 03:03:19,179 INFO L290 TraceCheckUtils]: 62: Hoare triple {30690#(<= 0 (+ g_~x 2147483636))} assume ~x - 1 >= -2147483648; {30690#(<= 0 (+ g_~x 2147483636))} is VALID [2022-02-21 03:03:19,179 INFO L290 TraceCheckUtils]: 61: Hoare triple {30690#(<= 0 (+ g_~x 2147483636))} assume ~x - 1 <= 2147483647; {30690#(<= 0 (+ g_~x 2147483636))} is VALID [2022-02-21 03:03:19,179 INFO L290 TraceCheckUtils]: 60: Hoare triple {30690#(<= 0 (+ g_~x 2147483636))} assume !(0 == ~x); {30690#(<= 0 (+ g_~x 2147483636))} is VALID [2022-02-21 03:03:19,180 INFO L290 TraceCheckUtils]: 59: Hoare triple {30703#(<= 0 (+ |g_#in~x| 2147483636))} ~x := #in~x; {30690#(<= 0 (+ g_~x 2147483636))} is VALID [2022-02-21 03:03:19,180 INFO L272 TraceCheckUtils]: 58: Hoare triple {30707#(<= 0 (+ g_~x 2147483635))} call #t~ret0 := g(~x - 1); {30703#(<= 0 (+ |g_#in~x| 2147483636))} is VALID [2022-02-21 03:03:19,180 INFO L290 TraceCheckUtils]: 57: Hoare triple {30707#(<= 0 (+ g_~x 2147483635))} assume ~x - 1 >= -2147483648; {30707#(<= 0 (+ g_~x 2147483635))} is VALID [2022-02-21 03:03:19,181 INFO L290 TraceCheckUtils]: 56: Hoare triple {30707#(<= 0 (+ g_~x 2147483635))} assume ~x - 1 <= 2147483647; {30707#(<= 0 (+ g_~x 2147483635))} is VALID [2022-02-21 03:03:19,181 INFO L290 TraceCheckUtils]: 55: Hoare triple {30707#(<= 0 (+ g_~x 2147483635))} assume !(0 == ~x); {30707#(<= 0 (+ g_~x 2147483635))} is VALID [2022-02-21 03:03:19,181 INFO L290 TraceCheckUtils]: 54: Hoare triple {30720#(<= 0 (+ |g_#in~x| 2147483635))} ~x := #in~x; {30707#(<= 0 (+ g_~x 2147483635))} is VALID [2022-02-21 03:03:19,182 INFO L272 TraceCheckUtils]: 53: Hoare triple {30724#(<= 0 (+ g_~x 2147483634))} call #t~ret0 := g(~x - 1); {30720#(<= 0 (+ |g_#in~x| 2147483635))} is VALID [2022-02-21 03:03:19,182 INFO L290 TraceCheckUtils]: 52: Hoare triple {30724#(<= 0 (+ g_~x 2147483634))} assume ~x - 1 >= -2147483648; {30724#(<= 0 (+ g_~x 2147483634))} is VALID [2022-02-21 03:03:19,182 INFO L290 TraceCheckUtils]: 51: Hoare triple {30724#(<= 0 (+ g_~x 2147483634))} assume ~x - 1 <= 2147483647; {30724#(<= 0 (+ g_~x 2147483634))} is VALID [2022-02-21 03:03:19,183 INFO L290 TraceCheckUtils]: 50: Hoare triple {30724#(<= 0 (+ g_~x 2147483634))} assume !(0 == ~x); {30724#(<= 0 (+ g_~x 2147483634))} is VALID [2022-02-21 03:03:19,183 INFO L290 TraceCheckUtils]: 49: Hoare triple {30737#(<= 0 (+ |g_#in~x| 2147483634))} ~x := #in~x; {30724#(<= 0 (+ g_~x 2147483634))} is VALID [2022-02-21 03:03:19,183 INFO L272 TraceCheckUtils]: 48: Hoare triple {30741#(<= 0 (+ g_~x 2147483633))} call #t~ret0 := g(~x - 1); {30737#(<= 0 (+ |g_#in~x| 2147483634))} is VALID [2022-02-21 03:03:19,184 INFO L290 TraceCheckUtils]: 47: Hoare triple {30741#(<= 0 (+ g_~x 2147483633))} assume ~x - 1 >= -2147483648; {30741#(<= 0 (+ g_~x 2147483633))} is VALID [2022-02-21 03:03:19,184 INFO L290 TraceCheckUtils]: 46: Hoare triple {30741#(<= 0 (+ g_~x 2147483633))} assume ~x - 1 <= 2147483647; {30741#(<= 0 (+ g_~x 2147483633))} is VALID [2022-02-21 03:03:19,184 INFO L290 TraceCheckUtils]: 45: Hoare triple {30741#(<= 0 (+ g_~x 2147483633))} assume !(0 == ~x); {30741#(<= 0 (+ g_~x 2147483633))} is VALID [2022-02-21 03:03:19,184 INFO L290 TraceCheckUtils]: 44: Hoare triple {30754#(<= 0 (+ |g_#in~x| 2147483633))} ~x := #in~x; {30741#(<= 0 (+ g_~x 2147483633))} is VALID [2022-02-21 03:03:19,185 INFO L272 TraceCheckUtils]: 43: Hoare triple {30758#(<= 0 (+ 2147483632 g_~x))} call #t~ret0 := g(~x - 1); {30754#(<= 0 (+ |g_#in~x| 2147483633))} is VALID [2022-02-21 03:03:19,185 INFO L290 TraceCheckUtils]: 42: Hoare triple {30758#(<= 0 (+ 2147483632 g_~x))} assume ~x - 1 >= -2147483648; {30758#(<= 0 (+ 2147483632 g_~x))} is VALID [2022-02-21 03:03:19,185 INFO L290 TraceCheckUtils]: 41: Hoare triple {30758#(<= 0 (+ 2147483632 g_~x))} assume ~x - 1 <= 2147483647; {30758#(<= 0 (+ 2147483632 g_~x))} is VALID [2022-02-21 03:03:19,186 INFO L290 TraceCheckUtils]: 40: Hoare triple {30758#(<= 0 (+ 2147483632 g_~x))} assume !(0 == ~x); {30758#(<= 0 (+ 2147483632 g_~x))} is VALID [2022-02-21 03:03:19,186 INFO L290 TraceCheckUtils]: 39: Hoare triple {30771#(<= 0 (+ 2147483632 |g_#in~x|))} ~x := #in~x; {30758#(<= 0 (+ 2147483632 g_~x))} is VALID [2022-02-21 03:03:19,186 INFO L272 TraceCheckUtils]: 38: Hoare triple {30775#(<= 0 (+ g_~x 2147483631))} call #t~ret0 := g(~x - 1); {30771#(<= 0 (+ 2147483632 |g_#in~x|))} is VALID [2022-02-21 03:03:19,187 INFO L290 TraceCheckUtils]: 37: Hoare triple {30775#(<= 0 (+ g_~x 2147483631))} assume ~x - 1 >= -2147483648; {30775#(<= 0 (+ g_~x 2147483631))} is VALID [2022-02-21 03:03:19,187 INFO L290 TraceCheckUtils]: 36: Hoare triple {30775#(<= 0 (+ g_~x 2147483631))} assume ~x - 1 <= 2147483647; {30775#(<= 0 (+ g_~x 2147483631))} is VALID [2022-02-21 03:03:19,191 INFO L290 TraceCheckUtils]: 35: Hoare triple {30775#(<= 0 (+ g_~x 2147483631))} assume !(0 == ~x); {30775#(<= 0 (+ g_~x 2147483631))} is VALID [2022-02-21 03:03:19,192 INFO L290 TraceCheckUtils]: 34: Hoare triple {30788#(<= 0 (+ |g_#in~x| 2147483631))} ~x := #in~x; {30775#(<= 0 (+ g_~x 2147483631))} is VALID [2022-02-21 03:03:19,192 INFO L272 TraceCheckUtils]: 33: Hoare triple {30792#(<= 0 (+ g_~x 2147483630))} call #t~ret0 := g(~x - 1); {30788#(<= 0 (+ |g_#in~x| 2147483631))} is VALID [2022-02-21 03:03:19,192 INFO L290 TraceCheckUtils]: 32: Hoare triple {30792#(<= 0 (+ g_~x 2147483630))} assume ~x - 1 >= -2147483648; {30792#(<= 0 (+ g_~x 2147483630))} is VALID [2022-02-21 03:03:19,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {30792#(<= 0 (+ g_~x 2147483630))} assume ~x - 1 <= 2147483647; {30792#(<= 0 (+ g_~x 2147483630))} is VALID [2022-02-21 03:03:19,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {30792#(<= 0 (+ g_~x 2147483630))} assume !(0 == ~x); {30792#(<= 0 (+ g_~x 2147483630))} is VALID [2022-02-21 03:03:19,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {30805#(<= 0 (+ |g_#in~x| 2147483630))} ~x := #in~x; {30792#(<= 0 (+ g_~x 2147483630))} is VALID [2022-02-21 03:03:19,194 INFO L272 TraceCheckUtils]: 28: Hoare triple {30809#(<= 0 (+ g_~x 2147483629))} call #t~ret0 := g(~x - 1); {30805#(<= 0 (+ |g_#in~x| 2147483630))} is VALID [2022-02-21 03:03:19,194 INFO L290 TraceCheckUtils]: 27: Hoare triple {30809#(<= 0 (+ g_~x 2147483629))} assume ~x - 1 >= -2147483648; {30809#(<= 0 (+ g_~x 2147483629))} is VALID [2022-02-21 03:03:19,196 INFO L290 TraceCheckUtils]: 26: Hoare triple {30809#(<= 0 (+ g_~x 2147483629))} assume ~x - 1 <= 2147483647; {30809#(<= 0 (+ g_~x 2147483629))} is VALID [2022-02-21 03:03:19,196 INFO L290 TraceCheckUtils]: 25: Hoare triple {30809#(<= 0 (+ g_~x 2147483629))} assume !(0 == ~x); {30809#(<= 0 (+ g_~x 2147483629))} is VALID [2022-02-21 03:03:19,196 INFO L290 TraceCheckUtils]: 24: Hoare triple {30822#(<= 0 (+ |g_#in~x| 2147483629))} ~x := #in~x; {30809#(<= 0 (+ g_~x 2147483629))} is VALID [2022-02-21 03:03:19,197 INFO L272 TraceCheckUtils]: 23: Hoare triple {30826#(<= 0 (+ g_~x 2147483628))} call #t~ret0 := g(~x - 1); {30822#(<= 0 (+ |g_#in~x| 2147483629))} is VALID [2022-02-21 03:03:19,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {30826#(<= 0 (+ g_~x 2147483628))} assume ~x - 1 >= -2147483648; {30826#(<= 0 (+ g_~x 2147483628))} is VALID [2022-02-21 03:03:19,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {30826#(<= 0 (+ g_~x 2147483628))} assume ~x - 1 <= 2147483647; {30826#(<= 0 (+ g_~x 2147483628))} is VALID [2022-02-21 03:03:19,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {30826#(<= 0 (+ g_~x 2147483628))} assume !(0 == ~x); {30826#(<= 0 (+ g_~x 2147483628))} is VALID [2022-02-21 03:03:19,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {30839#(<= 0 (+ |g_#in~x| 2147483628))} ~x := #in~x; {30826#(<= 0 (+ g_~x 2147483628))} is VALID [2022-02-21 03:03:19,199 INFO L272 TraceCheckUtils]: 18: Hoare triple {30843#(<= 0 (+ g_~x 2147483627))} call #t~ret0 := g(~x - 1); {30839#(<= 0 (+ |g_#in~x| 2147483628))} is VALID [2022-02-21 03:03:19,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {30843#(<= 0 (+ g_~x 2147483627))} assume ~x - 1 >= -2147483648; {30843#(<= 0 (+ g_~x 2147483627))} is VALID [2022-02-21 03:03:19,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {30843#(<= 0 (+ g_~x 2147483627))} assume ~x - 1 <= 2147483647; {30843#(<= 0 (+ g_~x 2147483627))} is VALID [2022-02-21 03:03:19,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {30843#(<= 0 (+ g_~x 2147483627))} assume !(0 == ~x); {30843#(<= 0 (+ g_~x 2147483627))} is VALID [2022-02-21 03:03:19,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {30856#(<= 0 (+ |g_#in~x| 2147483627))} ~x := #in~x; {30843#(<= 0 (+ g_~x 2147483627))} is VALID [2022-02-21 03:03:19,200 INFO L272 TraceCheckUtils]: 13: Hoare triple {30860#(<= 0 (+ 2147483626 g_~x))} call #t~ret0 := g(~x - 1); {30856#(<= 0 (+ |g_#in~x| 2147483627))} is VALID [2022-02-21 03:03:19,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {30860#(<= 0 (+ 2147483626 g_~x))} assume ~x - 1 >= -2147483648; {30860#(<= 0 (+ 2147483626 g_~x))} is VALID [2022-02-21 03:03:19,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {30860#(<= 0 (+ 2147483626 g_~x))} assume ~x - 1 <= 2147483647; {30860#(<= 0 (+ 2147483626 g_~x))} is VALID [2022-02-21 03:03:19,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {30860#(<= 0 (+ 2147483626 g_~x))} assume !(0 == ~x); {30860#(<= 0 (+ 2147483626 g_~x))} is VALID [2022-02-21 03:03:19,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {30873#(<= 0 (+ 2147483626 |g_#in~x|))} ~x := #in~x; {30860#(<= 0 (+ 2147483626 g_~x))} is VALID [2022-02-21 03:03:19,202 INFO L272 TraceCheckUtils]: 8: Hoare triple {30877#(<= 0 (+ 2147483625 g_~x))} call #t~ret0 := g(~x - 1); {30873#(<= 0 (+ 2147483626 |g_#in~x|))} is VALID [2022-02-21 03:03:19,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {30877#(<= 0 (+ 2147483625 g_~x))} assume ~x - 1 >= -2147483648; {30877#(<= 0 (+ 2147483625 g_~x))} is VALID [2022-02-21 03:03:19,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {30877#(<= 0 (+ 2147483625 g_~x))} assume ~x - 1 <= 2147483647; {30877#(<= 0 (+ 2147483625 g_~x))} is VALID [2022-02-21 03:03:19,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {30877#(<= 0 (+ 2147483625 g_~x))} assume !(0 == ~x); {30877#(<= 0 (+ 2147483625 g_~x))} is VALID [2022-02-21 03:03:19,203 INFO L290 TraceCheckUtils]: 4: Hoare triple {30890#(<= 0 (+ 2147483625 |g_#in~x|))} ~x := #in~x; {30877#(<= 0 (+ 2147483625 g_~x))} is VALID [2022-02-21 03:03:19,203 INFO L272 TraceCheckUtils]: 3: Hoare triple {30894#(<= 0 (+ 2147483625 |ULTIMATE.start_main_~x~0#1|))} call main_#t~ret3#1 := g(main_~x~0#1); {30890#(<= 0 (+ 2147483625 |g_#in~x|))} is VALID [2022-02-21 03:03:19,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {30103#true} assume !(main_~x~0#1 < 0); {30894#(<= 0 (+ 2147483625 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:03:19,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {30103#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {30103#true} is VALID [2022-02-21 03:03:19,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {30103#true} assume { :begin_inline_ULTIMATE.init } true; {30103#true} is VALID [2022-02-21 03:03:19,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:19,205 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786478298] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:19,205 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:19,205 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2022-02-21 03:03:19,205 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742721830] [2022-02-21 03:03:19,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:19,206 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 93 states have (on average 2.021505376344086) internal successors, (188), 50 states have internal predecessors, (188), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-02-21 03:03:19,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:19,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 96 states, 93 states have (on average 2.021505376344086) internal successors, (188), 50 states have internal predecessors, (188), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:19,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:19,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-02-21 03:03:19,335 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:19,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-02-21 03:03:19,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2260, Invalid=6860, Unknown=0, NotChecked=0, Total=9120 [2022-02-21 03:03:19,338 INFO L87 Difference]: Start difference. First operand 824 states and 961 transitions. Second operand has 96 states, 93 states have (on average 2.021505376344086) internal successors, (188), 50 states have internal predecessors, (188), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:27,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:27,641 INFO L93 Difference]: Finished difference Result 1259 states and 1559 transitions. [2022-02-21 03:03:27,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2022-02-21 03:03:27,642 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 93 states have (on average 2.021505376344086) internal successors, (188), 50 states have internal predecessors, (188), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-02-21 03:03:27,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:27,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 93 states have (on average 2.021505376344086) internal successors, (188), 50 states have internal predecessors, (188), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:27,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 819 transitions. [2022-02-21 03:03:27,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 93 states have (on average 2.021505376344086) internal successors, (188), 50 states have internal predecessors, (188), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:27,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 819 transitions. [2022-02-21 03:03:27,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 141 states and 819 transitions. [2022-02-21 03:03:28,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 819 edges. 819 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:28,279 INFO L225 Difference]: With dead ends: 1259 [2022-02-21 03:03:28,279 INFO L226 Difference]: Without dead ends: 1258 [2022-02-21 03:03:28,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8243 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=10631, Invalid=23779, Unknown=0, NotChecked=0, Total=34410 [2022-02-21 03:03:28,283 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 2116 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 1193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2120 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 2452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1193 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:28,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2120 Valid, 815 Invalid, 2452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1193 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-02-21 03:03:28,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2022-02-21 03:03:29,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2022-02-21 03:03:29,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:29,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1258 states. Second operand has 1256 states, 908 states have (on average 1.077092511013216) internal successors, (978), 976 states have internal predecessors, (978), 210 states have call successors, (210), 71 states have call predecessors, (210), 137 states have return successors, (277), 208 states have call predecessors, (277), 208 states have call successors, (277) [2022-02-21 03:03:29,078 INFO L74 IsIncluded]: Start isIncluded. First operand 1258 states. Second operand has 1256 states, 908 states have (on average 1.077092511013216) internal successors, (978), 976 states have internal predecessors, (978), 210 states have call successors, (210), 71 states have call predecessors, (210), 137 states have return successors, (277), 208 states have call predecessors, (277), 208 states have call successors, (277) [2022-02-21 03:03:29,079 INFO L87 Difference]: Start difference. First operand 1258 states. Second operand has 1256 states, 908 states have (on average 1.077092511013216) internal successors, (978), 976 states have internal predecessors, (978), 210 states have call successors, (210), 71 states have call predecessors, (210), 137 states have return successors, (277), 208 states have call predecessors, (277), 208 states have call successors, (277) [2022-02-21 03:03:29,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:29,132 INFO L93 Difference]: Finished difference Result 1258 states and 1535 transitions. [2022-02-21 03:03:29,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1535 transitions. [2022-02-21 03:03:29,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:29,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:29,138 INFO L74 IsIncluded]: Start isIncluded. First operand has 1256 states, 908 states have (on average 1.077092511013216) internal successors, (978), 976 states have internal predecessors, (978), 210 states have call successors, (210), 71 states have call predecessors, (210), 137 states have return successors, (277), 208 states have call predecessors, (277), 208 states have call successors, (277) Second operand 1258 states. [2022-02-21 03:03:29,139 INFO L87 Difference]: Start difference. First operand has 1256 states, 908 states have (on average 1.077092511013216) internal successors, (978), 976 states have internal predecessors, (978), 210 states have call successors, (210), 71 states have call predecessors, (210), 137 states have return successors, (277), 208 states have call predecessors, (277), 208 states have call successors, (277) Second operand 1258 states. [2022-02-21 03:03:29,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:29,207 INFO L93 Difference]: Finished difference Result 1258 states and 1535 transitions. [2022-02-21 03:03:29,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1535 transitions. [2022-02-21 03:03:29,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:29,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:29,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:29,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:29,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 908 states have (on average 1.077092511013216) internal successors, (978), 976 states have internal predecessors, (978), 210 states have call successors, (210), 71 states have call predecessors, (210), 137 states have return successors, (277), 208 states have call predecessors, (277), 208 states have call successors, (277) [2022-02-21 03:03:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1465 transitions. [2022-02-21 03:03:29,279 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1465 transitions. Word has length 118 [2022-02-21 03:03:29,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:29,279 INFO L470 AbstractCegarLoop]: Abstraction has 1256 states and 1465 transitions. [2022-02-21 03:03:29,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 93 states have (on average 2.021505376344086) internal successors, (188), 50 states have internal predecessors, (188), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:29,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1465 transitions. [2022-02-21 03:03:29,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-02-21 03:03:29,282 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:29,282 INFO L514 BasicCegarLoop]: trace histogram [27, 25, 25, 24, 24, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:29,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:03:29,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:29,500 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:03:29,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:29,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1138811825, now seen corresponding path program 5 times [2022-02-21 03:03:29,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:29,500 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872437175] [2022-02-21 03:03:29,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:29,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:30,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:03:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:30,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 03:03:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:30,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {36676#true} ~x := #in~x; {36676#true} is VALID [2022-02-21 03:03:30,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {36676#true} assume 0 == ~x;#res := 1; {36676#true} is VALID [2022-02-21 03:03:30,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {36676#true} assume true; {36676#true} is VALID [2022-02-21 03:03:30,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36676#true} {36676#true} #32#return; {36676#true} is VALID [2022-02-21 03:03:30,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:03:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:30,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {36676#true} ~x := #in~x; {36676#true} is VALID [2022-02-21 03:03:30,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {36676#true} assume 0 == ~x;#res := 1; {36754#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:30,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {36754#(<= 1 |g_#res|)} assume true; {36754#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:30,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36754#(<= 1 |g_#res|)} {36676#true} #34#return; {36753#(<= 1 |g_#t~ret1|)} is VALID [2022-02-21 03:03:30,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {36676#true} ~x := #in~x; {36676#true} is VALID [2022-02-21 03:03:30,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {36676#true} assume !(0 == ~x); {36676#true} is VALID [2022-02-21 03:03:30,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {36676#true} assume ~x - 1 <= 2147483647; {36676#true} is VALID [2022-02-21 03:03:30,338 INFO L290 TraceCheckUtils]: 3: Hoare triple {36676#true} assume ~x - 1 >= -2147483648; {36676#true} is VALID [2022-02-21 03:03:30,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {36676#true} call #t~ret0 := g(~x - 1); {36676#true} is VALID [2022-02-21 03:03:30,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {36676#true} ~x := #in~x; {36676#true} is VALID [2022-02-21 03:03:30,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {36676#true} assume 0 == ~x;#res := 1; {36676#true} is VALID [2022-02-21 03:03:30,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {36676#true} assume true; {36676#true} is VALID [2022-02-21 03:03:30,339 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {36676#true} {36676#true} #32#return; {36676#true} is VALID [2022-02-21 03:03:30,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {36676#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {36676#true} is VALID [2022-02-21 03:03:30,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {36676#true} assume #t~ret0 - 1 <= 2147483647; {36676#true} is VALID [2022-02-21 03:03:30,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {36676#true} assume #t~ret0 - 1 >= -2147483648; {36676#true} is VALID [2022-02-21 03:03:30,339 INFO L272 TraceCheckUtils]: 12: Hoare triple {36676#true} call #t~ret1 := g(#t~ret0 - 1); {36676#true} is VALID [2022-02-21 03:03:30,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {36676#true} ~x := #in~x; {36676#true} is VALID [2022-02-21 03:03:30,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {36676#true} assume 0 == ~x;#res := 1; {36754#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:30,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {36754#(<= 1 |g_#res|)} assume true; {36754#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:30,340 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36754#(<= 1 |g_#res|)} {36676#true} #34#return; {36753#(<= 1 |g_#t~ret1|)} is VALID [2022-02-21 03:03:30,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {36753#(<= 1 |g_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret0;havoc #t~ret1; {36754#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:30,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {36754#(<= 1 |g_#res|)} assume true; {36754#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:30,342 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {36754#(<= 1 |g_#res|)} {36676#true} #32#return; {36698#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:03:30,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {36676#true} assume { :begin_inline_ULTIMATE.init } true; {36676#true} is VALID [2022-02-21 03:03:30,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {36676#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {36676#true} is VALID [2022-02-21 03:03:30,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {36676#true} assume !(main_~x~0#1 < 0); {36676#true} is VALID [2022-02-21 03:03:30,342 INFO L272 TraceCheckUtils]: 3: Hoare triple {36676#true} call main_#t~ret3#1 := g(main_~x~0#1); {36676#true} is VALID [2022-02-21 03:03:30,342 INFO L290 TraceCheckUtils]: 4: Hoare triple {36676#true} ~x := #in~x; {36676#true} is VALID [2022-02-21 03:03:30,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {36676#true} assume !(0 == ~x); {36676#true} is VALID [2022-02-21 03:03:30,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {36676#true} assume ~x - 1 <= 2147483647; {36676#true} is VALID [2022-02-21 03:03:30,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {36676#true} assume ~x - 1 >= -2147483648; {36676#true} is VALID [2022-02-21 03:03:30,343 INFO L272 TraceCheckUtils]: 8: Hoare triple {36676#true} call #t~ret0 := g(~x - 1); {36676#true} is VALID [2022-02-21 03:03:30,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {36676#true} ~x := #in~x; {36676#true} is VALID [2022-02-21 03:03:30,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {36676#true} assume !(0 == ~x); {36676#true} is VALID [2022-02-21 03:03:30,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {36676#true} assume ~x - 1 <= 2147483647; {36676#true} is VALID [2022-02-21 03:03:30,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {36676#true} assume ~x - 1 >= -2147483648; {36676#true} is VALID [2022-02-21 03:03:30,343 INFO L272 TraceCheckUtils]: 13: Hoare triple {36676#true} call #t~ret0 := g(~x - 1); {36676#true} is VALID [2022-02-21 03:03:30,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {36676#true} ~x := #in~x; {36676#true} is VALID [2022-02-21 03:03:30,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {36676#true} assume 0 == ~x;#res := 1; {36676#true} is VALID [2022-02-21 03:03:30,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {36676#true} assume true; {36676#true} is VALID [2022-02-21 03:03:30,344 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {36676#true} {36676#true} #32#return; {36676#true} is VALID [2022-02-21 03:03:30,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {36676#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {36676#true} is VALID [2022-02-21 03:03:30,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {36676#true} assume #t~ret0 - 1 <= 2147483647; {36676#true} is VALID [2022-02-21 03:03:30,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {36676#true} assume #t~ret0 - 1 >= -2147483648; {36676#true} is VALID [2022-02-21 03:03:30,344 INFO L272 TraceCheckUtils]: 21: Hoare triple {36676#true} call #t~ret1 := g(#t~ret0 - 1); {36676#true} is VALID [2022-02-21 03:03:30,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {36676#true} ~x := #in~x; {36676#true} is VALID [2022-02-21 03:03:30,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {36676#true} assume 0 == ~x;#res := 1; {36754#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:30,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {36754#(<= 1 |g_#res|)} assume true; {36754#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:30,346 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {36754#(<= 1 |g_#res|)} {36676#true} #34#return; {36753#(<= 1 |g_#t~ret1|)} is VALID [2022-02-21 03:03:30,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {36753#(<= 1 |g_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret0;havoc #t~ret1; {36754#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:30,347 INFO L290 TraceCheckUtils]: 27: Hoare triple {36754#(<= 1 |g_#res|)} assume true; {36754#(<= 1 |g_#res|)} is VALID [2022-02-21 03:03:30,347 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {36754#(<= 1 |g_#res|)} {36676#true} #32#return; {36698#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:03:30,347 INFO L290 TraceCheckUtils]: 29: Hoare triple {36698#(<= 1 |g_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {36698#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:03:30,348 INFO L290 TraceCheckUtils]: 30: Hoare triple {36698#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 <= 2147483647; {36698#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:03:30,348 INFO L290 TraceCheckUtils]: 31: Hoare triple {36698#(<= 1 |g_#t~ret0|)} assume #t~ret0 - 1 >= -2147483648; {36698#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:03:30,349 INFO L272 TraceCheckUtils]: 32: Hoare triple {36698#(<= 1 |g_#t~ret0|)} call #t~ret1 := g(#t~ret0 - 1); {36699#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:03:30,349 INFO L290 TraceCheckUtils]: 33: Hoare triple {36699#(<= 0 |g_#in~x|)} ~x := #in~x; {36700#(<= 0 g_~x)} is VALID [2022-02-21 03:03:30,349 INFO L290 TraceCheckUtils]: 34: Hoare triple {36700#(<= 0 g_~x)} assume !(0 == ~x); {36700#(<= 0 g_~x)} is VALID [2022-02-21 03:03:30,350 INFO L290 TraceCheckUtils]: 35: Hoare triple {36700#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {36700#(<= 0 g_~x)} is VALID [2022-02-21 03:03:30,350 INFO L290 TraceCheckUtils]: 36: Hoare triple {36700#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {36700#(<= 0 g_~x)} is VALID [2022-02-21 03:03:30,351 INFO L272 TraceCheckUtils]: 37: Hoare triple {36700#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {36701#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:03:30,351 INFO L290 TraceCheckUtils]: 38: Hoare triple {36701#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {36702#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:30,351 INFO L290 TraceCheckUtils]: 39: Hoare triple {36702#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {36702#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:30,352 INFO L290 TraceCheckUtils]: 40: Hoare triple {36702#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {36702#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:30,352 INFO L290 TraceCheckUtils]: 41: Hoare triple {36702#(<= 0 (+ g_~x 1))} assume ~x - 1 >= -2147483648; {36702#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:30,353 INFO L272 TraceCheckUtils]: 42: Hoare triple {36702#(<= 0 (+ g_~x 1))} call #t~ret0 := g(~x - 1); {36703#(<= 0 (+ |g_#in~x| 2))} is VALID [2022-02-21 03:03:30,353 INFO L290 TraceCheckUtils]: 43: Hoare triple {36703#(<= 0 (+ |g_#in~x| 2))} ~x := #in~x; {36704#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:30,354 INFO L290 TraceCheckUtils]: 44: Hoare triple {36704#(<= 0 (+ 2 g_~x))} assume !(0 == ~x); {36704#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:30,354 INFO L290 TraceCheckUtils]: 45: Hoare triple {36704#(<= 0 (+ 2 g_~x))} assume ~x - 1 <= 2147483647; {36704#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:30,354 INFO L290 TraceCheckUtils]: 46: Hoare triple {36704#(<= 0 (+ 2 g_~x))} assume ~x - 1 >= -2147483648; {36704#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:30,355 INFO L272 TraceCheckUtils]: 47: Hoare triple {36704#(<= 0 (+ 2 g_~x))} call #t~ret0 := g(~x - 1); {36705#(<= 0 (+ |g_#in~x| 3))} is VALID [2022-02-21 03:03:30,355 INFO L290 TraceCheckUtils]: 48: Hoare triple {36705#(<= 0 (+ |g_#in~x| 3))} ~x := #in~x; {36706#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:30,356 INFO L290 TraceCheckUtils]: 49: Hoare triple {36706#(<= 0 (+ 3 g_~x))} assume !(0 == ~x); {36706#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:30,356 INFO L290 TraceCheckUtils]: 50: Hoare triple {36706#(<= 0 (+ 3 g_~x))} assume ~x - 1 <= 2147483647; {36706#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:30,357 INFO L290 TraceCheckUtils]: 51: Hoare triple {36706#(<= 0 (+ 3 g_~x))} assume ~x - 1 >= -2147483648; {36706#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:30,357 INFO L272 TraceCheckUtils]: 52: Hoare triple {36706#(<= 0 (+ 3 g_~x))} call #t~ret0 := g(~x - 1); {36707#(<= 0 (+ |g_#in~x| 4))} is VALID [2022-02-21 03:03:30,358 INFO L290 TraceCheckUtils]: 53: Hoare triple {36707#(<= 0 (+ |g_#in~x| 4))} ~x := #in~x; {36708#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:30,358 INFO L290 TraceCheckUtils]: 54: Hoare triple {36708#(<= 0 (+ g_~x 4))} assume !(0 == ~x); {36708#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:30,358 INFO L290 TraceCheckUtils]: 55: Hoare triple {36708#(<= 0 (+ g_~x 4))} assume ~x - 1 <= 2147483647; {36708#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:30,359 INFO L290 TraceCheckUtils]: 56: Hoare triple {36708#(<= 0 (+ g_~x 4))} assume ~x - 1 >= -2147483648; {36708#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:30,359 INFO L272 TraceCheckUtils]: 57: Hoare triple {36708#(<= 0 (+ g_~x 4))} call #t~ret0 := g(~x - 1); {36709#(<= 0 (+ 5 |g_#in~x|))} is VALID [2022-02-21 03:03:30,360 INFO L290 TraceCheckUtils]: 58: Hoare triple {36709#(<= 0 (+ 5 |g_#in~x|))} ~x := #in~x; {36710#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:30,360 INFO L290 TraceCheckUtils]: 59: Hoare triple {36710#(<= 0 (+ 5 g_~x))} assume !(0 == ~x); {36710#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:30,360 INFO L290 TraceCheckUtils]: 60: Hoare triple {36710#(<= 0 (+ 5 g_~x))} assume ~x - 1 <= 2147483647; {36710#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:30,361 INFO L290 TraceCheckUtils]: 61: Hoare triple {36710#(<= 0 (+ 5 g_~x))} assume ~x - 1 >= -2147483648; {36710#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:30,361 INFO L272 TraceCheckUtils]: 62: Hoare triple {36710#(<= 0 (+ 5 g_~x))} call #t~ret0 := g(~x - 1); {36711#(<= 0 (+ |g_#in~x| 6))} is VALID [2022-02-21 03:03:30,362 INFO L290 TraceCheckUtils]: 63: Hoare triple {36711#(<= 0 (+ |g_#in~x| 6))} ~x := #in~x; {36712#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:30,362 INFO L290 TraceCheckUtils]: 64: Hoare triple {36712#(<= 0 (+ 6 g_~x))} assume !(0 == ~x); {36712#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:30,362 INFO L290 TraceCheckUtils]: 65: Hoare triple {36712#(<= 0 (+ 6 g_~x))} assume ~x - 1 <= 2147483647; {36712#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:30,363 INFO L290 TraceCheckUtils]: 66: Hoare triple {36712#(<= 0 (+ 6 g_~x))} assume ~x - 1 >= -2147483648; {36712#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:30,363 INFO L272 TraceCheckUtils]: 67: Hoare triple {36712#(<= 0 (+ 6 g_~x))} call #t~ret0 := g(~x - 1); {36713#(<= 0 (+ 7 |g_#in~x|))} is VALID [2022-02-21 03:03:30,364 INFO L290 TraceCheckUtils]: 68: Hoare triple {36713#(<= 0 (+ 7 |g_#in~x|))} ~x := #in~x; {36714#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:30,364 INFO L290 TraceCheckUtils]: 69: Hoare triple {36714#(<= 0 (+ 7 g_~x))} assume !(0 == ~x); {36714#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:30,364 INFO L290 TraceCheckUtils]: 70: Hoare triple {36714#(<= 0 (+ 7 g_~x))} assume ~x - 1 <= 2147483647; {36714#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:30,365 INFO L290 TraceCheckUtils]: 71: Hoare triple {36714#(<= 0 (+ 7 g_~x))} assume ~x - 1 >= -2147483648; {36714#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:30,365 INFO L272 TraceCheckUtils]: 72: Hoare triple {36714#(<= 0 (+ 7 g_~x))} call #t~ret0 := g(~x - 1); {36715#(<= 0 (+ |g_#in~x| 8))} is VALID [2022-02-21 03:03:30,366 INFO L290 TraceCheckUtils]: 73: Hoare triple {36715#(<= 0 (+ |g_#in~x| 8))} ~x := #in~x; {36716#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:30,366 INFO L290 TraceCheckUtils]: 74: Hoare triple {36716#(<= 0 (+ g_~x 8))} assume !(0 == ~x); {36716#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:30,366 INFO L290 TraceCheckUtils]: 75: Hoare triple {36716#(<= 0 (+ g_~x 8))} assume ~x - 1 <= 2147483647; {36716#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:30,366 INFO L290 TraceCheckUtils]: 76: Hoare triple {36716#(<= 0 (+ g_~x 8))} assume ~x - 1 >= -2147483648; {36716#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:30,367 INFO L272 TraceCheckUtils]: 77: Hoare triple {36716#(<= 0 (+ g_~x 8))} call #t~ret0 := g(~x - 1); {36717#(<= 0 (+ |g_#in~x| 9))} is VALID [2022-02-21 03:03:30,367 INFO L290 TraceCheckUtils]: 78: Hoare triple {36717#(<= 0 (+ |g_#in~x| 9))} ~x := #in~x; {36718#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:30,368 INFO L290 TraceCheckUtils]: 79: Hoare triple {36718#(<= 0 (+ 9 g_~x))} assume !(0 == ~x); {36718#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:30,368 INFO L290 TraceCheckUtils]: 80: Hoare triple {36718#(<= 0 (+ 9 g_~x))} assume ~x - 1 <= 2147483647; {36718#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:30,369 INFO L290 TraceCheckUtils]: 81: Hoare triple {36718#(<= 0 (+ 9 g_~x))} assume ~x - 1 >= -2147483648; {36718#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:30,369 INFO L272 TraceCheckUtils]: 82: Hoare triple {36718#(<= 0 (+ 9 g_~x))} call #t~ret0 := g(~x - 1); {36719#(<= 0 (+ |g_#in~x| 10))} is VALID [2022-02-21 03:03:30,369 INFO L290 TraceCheckUtils]: 83: Hoare triple {36719#(<= 0 (+ |g_#in~x| 10))} ~x := #in~x; {36720#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:30,370 INFO L290 TraceCheckUtils]: 84: Hoare triple {36720#(<= 0 (+ g_~x 10))} assume !(0 == ~x); {36720#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:30,370 INFO L290 TraceCheckUtils]: 85: Hoare triple {36720#(<= 0 (+ g_~x 10))} assume ~x - 1 <= 2147483647; {36720#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:30,370 INFO L290 TraceCheckUtils]: 86: Hoare triple {36720#(<= 0 (+ g_~x 10))} assume ~x - 1 >= -2147483648; {36720#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:30,371 INFO L272 TraceCheckUtils]: 87: Hoare triple {36720#(<= 0 (+ g_~x 10))} call #t~ret0 := g(~x - 1); {36721#(<= 0 (+ |g_#in~x| 11))} is VALID [2022-02-21 03:03:30,371 INFO L290 TraceCheckUtils]: 88: Hoare triple {36721#(<= 0 (+ |g_#in~x| 11))} ~x := #in~x; {36722#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:03:30,371 INFO L290 TraceCheckUtils]: 89: Hoare triple {36722#(<= 0 (+ g_~x 11))} assume !(0 == ~x); {36722#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:03:30,372 INFO L290 TraceCheckUtils]: 90: Hoare triple {36722#(<= 0 (+ g_~x 11))} assume ~x - 1 <= 2147483647; {36722#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:03:30,372 INFO L290 TraceCheckUtils]: 91: Hoare triple {36722#(<= 0 (+ g_~x 11))} assume ~x - 1 >= -2147483648; {36722#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:03:30,372 INFO L272 TraceCheckUtils]: 92: Hoare triple {36722#(<= 0 (+ g_~x 11))} call #t~ret0 := g(~x - 1); {36723#(<= 0 (+ |g_#in~x| 12))} is VALID [2022-02-21 03:03:30,373 INFO L290 TraceCheckUtils]: 93: Hoare triple {36723#(<= 0 (+ |g_#in~x| 12))} ~x := #in~x; {36724#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:03:30,373 INFO L290 TraceCheckUtils]: 94: Hoare triple {36724#(<= 0 (+ g_~x 12))} assume !(0 == ~x); {36724#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:03:30,373 INFO L290 TraceCheckUtils]: 95: Hoare triple {36724#(<= 0 (+ g_~x 12))} assume ~x - 1 <= 2147483647; {36724#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:03:30,374 INFO L290 TraceCheckUtils]: 96: Hoare triple {36724#(<= 0 (+ g_~x 12))} assume ~x - 1 >= -2147483648; {36724#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:03:30,374 INFO L272 TraceCheckUtils]: 97: Hoare triple {36724#(<= 0 (+ g_~x 12))} call #t~ret0 := g(~x - 1); {36725#(<= 0 (+ |g_#in~x| 13))} is VALID [2022-02-21 03:03:30,375 INFO L290 TraceCheckUtils]: 98: Hoare triple {36725#(<= 0 (+ |g_#in~x| 13))} ~x := #in~x; {36726#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:03:30,375 INFO L290 TraceCheckUtils]: 99: Hoare triple {36726#(<= 0 (+ g_~x 13))} assume !(0 == ~x); {36726#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:03:30,375 INFO L290 TraceCheckUtils]: 100: Hoare triple {36726#(<= 0 (+ g_~x 13))} assume ~x - 1 <= 2147483647; {36726#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:03:30,376 INFO L290 TraceCheckUtils]: 101: Hoare triple {36726#(<= 0 (+ g_~x 13))} assume ~x - 1 >= -2147483648; {36726#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:03:30,376 INFO L272 TraceCheckUtils]: 102: Hoare triple {36726#(<= 0 (+ g_~x 13))} call #t~ret0 := g(~x - 1); {36727#(<= 0 (+ |g_#in~x| 14))} is VALID [2022-02-21 03:03:30,377 INFO L290 TraceCheckUtils]: 103: Hoare triple {36727#(<= 0 (+ |g_#in~x| 14))} ~x := #in~x; {36728#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:03:30,377 INFO L290 TraceCheckUtils]: 104: Hoare triple {36728#(<= 0 (+ 14 g_~x))} assume !(0 == ~x); {36728#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:03:30,377 INFO L290 TraceCheckUtils]: 105: Hoare triple {36728#(<= 0 (+ 14 g_~x))} assume ~x - 1 <= 2147483647; {36728#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:03:30,378 INFO L290 TraceCheckUtils]: 106: Hoare triple {36728#(<= 0 (+ 14 g_~x))} assume ~x - 1 >= -2147483648; {36728#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:03:30,378 INFO L272 TraceCheckUtils]: 107: Hoare triple {36728#(<= 0 (+ 14 g_~x))} call #t~ret0 := g(~x - 1); {36729#(<= 0 (+ |g_#in~x| 15))} is VALID [2022-02-21 03:03:30,379 INFO L290 TraceCheckUtils]: 108: Hoare triple {36729#(<= 0 (+ |g_#in~x| 15))} ~x := #in~x; {36730#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:03:30,379 INFO L290 TraceCheckUtils]: 109: Hoare triple {36730#(<= 0 (+ g_~x 15))} assume !(0 == ~x); {36730#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:03:30,379 INFO L290 TraceCheckUtils]: 110: Hoare triple {36730#(<= 0 (+ g_~x 15))} assume ~x - 1 <= 2147483647; {36730#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:03:30,380 INFO L290 TraceCheckUtils]: 111: Hoare triple {36730#(<= 0 (+ g_~x 15))} assume ~x - 1 >= -2147483648; {36730#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:03:30,380 INFO L272 TraceCheckUtils]: 112: Hoare triple {36730#(<= 0 (+ g_~x 15))} call #t~ret0 := g(~x - 1); {36731#(<= 0 (+ |g_#in~x| 16))} is VALID [2022-02-21 03:03:30,381 INFO L290 TraceCheckUtils]: 113: Hoare triple {36731#(<= 0 (+ |g_#in~x| 16))} ~x := #in~x; {36732#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:03:30,381 INFO L290 TraceCheckUtils]: 114: Hoare triple {36732#(<= 0 (+ 16 g_~x))} assume !(0 == ~x); {36732#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:03:30,381 INFO L290 TraceCheckUtils]: 115: Hoare triple {36732#(<= 0 (+ 16 g_~x))} assume ~x - 1 <= 2147483647; {36732#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:03:30,382 INFO L290 TraceCheckUtils]: 116: Hoare triple {36732#(<= 0 (+ 16 g_~x))} assume ~x - 1 >= -2147483648; {36732#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:03:30,382 INFO L272 TraceCheckUtils]: 117: Hoare triple {36732#(<= 0 (+ 16 g_~x))} call #t~ret0 := g(~x - 1); {36733#(<= 0 (+ |g_#in~x| 17))} is VALID [2022-02-21 03:03:30,383 INFO L290 TraceCheckUtils]: 118: Hoare triple {36733#(<= 0 (+ |g_#in~x| 17))} ~x := #in~x; {36734#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:03:30,383 INFO L290 TraceCheckUtils]: 119: Hoare triple {36734#(<= 0 (+ g_~x 17))} assume !(0 == ~x); {36734#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:03:30,383 INFO L290 TraceCheckUtils]: 120: Hoare triple {36734#(<= 0 (+ g_~x 17))} assume ~x - 1 <= 2147483647; {36734#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:03:30,384 INFO L290 TraceCheckUtils]: 121: Hoare triple {36734#(<= 0 (+ g_~x 17))} assume ~x - 1 >= -2147483648; {36734#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:03:30,384 INFO L272 TraceCheckUtils]: 122: Hoare triple {36734#(<= 0 (+ g_~x 17))} call #t~ret0 := g(~x - 1); {36735#(<= 0 (+ |g_#in~x| 18))} is VALID [2022-02-21 03:03:30,385 INFO L290 TraceCheckUtils]: 123: Hoare triple {36735#(<= 0 (+ |g_#in~x| 18))} ~x := #in~x; {36736#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:03:30,385 INFO L290 TraceCheckUtils]: 124: Hoare triple {36736#(<= 0 (+ g_~x 18))} assume !(0 == ~x); {36736#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:03:30,385 INFO L290 TraceCheckUtils]: 125: Hoare triple {36736#(<= 0 (+ g_~x 18))} assume ~x - 1 <= 2147483647; {36736#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:03:30,386 INFO L290 TraceCheckUtils]: 126: Hoare triple {36736#(<= 0 (+ g_~x 18))} assume ~x - 1 >= -2147483648; {36736#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:03:30,386 INFO L272 TraceCheckUtils]: 127: Hoare triple {36736#(<= 0 (+ g_~x 18))} call #t~ret0 := g(~x - 1); {36737#(<= 0 (+ 19 |g_#in~x|))} is VALID [2022-02-21 03:03:30,386 INFO L290 TraceCheckUtils]: 128: Hoare triple {36737#(<= 0 (+ 19 |g_#in~x|))} ~x := #in~x; {36738#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:03:30,387 INFO L290 TraceCheckUtils]: 129: Hoare triple {36738#(<= 0 (+ 19 g_~x))} assume !(0 == ~x); {36738#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:03:30,387 INFO L290 TraceCheckUtils]: 130: Hoare triple {36738#(<= 0 (+ 19 g_~x))} assume ~x - 1 <= 2147483647; {36738#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:03:30,387 INFO L290 TraceCheckUtils]: 131: Hoare triple {36738#(<= 0 (+ 19 g_~x))} assume ~x - 1 >= -2147483648; {36738#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:03:30,388 INFO L272 TraceCheckUtils]: 132: Hoare triple {36738#(<= 0 (+ 19 g_~x))} call #t~ret0 := g(~x - 1); {36739#(<= 0 (+ |g_#in~x| 20))} is VALID [2022-02-21 03:03:30,388 INFO L290 TraceCheckUtils]: 133: Hoare triple {36739#(<= 0 (+ |g_#in~x| 20))} ~x := #in~x; {36740#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:03:30,389 INFO L290 TraceCheckUtils]: 134: Hoare triple {36740#(<= 0 (+ g_~x 20))} assume !(0 == ~x); {36740#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:03:30,389 INFO L290 TraceCheckUtils]: 135: Hoare triple {36740#(<= 0 (+ g_~x 20))} assume ~x - 1 <= 2147483647; {36740#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:03:30,389 INFO L290 TraceCheckUtils]: 136: Hoare triple {36740#(<= 0 (+ g_~x 20))} assume ~x - 1 >= -2147483648; {36740#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:03:30,390 INFO L272 TraceCheckUtils]: 137: Hoare triple {36740#(<= 0 (+ g_~x 20))} call #t~ret0 := g(~x - 1); {36741#(<= 0 (+ |g_#in~x| 21))} is VALID [2022-02-21 03:03:30,390 INFO L290 TraceCheckUtils]: 138: Hoare triple {36741#(<= 0 (+ |g_#in~x| 21))} ~x := #in~x; {36742#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:03:30,390 INFO L290 TraceCheckUtils]: 139: Hoare triple {36742#(<= 0 (+ 21 g_~x))} assume !(0 == ~x); {36742#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:03:30,391 INFO L290 TraceCheckUtils]: 140: Hoare triple {36742#(<= 0 (+ 21 g_~x))} assume ~x - 1 <= 2147483647; {36742#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:03:30,391 INFO L290 TraceCheckUtils]: 141: Hoare triple {36742#(<= 0 (+ 21 g_~x))} assume ~x - 1 >= -2147483648; {36742#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:03:30,392 INFO L272 TraceCheckUtils]: 142: Hoare triple {36742#(<= 0 (+ 21 g_~x))} call #t~ret0 := g(~x - 1); {36743#(<= 0 (+ |g_#in~x| 22))} is VALID [2022-02-21 03:03:30,392 INFO L290 TraceCheckUtils]: 143: Hoare triple {36743#(<= 0 (+ |g_#in~x| 22))} ~x := #in~x; {36744#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:03:30,392 INFO L290 TraceCheckUtils]: 144: Hoare triple {36744#(<= 0 (+ 22 g_~x))} assume !(0 == ~x); {36744#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:03:30,393 INFO L290 TraceCheckUtils]: 145: Hoare triple {36744#(<= 0 (+ 22 g_~x))} assume ~x - 1 <= 2147483647; {36744#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:03:30,393 INFO L290 TraceCheckUtils]: 146: Hoare triple {36744#(<= 0 (+ 22 g_~x))} assume !(~x - 1 >= -2147483648); {36677#false} is VALID [2022-02-21 03:03:30,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 328 proven. 1243 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-02-21 03:03:30,394 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:30,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872437175] [2022-02-21 03:03:30,394 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872437175] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:30,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623432824] [2022-02-21 03:03:30,395 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-21 03:03:30,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:30,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:30,396 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:03:30,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-21 03:03:30,473 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2022-02-21 03:03:30,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:03:30,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-21 03:03:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:30,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:30,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {36676#true} assume { :begin_inline_ULTIMATE.init } true; {36676#true} is VALID [2022-02-21 03:03:30,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {36676#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {36676#true} is VALID [2022-02-21 03:03:30,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {36676#true} assume !(main_~x~0#1 < 0); {36676#true} is VALID [2022-02-21 03:03:30,814 INFO L272 TraceCheckUtils]: 3: Hoare triple {36676#true} call main_#t~ret3#1 := g(main_~x~0#1); {36676#true} is VALID [2022-02-21 03:03:30,814 INFO L290 TraceCheckUtils]: 4: Hoare triple {36676#true} ~x := #in~x; {36676#true} is VALID [2022-02-21 03:03:30,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {36676#true} assume !(0 == ~x); {36676#true} is VALID [2022-02-21 03:03:30,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {36676#true} assume ~x - 1 <= 2147483647; {36676#true} is VALID [2022-02-21 03:03:30,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {36676#true} assume ~x - 1 >= -2147483648; {36676#true} is VALID [2022-02-21 03:03:30,814 INFO L272 TraceCheckUtils]: 8: Hoare triple {36676#true} call #t~ret0 := g(~x - 1); {36676#true} is VALID [2022-02-21 03:03:30,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {36676#true} ~x := #in~x; {36676#true} is VALID [2022-02-21 03:03:30,815 INFO L290 TraceCheckUtils]: 10: Hoare triple {36676#true} assume !(0 == ~x); {36676#true} is VALID [2022-02-21 03:03:30,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {36676#true} assume ~x - 1 <= 2147483647; {36676#true} is VALID [2022-02-21 03:03:30,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {36676#true} assume ~x - 1 >= -2147483648; {36676#true} is VALID [2022-02-21 03:03:30,815 INFO L272 TraceCheckUtils]: 13: Hoare triple {36676#true} call #t~ret0 := g(~x - 1); {36676#true} is VALID [2022-02-21 03:03:30,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {36676#true} ~x := #in~x; {36676#true} is VALID [2022-02-21 03:03:30,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {36676#true} assume 0 == ~x;#res := 1; {36676#true} is VALID [2022-02-21 03:03:30,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {36676#true} assume true; {36676#true} is VALID [2022-02-21 03:03:30,815 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {36676#true} {36676#true} #32#return; {36676#true} is VALID [2022-02-21 03:03:30,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {36676#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {36676#true} is VALID [2022-02-21 03:03:30,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {36676#true} assume #t~ret0 - 1 <= 2147483647; {36676#true} is VALID [2022-02-21 03:03:30,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {36676#true} assume #t~ret0 - 1 >= -2147483648; {36676#true} is VALID [2022-02-21 03:03:30,815 INFO L272 TraceCheckUtils]: 21: Hoare triple {36676#true} call #t~ret1 := g(#t~ret0 - 1); {36676#true} is VALID [2022-02-21 03:03:30,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {36676#true} ~x := #in~x; {36676#true} is VALID [2022-02-21 03:03:30,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {36676#true} assume 0 == ~x;#res := 1; {36827#(= |g_#res| 1)} is VALID [2022-02-21 03:03:30,816 INFO L290 TraceCheckUtils]: 24: Hoare triple {36827#(= |g_#res| 1)} assume true; {36827#(= |g_#res| 1)} is VALID [2022-02-21 03:03:30,816 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {36827#(= |g_#res| 1)} {36676#true} #34#return; {36834#(= |g_#t~ret1| 1)} is VALID [2022-02-21 03:03:30,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {36834#(= |g_#t~ret1| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret0;havoc #t~ret1; {36827#(= |g_#res| 1)} is VALID [2022-02-21 03:03:30,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {36827#(= |g_#res| 1)} assume true; {36827#(= |g_#res| 1)} is VALID [2022-02-21 03:03:30,817 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {36827#(= |g_#res| 1)} {36676#true} #32#return; {36844#(= |g_#t~ret0| 1)} is VALID [2022-02-21 03:03:30,818 INFO L290 TraceCheckUtils]: 29: Hoare triple {36844#(= |g_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {36844#(= |g_#t~ret0| 1)} is VALID [2022-02-21 03:03:30,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {36844#(= |g_#t~ret0| 1)} assume #t~ret0 - 1 <= 2147483647; {36844#(= |g_#t~ret0| 1)} is VALID [2022-02-21 03:03:30,818 INFO L290 TraceCheckUtils]: 31: Hoare triple {36844#(= |g_#t~ret0| 1)} assume #t~ret0 - 1 >= -2147483648; {36844#(= |g_#t~ret0| 1)} is VALID [2022-02-21 03:03:30,819 INFO L272 TraceCheckUtils]: 32: Hoare triple {36844#(= |g_#t~ret0| 1)} call #t~ret1 := g(#t~ret0 - 1); {36857#(= |g_#in~x| 0)} is VALID [2022-02-21 03:03:30,819 INFO L290 TraceCheckUtils]: 33: Hoare triple {36857#(= |g_#in~x| 0)} ~x := #in~x; {36861#(= g_~x 0)} is VALID [2022-02-21 03:03:30,819 INFO L290 TraceCheckUtils]: 34: Hoare triple {36861#(= g_~x 0)} assume !(0 == ~x); {36677#false} is VALID [2022-02-21 03:03:30,819 INFO L290 TraceCheckUtils]: 35: Hoare triple {36677#false} assume ~x - 1 <= 2147483647; {36677#false} is VALID [2022-02-21 03:03:30,819 INFO L290 TraceCheckUtils]: 36: Hoare triple {36677#false} assume ~x - 1 >= -2147483648; {36677#false} is VALID [2022-02-21 03:03:30,819 INFO L272 TraceCheckUtils]: 37: Hoare triple {36677#false} call #t~ret0 := g(~x - 1); {36677#false} is VALID [2022-02-21 03:03:30,820 INFO L290 TraceCheckUtils]: 38: Hoare triple {36677#false} ~x := #in~x; {36677#false} is VALID [2022-02-21 03:03:30,820 INFO L290 TraceCheckUtils]: 39: Hoare triple {36677#false} assume !(0 == ~x); {36677#false} is VALID [2022-02-21 03:03:30,820 INFO L290 TraceCheckUtils]: 40: Hoare triple {36677#false} assume ~x - 1 <= 2147483647; {36677#false} is VALID [2022-02-21 03:03:30,820 INFO L290 TraceCheckUtils]: 41: Hoare triple {36677#false} assume ~x - 1 >= -2147483648; {36677#false} is VALID [2022-02-21 03:03:30,820 INFO L272 TraceCheckUtils]: 42: Hoare triple {36677#false} call #t~ret0 := g(~x - 1); {36677#false} is VALID [2022-02-21 03:03:30,820 INFO L290 TraceCheckUtils]: 43: Hoare triple {36677#false} ~x := #in~x; {36677#false} is VALID [2022-02-21 03:03:30,820 INFO L290 TraceCheckUtils]: 44: Hoare triple {36677#false} assume !(0 == ~x); {36677#false} is VALID [2022-02-21 03:03:30,820 INFO L290 TraceCheckUtils]: 45: Hoare triple {36677#false} assume ~x - 1 <= 2147483647; {36677#false} is VALID [2022-02-21 03:03:30,820 INFO L290 TraceCheckUtils]: 46: Hoare triple {36677#false} assume ~x - 1 >= -2147483648; {36677#false} is VALID [2022-02-21 03:03:30,820 INFO L272 TraceCheckUtils]: 47: Hoare triple {36677#false} call #t~ret0 := g(~x - 1); {36677#false} is VALID [2022-02-21 03:03:30,820 INFO L290 TraceCheckUtils]: 48: Hoare triple {36677#false} ~x := #in~x; {36677#false} is VALID [2022-02-21 03:03:30,820 INFO L290 TraceCheckUtils]: 49: Hoare triple {36677#false} assume !(0 == ~x); {36677#false} is VALID [2022-02-21 03:03:30,820 INFO L290 TraceCheckUtils]: 50: Hoare triple {36677#false} assume ~x - 1 <= 2147483647; {36677#false} is VALID [2022-02-21 03:03:30,821 INFO L290 TraceCheckUtils]: 51: Hoare triple {36677#false} assume ~x - 1 >= -2147483648; {36677#false} is VALID [2022-02-21 03:03:30,821 INFO L272 TraceCheckUtils]: 52: Hoare triple {36677#false} call #t~ret0 := g(~x - 1); {36677#false} is VALID [2022-02-21 03:03:30,821 INFO L290 TraceCheckUtils]: 53: Hoare triple {36677#false} ~x := #in~x; {36677#false} is VALID [2022-02-21 03:03:30,821 INFO L290 TraceCheckUtils]: 54: Hoare triple {36677#false} assume !(0 == ~x); {36677#false} is VALID [2022-02-21 03:03:30,821 INFO L290 TraceCheckUtils]: 55: Hoare triple {36677#false} assume ~x - 1 <= 2147483647; {36677#false} is VALID [2022-02-21 03:03:30,821 INFO L290 TraceCheckUtils]: 56: Hoare triple {36677#false} assume ~x - 1 >= -2147483648; {36677#false} is VALID [2022-02-21 03:03:30,821 INFO L272 TraceCheckUtils]: 57: Hoare triple {36677#false} call #t~ret0 := g(~x - 1); {36677#false} is VALID [2022-02-21 03:03:30,821 INFO L290 TraceCheckUtils]: 58: Hoare triple {36677#false} ~x := #in~x; {36677#false} is VALID [2022-02-21 03:03:30,822 INFO L290 TraceCheckUtils]: 59: Hoare triple {36677#false} assume !(0 == ~x); {36677#false} is VALID [2022-02-21 03:03:30,822 INFO L290 TraceCheckUtils]: 60: Hoare triple {36677#false} assume ~x - 1 <= 2147483647; {36677#false} is VALID [2022-02-21 03:03:30,822 INFO L290 TraceCheckUtils]: 61: Hoare triple {36677#false} assume ~x - 1 >= -2147483648; {36677#false} is VALID [2022-02-21 03:03:30,822 INFO L272 TraceCheckUtils]: 62: Hoare triple {36677#false} call #t~ret0 := g(~x - 1); {36677#false} is VALID [2022-02-21 03:03:30,822 INFO L290 TraceCheckUtils]: 63: Hoare triple {36677#false} ~x := #in~x; {36677#false} is VALID [2022-02-21 03:03:30,822 INFO L290 TraceCheckUtils]: 64: Hoare triple {36677#false} assume !(0 == ~x); {36677#false} is VALID [2022-02-21 03:03:30,822 INFO L290 TraceCheckUtils]: 65: Hoare triple {36677#false} assume ~x - 1 <= 2147483647; {36677#false} is VALID [2022-02-21 03:03:30,822 INFO L290 TraceCheckUtils]: 66: Hoare triple {36677#false} assume ~x - 1 >= -2147483648; {36677#false} is VALID [2022-02-21 03:03:30,822 INFO L272 TraceCheckUtils]: 67: Hoare triple {36677#false} call #t~ret0 := g(~x - 1); {36677#false} is VALID [2022-02-21 03:03:30,822 INFO L290 TraceCheckUtils]: 68: Hoare triple {36677#false} ~x := #in~x; {36677#false} is VALID [2022-02-21 03:03:30,822 INFO L290 TraceCheckUtils]: 69: Hoare triple {36677#false} assume !(0 == ~x); {36677#false} is VALID [2022-02-21 03:03:30,822 INFO L290 TraceCheckUtils]: 70: Hoare triple {36677#false} assume ~x - 1 <= 2147483647; {36677#false} is VALID [2022-02-21 03:03:30,822 INFO L290 TraceCheckUtils]: 71: Hoare triple {36677#false} assume ~x - 1 >= -2147483648; {36677#false} is VALID [2022-02-21 03:03:30,823 INFO L272 TraceCheckUtils]: 72: Hoare triple {36677#false} call #t~ret0 := g(~x - 1); {36677#false} is VALID [2022-02-21 03:03:30,823 INFO L290 TraceCheckUtils]: 73: Hoare triple {36677#false} ~x := #in~x; {36677#false} is VALID [2022-02-21 03:03:30,823 INFO L290 TraceCheckUtils]: 74: Hoare triple {36677#false} assume !(0 == ~x); {36677#false} is VALID [2022-02-21 03:03:30,823 INFO L290 TraceCheckUtils]: 75: Hoare triple {36677#false} assume ~x - 1 <= 2147483647; {36677#false} is VALID [2022-02-21 03:03:30,823 INFO L290 TraceCheckUtils]: 76: Hoare triple {36677#false} assume ~x - 1 >= -2147483648; {36677#false} is VALID [2022-02-21 03:03:30,823 INFO L272 TraceCheckUtils]: 77: Hoare triple {36677#false} call #t~ret0 := g(~x - 1); {36677#false} is VALID [2022-02-21 03:03:30,823 INFO L290 TraceCheckUtils]: 78: Hoare triple {36677#false} ~x := #in~x; {36677#false} is VALID [2022-02-21 03:03:30,823 INFO L290 TraceCheckUtils]: 79: Hoare triple {36677#false} assume !(0 == ~x); {36677#false} is VALID [2022-02-21 03:03:30,823 INFO L290 TraceCheckUtils]: 80: Hoare triple {36677#false} assume ~x - 1 <= 2147483647; {36677#false} is VALID [2022-02-21 03:03:30,823 INFO L290 TraceCheckUtils]: 81: Hoare triple {36677#false} assume ~x - 1 >= -2147483648; {36677#false} is VALID [2022-02-21 03:03:30,823 INFO L272 TraceCheckUtils]: 82: Hoare triple {36677#false} call #t~ret0 := g(~x - 1); {36677#false} is VALID [2022-02-21 03:03:30,823 INFO L290 TraceCheckUtils]: 83: Hoare triple {36677#false} ~x := #in~x; {36677#false} is VALID [2022-02-21 03:03:30,823 INFO L290 TraceCheckUtils]: 84: Hoare triple {36677#false} assume !(0 == ~x); {36677#false} is VALID [2022-02-21 03:03:30,823 INFO L290 TraceCheckUtils]: 85: Hoare triple {36677#false} assume ~x - 1 <= 2147483647; {36677#false} is VALID [2022-02-21 03:03:30,823 INFO L290 TraceCheckUtils]: 86: Hoare triple {36677#false} assume ~x - 1 >= -2147483648; {36677#false} is VALID [2022-02-21 03:03:30,823 INFO L272 TraceCheckUtils]: 87: Hoare triple {36677#false} call #t~ret0 := g(~x - 1); {36677#false} is VALID [2022-02-21 03:03:30,823 INFO L290 TraceCheckUtils]: 88: Hoare triple {36677#false} ~x := #in~x; {36677#false} is VALID [2022-02-21 03:03:30,824 INFO L290 TraceCheckUtils]: 89: Hoare triple {36677#false} assume !(0 == ~x); {36677#false} is VALID [2022-02-21 03:03:30,824 INFO L290 TraceCheckUtils]: 90: Hoare triple {36677#false} assume ~x - 1 <= 2147483647; {36677#false} is VALID [2022-02-21 03:03:30,824 INFO L290 TraceCheckUtils]: 91: Hoare triple {36677#false} assume ~x - 1 >= -2147483648; {36677#false} is VALID [2022-02-21 03:03:30,824 INFO L272 TraceCheckUtils]: 92: Hoare triple {36677#false} call #t~ret0 := g(~x - 1); {36677#false} is VALID [2022-02-21 03:03:30,824 INFO L290 TraceCheckUtils]: 93: Hoare triple {36677#false} ~x := #in~x; {36677#false} is VALID [2022-02-21 03:03:30,824 INFO L290 TraceCheckUtils]: 94: Hoare triple {36677#false} assume !(0 == ~x); {36677#false} is VALID [2022-02-21 03:03:30,824 INFO L290 TraceCheckUtils]: 95: Hoare triple {36677#false} assume ~x - 1 <= 2147483647; {36677#false} is VALID [2022-02-21 03:03:30,824 INFO L290 TraceCheckUtils]: 96: Hoare triple {36677#false} assume ~x - 1 >= -2147483648; {36677#false} is VALID [2022-02-21 03:03:30,824 INFO L272 TraceCheckUtils]: 97: Hoare triple {36677#false} call #t~ret0 := g(~x - 1); {36677#false} is VALID [2022-02-21 03:03:30,824 INFO L290 TraceCheckUtils]: 98: Hoare triple {36677#false} ~x := #in~x; {36677#false} is VALID [2022-02-21 03:03:30,824 INFO L290 TraceCheckUtils]: 99: Hoare triple {36677#false} assume !(0 == ~x); {36677#false} is VALID [2022-02-21 03:03:30,824 INFO L290 TraceCheckUtils]: 100: Hoare triple {36677#false} assume ~x - 1 <= 2147483647; {36677#false} is VALID [2022-02-21 03:03:30,824 INFO L290 TraceCheckUtils]: 101: Hoare triple {36677#false} assume ~x - 1 >= -2147483648; {36677#false} is VALID [2022-02-21 03:03:30,824 INFO L272 TraceCheckUtils]: 102: Hoare triple {36677#false} call #t~ret0 := g(~x - 1); {36677#false} is VALID [2022-02-21 03:03:30,824 INFO L290 TraceCheckUtils]: 103: Hoare triple {36677#false} ~x := #in~x; {36677#false} is VALID [2022-02-21 03:03:30,824 INFO L290 TraceCheckUtils]: 104: Hoare triple {36677#false} assume !(0 == ~x); {36677#false} is VALID [2022-02-21 03:03:30,824 INFO L290 TraceCheckUtils]: 105: Hoare triple {36677#false} assume ~x - 1 <= 2147483647; {36677#false} is VALID [2022-02-21 03:03:30,825 INFO L290 TraceCheckUtils]: 106: Hoare triple {36677#false} assume ~x - 1 >= -2147483648; {36677#false} is VALID [2022-02-21 03:03:30,825 INFO L272 TraceCheckUtils]: 107: Hoare triple {36677#false} call #t~ret0 := g(~x - 1); {36677#false} is VALID [2022-02-21 03:03:30,825 INFO L290 TraceCheckUtils]: 108: Hoare triple {36677#false} ~x := #in~x; {36677#false} is VALID [2022-02-21 03:03:30,825 INFO L290 TraceCheckUtils]: 109: Hoare triple {36677#false} assume !(0 == ~x); {36677#false} is VALID [2022-02-21 03:03:30,825 INFO L290 TraceCheckUtils]: 110: Hoare triple {36677#false} assume ~x - 1 <= 2147483647; {36677#false} is VALID [2022-02-21 03:03:30,825 INFO L290 TraceCheckUtils]: 111: Hoare triple {36677#false} assume ~x - 1 >= -2147483648; {36677#false} is VALID [2022-02-21 03:03:30,825 INFO L272 TraceCheckUtils]: 112: Hoare triple {36677#false} call #t~ret0 := g(~x - 1); {36677#false} is VALID [2022-02-21 03:03:30,825 INFO L290 TraceCheckUtils]: 113: Hoare triple {36677#false} ~x := #in~x; {36677#false} is VALID [2022-02-21 03:03:30,825 INFO L290 TraceCheckUtils]: 114: Hoare triple {36677#false} assume !(0 == ~x); {36677#false} is VALID [2022-02-21 03:03:30,825 INFO L290 TraceCheckUtils]: 115: Hoare triple {36677#false} assume ~x - 1 <= 2147483647; {36677#false} is VALID [2022-02-21 03:03:30,825 INFO L290 TraceCheckUtils]: 116: Hoare triple {36677#false} assume ~x - 1 >= -2147483648; {36677#false} is VALID [2022-02-21 03:03:30,825 INFO L272 TraceCheckUtils]: 117: Hoare triple {36677#false} call #t~ret0 := g(~x - 1); {36677#false} is VALID [2022-02-21 03:03:30,825 INFO L290 TraceCheckUtils]: 118: Hoare triple {36677#false} ~x := #in~x; {36677#false} is VALID [2022-02-21 03:03:30,825 INFO L290 TraceCheckUtils]: 119: Hoare triple {36677#false} assume !(0 == ~x); {36677#false} is VALID [2022-02-21 03:03:30,825 INFO L290 TraceCheckUtils]: 120: Hoare triple {36677#false} assume ~x - 1 <= 2147483647; {36677#false} is VALID [2022-02-21 03:03:30,825 INFO L290 TraceCheckUtils]: 121: Hoare triple {36677#false} assume ~x - 1 >= -2147483648; {36677#false} is VALID [2022-02-21 03:03:30,825 INFO L272 TraceCheckUtils]: 122: Hoare triple {36677#false} call #t~ret0 := g(~x - 1); {36677#false} is VALID [2022-02-21 03:03:30,825 INFO L290 TraceCheckUtils]: 123: Hoare triple {36677#false} ~x := #in~x; {36677#false} is VALID [2022-02-21 03:03:30,826 INFO L290 TraceCheckUtils]: 124: Hoare triple {36677#false} assume !(0 == ~x); {36677#false} is VALID [2022-02-21 03:03:30,826 INFO L290 TraceCheckUtils]: 125: Hoare triple {36677#false} assume ~x - 1 <= 2147483647; {36677#false} is VALID [2022-02-21 03:03:30,826 INFO L290 TraceCheckUtils]: 126: Hoare triple {36677#false} assume ~x - 1 >= -2147483648; {36677#false} is VALID [2022-02-21 03:03:30,826 INFO L272 TraceCheckUtils]: 127: Hoare triple {36677#false} call #t~ret0 := g(~x - 1); {36677#false} is VALID [2022-02-21 03:03:30,826 INFO L290 TraceCheckUtils]: 128: Hoare triple {36677#false} ~x := #in~x; {36677#false} is VALID [2022-02-21 03:03:30,826 INFO L290 TraceCheckUtils]: 129: Hoare triple {36677#false} assume !(0 == ~x); {36677#false} is VALID [2022-02-21 03:03:30,826 INFO L290 TraceCheckUtils]: 130: Hoare triple {36677#false} assume ~x - 1 <= 2147483647; {36677#false} is VALID [2022-02-21 03:03:30,826 INFO L290 TraceCheckUtils]: 131: Hoare triple {36677#false} assume ~x - 1 >= -2147483648; {36677#false} is VALID [2022-02-21 03:03:30,826 INFO L272 TraceCheckUtils]: 132: Hoare triple {36677#false} call #t~ret0 := g(~x - 1); {36677#false} is VALID [2022-02-21 03:03:30,826 INFO L290 TraceCheckUtils]: 133: Hoare triple {36677#false} ~x := #in~x; {36677#false} is VALID [2022-02-21 03:03:30,826 INFO L290 TraceCheckUtils]: 134: Hoare triple {36677#false} assume !(0 == ~x); {36677#false} is VALID [2022-02-21 03:03:30,826 INFO L290 TraceCheckUtils]: 135: Hoare triple {36677#false} assume ~x - 1 <= 2147483647; {36677#false} is VALID [2022-02-21 03:03:30,826 INFO L290 TraceCheckUtils]: 136: Hoare triple {36677#false} assume ~x - 1 >= -2147483648; {36677#false} is VALID [2022-02-21 03:03:30,826 INFO L272 TraceCheckUtils]: 137: Hoare triple {36677#false} call #t~ret0 := g(~x - 1); {36677#false} is VALID [2022-02-21 03:03:30,826 INFO L290 TraceCheckUtils]: 138: Hoare triple {36677#false} ~x := #in~x; {36677#false} is VALID [2022-02-21 03:03:30,826 INFO L290 TraceCheckUtils]: 139: Hoare triple {36677#false} assume !(0 == ~x); {36677#false} is VALID [2022-02-21 03:03:30,826 INFO L290 TraceCheckUtils]: 140: Hoare triple {36677#false} assume ~x - 1 <= 2147483647; {36677#false} is VALID [2022-02-21 03:03:30,826 INFO L290 TraceCheckUtils]: 141: Hoare triple {36677#false} assume ~x - 1 >= -2147483648; {36677#false} is VALID [2022-02-21 03:03:30,827 INFO L272 TraceCheckUtils]: 142: Hoare triple {36677#false} call #t~ret0 := g(~x - 1); {36677#false} is VALID [2022-02-21 03:03:30,827 INFO L290 TraceCheckUtils]: 143: Hoare triple {36677#false} ~x := #in~x; {36677#false} is VALID [2022-02-21 03:03:30,827 INFO L290 TraceCheckUtils]: 144: Hoare triple {36677#false} assume !(0 == ~x); {36677#false} is VALID [2022-02-21 03:03:30,827 INFO L290 TraceCheckUtils]: 145: Hoare triple {36677#false} assume ~x - 1 <= 2147483647; {36677#false} is VALID [2022-02-21 03:03:30,827 INFO L290 TraceCheckUtils]: 146: Hoare triple {36677#false} assume !(~x - 1 >= -2147483648); {36677#false} is VALID [2022-02-21 03:03:30,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 1216 trivial. 0 not checked. [2022-02-21 03:03:30,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:03:30,828 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623432824] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:30,828 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:03:30,828 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [50] total 56 [2022-02-21 03:03:30,828 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304010126] [2022-02-21 03:03:30,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:30,828 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 147 [2022-02-21 03:03:30,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:30,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:03:30,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:30,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-21 03:03:30,847 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:30,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:03:30,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2416, Unknown=0, NotChecked=0, Total=3080 [2022-02-21 03:03:30,848 INFO L87 Difference]: Start difference. First operand 1256 states and 1465 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:03:31,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:31,520 INFO L93 Difference]: Finished difference Result 1591 states and 1891 transitions. [2022-02-21 03:03:31,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 03:03:31,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 147 [2022-02-21 03:03:31,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:31,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:03:31,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2022-02-21 03:03:31,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:03:31,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2022-02-21 03:03:31,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 42 transitions. [2022-02-21 03:03:31,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:31,550 INFO L225 Difference]: With dead ends: 1591 [2022-02-21 03:03:31,550 INFO L226 Difference]: Without dead ends: 240 [2022-02-21 03:03:31,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=802, Invalid=2738, Unknown=0, NotChecked=0, Total=3540 [2022-02-21 03:03:31,553 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:31,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 74 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:31,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-02-21 03:03:31,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 239. [2022-02-21 03:03:31,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:31,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 240 states. Second operand has 239 states, 191 states have (on average 1.0052356020942408) internal successors, (192), 191 states have internal predecessors, (192), 47 states have call successors, (47), 47 states have call predecessors, (47), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:31,720 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand has 239 states, 191 states have (on average 1.0052356020942408) internal successors, (192), 191 states have internal predecessors, (192), 47 states have call successors, (47), 47 states have call predecessors, (47), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:31,721 INFO L87 Difference]: Start difference. First operand 240 states. Second operand has 239 states, 191 states have (on average 1.0052356020942408) internal successors, (192), 191 states have internal predecessors, (192), 47 states have call successors, (47), 47 states have call predecessors, (47), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:31,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:31,723 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2022-02-21 03:03:31,723 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2022-02-21 03:03:31,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:31,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:31,724 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 191 states have (on average 1.0052356020942408) internal successors, (192), 191 states have internal predecessors, (192), 47 states have call successors, (47), 47 states have call predecessors, (47), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 240 states. [2022-02-21 03:03:31,724 INFO L87 Difference]: Start difference. First operand has 239 states, 191 states have (on average 1.0052356020942408) internal successors, (192), 191 states have internal predecessors, (192), 47 states have call successors, (47), 47 states have call predecessors, (47), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 240 states. [2022-02-21 03:03:31,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:31,727 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2022-02-21 03:03:31,727 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2022-02-21 03:03:31,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:31,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:31,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:31,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:31,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 191 states have (on average 1.0052356020942408) internal successors, (192), 191 states have internal predecessors, (192), 47 states have call successors, (47), 47 states have call predecessors, (47), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:31,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2022-02-21 03:03:31,731 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 147 [2022-02-21 03:03:31,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:31,731 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2022-02-21 03:03:31,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:03:31,732 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2022-02-21 03:03:31,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2022-02-21 03:03:31,733 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:31,733 INFO L514 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1, 1, 1, 1] [2022-02-21 03:03:31,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:03:31,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:31,947 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:03:31,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:31,948 INFO L85 PathProgramCache]: Analyzing trace with hash -827561134, now seen corresponding path program 5 times [2022-02-21 03:03:31,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:31,948 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183647666] [2022-02-21 03:03:31,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:31,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat