/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/gj2007b.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:52:38,586 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:52:38,587 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:52:38,634 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:52:38,635 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:52:38,636 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:52:38,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:52:38,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:52:38,645 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:52:38,647 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:52:38,648 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:52:38,648 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:52:38,649 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:52:38,649 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:52:38,650 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:52:38,651 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:52:38,651 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:52:38,652 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:52:38,653 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:52:38,654 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:52:38,660 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:52:38,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:52:38,663 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:52:38,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:52:38,666 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:52:38,668 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:52:38,668 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:52:38,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:52:38,669 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:52:38,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:52:38,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:52:38,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:52:38,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:52:38,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:52:38,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:52:38,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:52:38,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:52:38,673 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:52:38,673 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:52:38,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:52:38,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:52:38,675 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:52:38,676 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:52:38,705 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:52:38,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:52:38,706 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:52:38,706 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:52:38,707 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:52:38,707 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:52:38,707 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:52:38,707 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:52:38,707 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:52:38,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:52:38,708 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:52:38,708 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:52:38,708 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:52:38,708 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:52:38,708 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:52:38,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:52:38,709 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:52:38,709 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:52:38,709 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:52:38,709 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:52:38,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:52:38,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:52:38,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:52:38,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:52:38,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:52:38,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:52:38,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:52:38,710 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:52:38,710 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:52:38,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:52:38,710 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:52:38,710 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:52:38,710 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:52:38,711 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:52:38,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:52:38,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:52:38,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:52:38,937 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:52:38,937 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:52:38,938 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007b.i [2022-04-27 10:52:39,005 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55ac58d5a/d04ea964808a4466842dc8ef5e9765d0/FLAG86a58e58b [2022-04-27 10:52:39,377 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:52:39,378 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007b.i [2022-04-27 10:52:39,383 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55ac58d5a/d04ea964808a4466842dc8ef5e9765d0/FLAG86a58e58b [2022-04-27 10:52:39,396 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55ac58d5a/d04ea964808a4466842dc8ef5e9765d0 [2022-04-27 10:52:39,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:52:39,401 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:52:39,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:52:39,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:52:39,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:52:39,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:52:39" (1/1) ... [2022-04-27 10:52:39,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e4e0c90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:52:39, skipping insertion in model container [2022-04-27 10:52:39,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:52:39" (1/1) ... [2022-04-27 10:52:39,415 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:52:39,448 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:52:39,600 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007b.i[895,908] [2022-04-27 10:52:39,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:52:39,620 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:52:39,630 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007b.i[895,908] [2022-04-27 10:52:39,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:52:39,643 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:52:39,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:52:39 WrapperNode [2022-04-27 10:52:39,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:52:39,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:52:39,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:52:39,644 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:52:39,651 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:52:39" (1/1) ... [2022-04-27 10:52:39,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:52:39" (1/1) ... [2022-04-27 10:52:39,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:52:39" (1/1) ... [2022-04-27 10:52:39,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:52:39" (1/1) ... [2022-04-27 10:52:39,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:52:39" (1/1) ... [2022-04-27 10:52:39,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:52:39" (1/1) ... [2022-04-27 10:52:39,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:52:39" (1/1) ... [2022-04-27 10:52:39,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:52:39,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:52:39,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:52:39,673 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:52:39,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:52:39" (1/1) ... [2022-04-27 10:52:39,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:52:39,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:52:39,701 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-04-27 10:52:39,703 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-04-27 10:52:39,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:52:39,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:52:39,732 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:52:39,732 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:52:39,732 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:52:39,732 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:52:39,732 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:52:39,732 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:52:39,732 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:52:39,732 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:52:39,732 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:52:39,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:52:39,733 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:52:39,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:52:39,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:52:39,733 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:52:39,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:52:39,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:52:39,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:52:39,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:52:39,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:52:39,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:52:39,790 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:52:39,791 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:52:39,890 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:52:39,896 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:52:39,896 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:52:39,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:52:39 BoogieIcfgContainer [2022-04-27 10:52:39,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:52:39,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:52:39,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:52:39,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:52:39,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:52:39" (1/3) ... [2022-04-27 10:52:39,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c5faff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:52:39, skipping insertion in model container [2022-04-27 10:52:39,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:52:39" (2/3) ... [2022-04-27 10:52:39,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c5faff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:52:39, skipping insertion in model container [2022-04-27 10:52:39,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:52:39" (3/3) ... [2022-04-27 10:52:39,933 INFO L111 eAbstractionObserver]: Analyzing ICFG gj2007b.i [2022-04-27 10:52:39,944 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:52:39,945 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:52:39,988 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:52:40,002 INFO L357 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=PETRI_NET, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1b2760c5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@295fa834 [2022-04-27 10:52:40,003 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:52:40,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:52:40,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:52:40,027 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:52:40,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:52:40,028 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:52:40,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:52:40,033 INFO L85 PathProgramCache]: Analyzing trace with hash -915508507, now seen corresponding path program 1 times [2022-04-27 10:52:40,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:52:40,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639150677] [2022-04-27 10:52:40,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:52:40,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:52:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:40,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:52:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:40,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {25#true} is VALID [2022-04-27 10:52:40,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-27 10:52:40,202 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #60#return; {25#true} is VALID [2022-04-27 10:52:40,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:52:40,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {25#true} is VALID [2022-04-27 10:52:40,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-27 10:52:40,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #60#return; {25#true} is VALID [2022-04-27 10:52:40,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret3 := main(); {25#true} is VALID [2022-04-27 10:52:40,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {25#true} is VALID [2022-04-27 10:52:40,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-27 10:52:40,212 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {26#false} is VALID [2022-04-27 10:52:40,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-27 10:52:40,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-27 10:52:40,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-27 10:52:40,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:52:40,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:52:40,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639150677] [2022-04-27 10:52:40,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639150677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:52:40,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:52:40,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:52:40,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112183681] [2022-04-27 10:52:40,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:52:40,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 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 11 [2022-04-27 10:52:40,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:52:40,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:40,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:40,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:52:40,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:52:40,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:52:40,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:52:40,288 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:40,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:40,412 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-27 10:52:40,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:52:40,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 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 11 [2022-04-27 10:52:40,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:52:40,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-27 10:52:40,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:40,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-27 10:52:40,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-04-27 10:52:40,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:40,507 INFO L225 Difference]: With dead ends: 35 [2022-04-27 10:52:40,507 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 10:52:40,510 INFO L412 NwaCegarLoop]: 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-04-27 10:52:40,513 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:52:40,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:52:40,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 10:52:40,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 10:52:40,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:52:40,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:40,539 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:40,539 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:40,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:40,542 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 10:52:40,542 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 10:52:40,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:40,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:40,543 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-27 10:52:40,543 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-27 10:52:40,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:40,546 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 10:52:40,546 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 10:52:40,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:40,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:40,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:52:40,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:52:40,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:40,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-27 10:52:40,553 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-27 10:52:40,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:52:40,553 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-27 10:52:40,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:40,554 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 10:52:40,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:52:40,554 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:52:40,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:52:40,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:52:40,555 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:52:40,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:52:40,556 INFO L85 PathProgramCache]: Analyzing trace with hash -925667238, now seen corresponding path program 1 times [2022-04-27 10:52:40,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:52:40,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919170706] [2022-04-27 10:52:40,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:52:40,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:52:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:40,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:52:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:40,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {146#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {138#true} is VALID [2022-04-27 10:52:40,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {138#true} assume true; {138#true} is VALID [2022-04-27 10:52:40,656 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {138#true} {138#true} #60#return; {138#true} is VALID [2022-04-27 10:52:40,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {138#true} call ULTIMATE.init(); {146#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:52:40,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {138#true} is VALID [2022-04-27 10:52:40,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {138#true} assume true; {138#true} is VALID [2022-04-27 10:52:40,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138#true} {138#true} #60#return; {138#true} is VALID [2022-04-27 10:52:40,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {138#true} call #t~ret3 := main(); {138#true} is VALID [2022-04-27 10:52:40,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {138#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {143#(or (<= 0 main_~m~0) (<= main_~n~0 0))} is VALID [2022-04-27 10:52:40,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {143#(or (<= 0 main_~m~0) (<= main_~n~0 0))} assume !(~x~0 < ~n~0); {143#(or (<= 0 main_~m~0) (<= main_~n~0 0))} is VALID [2022-04-27 10:52:40,659 INFO L272 TraceCheckUtils]: 7: Hoare triple {143#(or (<= 0 main_~m~0) (<= main_~n~0 0))} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {144#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:52:40,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {144#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {145#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:52:40,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {145#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {139#false} is VALID [2022-04-27 10:52:40,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {139#false} assume !false; {139#false} is VALID [2022-04-27 10:52:40,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:52:40,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:52:40,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919170706] [2022-04-27 10:52:40,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919170706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:52:40,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:52:40,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:52:40,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690096836] [2022-04-27 10:52:40,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:52:40,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 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 11 [2022-04-27 10:52:40,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:52:40,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:40,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:40,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:52:40,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:52:40,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:52:40,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:52:40,675 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:40,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:40,884 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-27 10:52:40,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:52:40,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 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 11 [2022-04-27 10:52:40,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:52:40,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:40,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-27 10:52:40,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:40,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-27 10:52:40,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2022-04-27 10:52:40,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:40,921 INFO L225 Difference]: With dead ends: 28 [2022-04-27 10:52:40,922 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 10:52:40,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:52:40,923 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:52:40,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:52:40,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 10:52:40,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-27 10:52:40,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:52:40,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:52:40,933 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:52:40,933 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:52:40,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:40,935 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-27 10:52:40,935 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-27 10:52:40,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:40,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:40,936 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-27 10:52:40,936 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-27 10:52:40,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:40,938 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-27 10:52:40,938 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-27 10:52:40,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:40,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:40,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:52:40,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:52:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:52:40,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-27 10:52:40,941 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 11 [2022-04-27 10:52:40,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:52:40,941 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-27 10:52:40,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:40,942 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-27 10:52:40,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 10:52:40,942 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:52:40,942 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:52:40,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:52:40,943 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:52:40,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:52:40,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1147629988, now seen corresponding path program 1 times [2022-04-27 10:52:40,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:52:40,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980000152] [2022-04-27 10:52:40,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:52:40,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:52:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:41,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:52:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:41,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {285#true} is VALID [2022-04-27 10:52:41,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {285#true} assume true; {285#true} is VALID [2022-04-27 10:52:41,024 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {285#true} {285#true} #60#return; {285#true} is VALID [2022-04-27 10:52:41,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {285#true} call ULTIMATE.init(); {294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:52:41,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {285#true} is VALID [2022-04-27 10:52:41,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {285#true} assume true; {285#true} is VALID [2022-04-27 10:52:41,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {285#true} {285#true} #60#return; {285#true} is VALID [2022-04-27 10:52:41,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {285#true} call #t~ret3 := main(); {285#true} is VALID [2022-04-27 10:52:41,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {285#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {290#(= main_~x~0 0)} is VALID [2022-04-27 10:52:41,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {290#(= main_~x~0 0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {290#(= main_~x~0 0)} is VALID [2022-04-27 10:52:41,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {290#(= main_~x~0 0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {291#(or (<= 0 main_~m~0) (<= main_~n~0 0))} is VALID [2022-04-27 10:52:41,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {291#(or (<= 0 main_~m~0) (<= main_~n~0 0))} ~x~0 := 1 + ~x~0; {291#(or (<= 0 main_~m~0) (<= main_~n~0 0))} is VALID [2022-04-27 10:52:41,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {291#(or (<= 0 main_~m~0) (<= main_~n~0 0))} assume !(~x~0 < ~n~0); {291#(or (<= 0 main_~m~0) (<= main_~n~0 0))} is VALID [2022-04-27 10:52:41,029 INFO L272 TraceCheckUtils]: 10: Hoare triple {291#(or (<= 0 main_~m~0) (<= main_~n~0 0))} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {292#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:52:41,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {292#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {293#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:52:41,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {293#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {286#false} is VALID [2022-04-27 10:52:41,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {286#false} assume !false; {286#false} is VALID [2022-04-27 10:52:41,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:52:41,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:52:41,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980000152] [2022-04-27 10:52:41,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980000152] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:52:41,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008513426] [2022-04-27 10:52:41,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:52:41,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:52:41,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:52:41,033 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-04-27 10:52:41,047 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-04-27 10:52:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:41,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 10:52:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:41,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:52:41,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {285#true} call ULTIMATE.init(); {285#true} is VALID [2022-04-27 10:52:41,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {285#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {285#true} is VALID [2022-04-27 10:52:41,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {285#true} assume true; {285#true} is VALID [2022-04-27 10:52:41,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {285#true} {285#true} #60#return; {285#true} is VALID [2022-04-27 10:52:41,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {285#true} call #t~ret3 := main(); {285#true} is VALID [2022-04-27 10:52:41,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {285#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {313#(<= 0 main_~x~0)} is VALID [2022-04-27 10:52:41,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {313#(<= 0 main_~x~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {313#(<= 0 main_~x~0)} is VALID [2022-04-27 10:52:41,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {313#(<= 0 main_~x~0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {320#(<= 0 main_~m~0)} is VALID [2022-04-27 10:52:41,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {320#(<= 0 main_~m~0)} ~x~0 := 1 + ~x~0; {320#(<= 0 main_~m~0)} is VALID [2022-04-27 10:52:41,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {320#(<= 0 main_~m~0)} assume !(~x~0 < ~n~0); {320#(<= 0 main_~m~0)} is VALID [2022-04-27 10:52:41,248 INFO L272 TraceCheckUtils]: 10: Hoare triple {320#(<= 0 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {330#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:52:41,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {330#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {334#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:52:41,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {334#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {286#false} is VALID [2022-04-27 10:52:41,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {286#false} assume !false; {286#false} is VALID [2022-04-27 10:52:41,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:52:41,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:52:41,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {286#false} assume !false; {286#false} is VALID [2022-04-27 10:52:41,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {334#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {286#false} is VALID [2022-04-27 10:52:41,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {330#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {334#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:52:41,386 INFO L272 TraceCheckUtils]: 10: Hoare triple {320#(<= 0 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {330#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:52:41,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {320#(<= 0 main_~m~0)} assume !(~x~0 < ~n~0); {320#(<= 0 main_~m~0)} is VALID [2022-04-27 10:52:41,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {320#(<= 0 main_~m~0)} ~x~0 := 1 + ~x~0; {320#(<= 0 main_~m~0)} is VALID [2022-04-27 10:52:41,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {313#(<= 0 main_~x~0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {320#(<= 0 main_~m~0)} is VALID [2022-04-27 10:52:41,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {313#(<= 0 main_~x~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {313#(<= 0 main_~x~0)} is VALID [2022-04-27 10:52:41,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {285#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {313#(<= 0 main_~x~0)} is VALID [2022-04-27 10:52:41,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {285#true} call #t~ret3 := main(); {285#true} is VALID [2022-04-27 10:52:41,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {285#true} {285#true} #60#return; {285#true} is VALID [2022-04-27 10:52:41,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {285#true} assume true; {285#true} is VALID [2022-04-27 10:52:41,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {285#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {285#true} is VALID [2022-04-27 10:52:41,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {285#true} call ULTIMATE.init(); {285#true} is VALID [2022-04-27 10:52:41,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:52:41,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008513426] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:52:41,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:52:41,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2022-04-27 10:52:41,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753318852] [2022-04-27 10:52:41,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:52:41,391 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 10:52:41,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:52:41,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:41,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:41,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 10:52:41,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:52:41,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 10:52:41,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-27 10:52:41,412 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:41,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:41,687 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-27 10:52:41,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:52:41,687 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 10:52:41,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:52:41,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-27 10:52:41,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:41,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-27 10:52:41,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2022-04-27 10:52:41,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:41,723 INFO L225 Difference]: With dead ends: 37 [2022-04-27 10:52:41,723 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 10:52:41,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-04-27 10:52:41,725 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:52:41,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 44 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:52:41,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 10:52:41,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 19. [2022-04-27 10:52:41,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:52:41,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:41,736 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:41,736 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:41,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:41,738 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-27 10:52:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-27 10:52:41,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:41,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:41,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 33 states. [2022-04-27 10:52:41,739 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 33 states. [2022-04-27 10:52:41,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:41,742 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-27 10:52:41,742 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-27 10:52:41,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:41,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:41,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:52:41,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:52:41,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:41,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-27 10:52:41,744 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2022-04-27 10:52:41,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:52:41,744 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-27 10:52:41,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:41,744 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-27 10:52:41,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 10:52:41,745 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:52:41,745 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:52:41,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 10:52:41,960 WARN L477 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-04-27 10:52:41,960 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:52:41,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:52:41,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1885482061, now seen corresponding path program 1 times [2022-04-27 10:52:41,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:52:41,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912927319] [2022-04-27 10:52:41,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:52:41,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:52:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:42,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:52:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:42,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {551#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {538#true} is VALID [2022-04-27 10:52:42,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-27 10:52:42,049 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {538#true} {538#true} #60#return; {538#true} is VALID [2022-04-27 10:52:42,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 10:52:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:42,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {538#true} ~cond := #in~cond; {538#true} is VALID [2022-04-27 10:52:42,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#true} assume !(0 == ~cond); {538#true} is VALID [2022-04-27 10:52:42,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-27 10:52:42,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {544#(<= main_~n~0 0)} #56#return; {544#(<= main_~n~0 0)} is VALID [2022-04-27 10:52:42,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {551#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:52:42,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {551#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {538#true} is VALID [2022-04-27 10:52:42,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-27 10:52:42,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #60#return; {538#true} is VALID [2022-04-27 10:52:42,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret3 := main(); {538#true} is VALID [2022-04-27 10:52:42,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {543#(= main_~x~0 0)} is VALID [2022-04-27 10:52:42,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {543#(= main_~x~0 0)} assume !(~x~0 < ~n~0); {544#(<= main_~n~0 0)} is VALID [2022-04-27 10:52:42,069 INFO L272 TraceCheckUtils]: 7: Hoare triple {544#(<= main_~n~0 0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {538#true} is VALID [2022-04-27 10:52:42,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {538#true} ~cond := #in~cond; {538#true} is VALID [2022-04-27 10:52:42,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {538#true} assume !(0 == ~cond); {538#true} is VALID [2022-04-27 10:52:42,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-27 10:52:42,070 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {538#true} {544#(<= main_~n~0 0)} #56#return; {544#(<= main_~n~0 0)} is VALID [2022-04-27 10:52:42,070 INFO L272 TraceCheckUtils]: 12: Hoare triple {544#(<= main_~n~0 0)} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {549#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:52:42,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {549#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {550#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:52:42,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {550#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {539#false} is VALID [2022-04-27 10:52:42,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-04-27 10:52:42,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:52:42,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:52:42,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912927319] [2022-04-27 10:52:42,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912927319] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:52:42,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:52:42,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:52:42,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360467548] [2022-04-27 10:52:42,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:52:42,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-04-27 10:52:42,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:52:42,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:42,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:42,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:52:42,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:52:42,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:52:42,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:52:42,096 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:42,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:42,296 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-27 10:52:42,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:52:42,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-04-27 10:52:42,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:52:42,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:42,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-27 10:52:42,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:42,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-27 10:52:42,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2022-04-27 10:52:42,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:42,336 INFO L225 Difference]: With dead ends: 32 [2022-04-27 10:52:42,336 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 10:52:42,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:52:42,339 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:52:42,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 34 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:52:42,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 10:52:42,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-04-27 10:52:42,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:52:42,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:42,353 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:42,353 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:42,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:42,357 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-27 10:52:42,357 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-27 10:52:42,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:42,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:42,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-27 10:52:42,358 INFO L87 Difference]: Start difference. First operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-27 10:52:42,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:42,362 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-27 10:52:42,362 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-27 10:52:42,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:42,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:42,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:52:42,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:52:42,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:42,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-04-27 10:52:42,364 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2022-04-27 10:52:42,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:52:42,364 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-04-27 10:52:42,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:42,365 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-27 10:52:42,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 10:52:42,367 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:52:42,367 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:52:42,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 10:52:42,368 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:52:42,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:52:42,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1672024233, now seen corresponding path program 1 times [2022-04-27 10:52:42,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:52:42,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107961934] [2022-04-27 10:52:42,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:52:42,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:52:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:42,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:52:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:42,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {698#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {685#true} is VALID [2022-04-27 10:52:42,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-27 10:52:42,471 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {685#true} {685#true} #60#return; {685#true} is VALID [2022-04-27 10:52:42,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-27 10:52:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:42,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {685#true} ~cond := #in~cond; {685#true} is VALID [2022-04-27 10:52:42,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {685#true} assume !(0 == ~cond); {685#true} is VALID [2022-04-27 10:52:42,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-27 10:52:42,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {685#true} {691#(= main_~m~0 0)} #56#return; {691#(= main_~m~0 0)} is VALID [2022-04-27 10:52:42,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {685#true} call ULTIMATE.init(); {698#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:52:42,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {698#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {685#true} is VALID [2022-04-27 10:52:42,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-27 10:52:42,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {685#true} {685#true} #60#return; {685#true} is VALID [2022-04-27 10:52:42,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {685#true} call #t~ret3 := main(); {685#true} is VALID [2022-04-27 10:52:42,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {685#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {690#(= main_~x~0 0)} is VALID [2022-04-27 10:52:42,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {690#(= main_~x~0 0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {690#(= main_~x~0 0)} is VALID [2022-04-27 10:52:42,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {690#(= main_~x~0 0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {691#(= main_~m~0 0)} is VALID [2022-04-27 10:52:42,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {691#(= main_~m~0 0)} ~x~0 := 1 + ~x~0; {691#(= main_~m~0 0)} is VALID [2022-04-27 10:52:42,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {691#(= main_~m~0 0)} assume !(~x~0 < ~n~0); {691#(= main_~m~0 0)} is VALID [2022-04-27 10:52:42,489 INFO L272 TraceCheckUtils]: 10: Hoare triple {691#(= main_~m~0 0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {685#true} is VALID [2022-04-27 10:52:42,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {685#true} ~cond := #in~cond; {685#true} is VALID [2022-04-27 10:52:42,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {685#true} assume !(0 == ~cond); {685#true} is VALID [2022-04-27 10:52:42,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-27 10:52:42,490 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {685#true} {691#(= main_~m~0 0)} #56#return; {691#(= main_~m~0 0)} is VALID [2022-04-27 10:52:42,491 INFO L272 TraceCheckUtils]: 15: Hoare triple {691#(= main_~m~0 0)} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {696#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:52:42,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {696#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {697#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:52:42,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {697#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {686#false} is VALID [2022-04-27 10:52:42,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {686#false} assume !false; {686#false} is VALID [2022-04-27 10:52:42,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:52:42,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:52:42,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107961934] [2022-04-27 10:52:42,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107961934] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:52:42,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075986123] [2022-04-27 10:52:42,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:52:42,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:52:42,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:52:42,494 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-04-27 10:52:42,495 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-04-27 10:52:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:42,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 10:52:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:42,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:52:42,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {685#true} call ULTIMATE.init(); {685#true} is VALID [2022-04-27 10:52:42,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {685#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {685#true} is VALID [2022-04-27 10:52:42,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-27 10:52:42,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {685#true} {685#true} #60#return; {685#true} is VALID [2022-04-27 10:52:42,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {685#true} call #t~ret3 := main(); {685#true} is VALID [2022-04-27 10:52:42,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {685#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {685#true} is VALID [2022-04-27 10:52:42,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {685#true} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {720#(< main_~x~0 main_~n~0)} is VALID [2022-04-27 10:52:42,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {720#(< main_~x~0 main_~n~0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {724#(< main_~m~0 main_~n~0)} is VALID [2022-04-27 10:52:42,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {724#(< main_~m~0 main_~n~0)} ~x~0 := 1 + ~x~0; {724#(< main_~m~0 main_~n~0)} is VALID [2022-04-27 10:52:42,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {724#(< main_~m~0 main_~n~0)} assume !(~x~0 < ~n~0); {724#(< main_~m~0 main_~n~0)} is VALID [2022-04-27 10:52:42,696 INFO L272 TraceCheckUtils]: 10: Hoare triple {724#(< main_~m~0 main_~n~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {685#true} is VALID [2022-04-27 10:52:42,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {685#true} ~cond := #in~cond; {685#true} is VALID [2022-04-27 10:52:42,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {685#true} assume !(0 == ~cond); {685#true} is VALID [2022-04-27 10:52:42,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-27 10:52:42,697 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {685#true} {724#(< main_~m~0 main_~n~0)} #56#return; {724#(< main_~m~0 main_~n~0)} is VALID [2022-04-27 10:52:42,697 INFO L272 TraceCheckUtils]: 15: Hoare triple {724#(< main_~m~0 main_~n~0)} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {749#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:52:42,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {749#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {753#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:52:42,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {753#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {686#false} is VALID [2022-04-27 10:52:42,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {686#false} assume !false; {686#false} is VALID [2022-04-27 10:52:42,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:52:42,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 10:52:42,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075986123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:52:42,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 10:52:42,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-04-27 10:52:42,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898496426] [2022-04-27 10:52:42,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:52:42,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-27 10:52:42,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:52:42,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:42,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:42,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:52:42,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:52:42,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:52:42,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-04-27 10:52:42,714 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:42,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:42,839 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-27 10:52:42,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:52:42,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-27 10:52:42,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:52:42,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:42,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2022-04-27 10:52:42,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:42,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2022-04-27 10:52:42,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 30 transitions. [2022-04-27 10:52:42,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:42,867 INFO L225 Difference]: With dead ends: 29 [2022-04-27 10:52:42,867 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 10:52:42,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-27 10:52:42,869 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:52:42,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 71 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:52:42,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 10:52:42,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-27 10:52:42,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:52:42,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:42,894 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:42,896 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:42,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:42,897 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-27 10:52:42,897 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-27 10:52:42,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:42,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:42,898 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 20 states. [2022-04-27 10:52:42,898 INFO L87 Difference]: Start difference. First operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 20 states. [2022-04-27 10:52:42,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:42,899 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-27 10:52:42,899 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-27 10:52:42,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:42,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:42,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:52:42,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:52:42,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-27 10:52:42,900 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 19 [2022-04-27 10:52:42,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:52:42,900 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-27 10:52:42,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:42,901 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-27 10:52:42,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 10:52:42,901 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:52:42,901 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:52:42,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 10:52:43,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:52:43,116 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:52:43,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:52:43,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1930189671, now seen corresponding path program 1 times [2022-04-27 10:52:43,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:52:43,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96221153] [2022-04-27 10:52:43,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:52:43,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:52:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:43,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:52:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:43,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {888#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {876#true} is VALID [2022-04-27 10:52:43,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {876#true} assume true; {876#true} is VALID [2022-04-27 10:52:43,172 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {876#true} {876#true} #60#return; {876#true} is VALID [2022-04-27 10:52:43,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-27 10:52:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:43,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {876#true} ~cond := #in~cond; {876#true} is VALID [2022-04-27 10:52:43,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {876#true} assume !(0 == ~cond); {876#true} is VALID [2022-04-27 10:52:43,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {876#true} assume true; {876#true} is VALID [2022-04-27 10:52:43,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {876#true} {881#(= main_~m~0 0)} #56#return; {881#(= main_~m~0 0)} is VALID [2022-04-27 10:52:43,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {876#true} call ULTIMATE.init(); {888#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:52:43,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {888#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {876#true} is VALID [2022-04-27 10:52:43,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {876#true} assume true; {876#true} is VALID [2022-04-27 10:52:43,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {876#true} {876#true} #60#return; {876#true} is VALID [2022-04-27 10:52:43,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {876#true} call #t~ret3 := main(); {876#true} is VALID [2022-04-27 10:52:43,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {876#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {881#(= main_~m~0 0)} is VALID [2022-04-27 10:52:43,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {881#(= main_~m~0 0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {881#(= main_~m~0 0)} is VALID [2022-04-27 10:52:43,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {881#(= main_~m~0 0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {881#(= main_~m~0 0)} is VALID [2022-04-27 10:52:43,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {881#(= main_~m~0 0)} ~x~0 := 1 + ~x~0; {881#(= main_~m~0 0)} is VALID [2022-04-27 10:52:43,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {881#(= main_~m~0 0)} assume !(~x~0 < ~n~0); {881#(= main_~m~0 0)} is VALID [2022-04-27 10:52:43,184 INFO L272 TraceCheckUtils]: 10: Hoare triple {881#(= main_~m~0 0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {876#true} is VALID [2022-04-27 10:52:43,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {876#true} ~cond := #in~cond; {876#true} is VALID [2022-04-27 10:52:43,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {876#true} assume !(0 == ~cond); {876#true} is VALID [2022-04-27 10:52:43,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {876#true} assume true; {876#true} is VALID [2022-04-27 10:52:43,185 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {876#true} {881#(= main_~m~0 0)} #56#return; {881#(= main_~m~0 0)} is VALID [2022-04-27 10:52:43,185 INFO L272 TraceCheckUtils]: 15: Hoare triple {881#(= main_~m~0 0)} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {886#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:52:43,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {886#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {887#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:52:43,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {887#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {877#false} is VALID [2022-04-27 10:52:43,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {877#false} assume !false; {877#false} is VALID [2022-04-27 10:52:43,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:52:43,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:52:43,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96221153] [2022-04-27 10:52:43,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96221153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:52:43,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:52:43,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:52:43,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906040146] [2022-04-27 10:52:43,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:52:43,187 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-27 10:52:43,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:52:43,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:43,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:43,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:52:43,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:52:43,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:52:43,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:52:43,202 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:43,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:43,285 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-27 10:52:43,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:52:43,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-27 10:52:43,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:52:43,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-27 10:52:43,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:43,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-27 10:52:43,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2022-04-27 10:52:43,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:43,302 INFO L225 Difference]: With dead ends: 20 [2022-04-27 10:52:43,302 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:52:43,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-27 10:52:43,303 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:52:43,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 30 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:52:43,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:52:43,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:52:43,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:52:43,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:52:43,304 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:52:43,304 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:52:43,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:43,304 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:52:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:52:43,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:43,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:43,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:52:43,305 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:52:43,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:43,305 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:52:43,305 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:52:43,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:43,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:43,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:52:43,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:52:43,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:52:43,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:52:43,305 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2022-04-27 10:52:43,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:52:43,306 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:52:43,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:52:43,306 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:52:43,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:43,308 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:52:43,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 10:52:43,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:52:43,471 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-27 10:52:43,471 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-27 10:52:43,471 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-27 10:52:43,471 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-27 10:52:43,471 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:52:43,471 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:52:43,471 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:52:43,471 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 37) the Hoare annotation is: true [2022-04-27 10:52:43,472 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 31) no Hoare annotation was computed. [2022-04-27 10:52:43,472 INFO L899 garLoopResultBuilder]: For program point L29-2(lines 29 31) no Hoare annotation was computed. [2022-04-27 10:52:43,472 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 33) the Hoare annotation is: (let ((.cse0 (<= 0 main_~m~0)) (.cse1 (<= 0 main_~x~0))) (or (and .cse0 .cse1 (= main_~m~0 0)) (and .cse0 (< main_~m~0 main_~n~0) .cse1))) [2022-04-27 10:52:43,472 INFO L895 garLoopResultBuilder]: At program point L28-3(lines 28 33) the Hoare annotation is: (let ((.cse0 (<= 0 main_~m~0)) (.cse1 (<= 0 main_~x~0))) (or (and .cse0 .cse1 (= main_~m~0 0)) (and .cse0 (< main_~m~0 main_~n~0) .cse1) (and (= main_~x~0 0) .cse0 .cse1 (<= main_~n~0 0)))) [2022-04-27 10:52:43,472 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 37) no Hoare annotation was computed. [2022-04-27 10:52:43,472 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 37) no Hoare annotation was computed. [2022-04-27 10:52:43,472 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-04-27 10:52:43,472 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (let ((.cse0 (<= 0 main_~m~0)) (.cse1 (<= 0 main_~x~0))) (or (and .cse0 .cse1 (= main_~m~0 0)) (and .cse0 (< main_~m~0 main_~n~0) .cse1) (and (= main_~x~0 0) .cse0 .cse1 (<= main_~n~0 0)))) [2022-04-27 10:52:43,472 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:52:43,472 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 10:52:43,472 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:52:43,473 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:52:43,473 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:52:43,473 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:52:43,473 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:52:43,473 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:52:43,473 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 10:52:43,473 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:52:43,473 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 10:52:43,473 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 10:52:43,473 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 10:52:43,476 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-04-27 10:52:43,477 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:52:43,480 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:52:43,480 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:52:43,480 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:52:43,481 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 10:52:43,482 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:52:43,482 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 10:52:43,482 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:52:43,482 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:52:43,482 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:52:43,482 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:52:43,485 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 10:52:43,485 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:52:43,485 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:52:43,485 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:52:43,485 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:52:43,485 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 10:52:43,486 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 10:52:43,486 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 10:52:43,486 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:52:43,486 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:52:43,486 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 10:52:43,486 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 10:52:43,486 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2022-04-27 10:52:43,486 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:52:43,486 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:52:43,486 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 10:52:43,486 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:52:43,486 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:52:43,486 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:52:43,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:52:43 BoogieIcfgContainer [2022-04-27 10:52:43,493 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:52:43,494 INFO L158 Benchmark]: Toolchain (without parser) took 4092.85ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 129.7MB in the beginning and 152.1MB in the end (delta: -22.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-04-27 10:52:43,494 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 180.4MB. Free memory is still 145.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:52:43,495 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.12ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 129.5MB in the beginning and 193.5MB in the end (delta: -64.1MB). Peak memory consumption was 7.8MB. Max. memory is 8.0GB. [2022-04-27 10:52:43,495 INFO L158 Benchmark]: Boogie Preprocessor took 28.60ms. Allocated memory is still 217.1MB. Free memory was 193.5MB in the beginning and 191.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 10:52:43,495 INFO L158 Benchmark]: RCFGBuilder took 224.64ms. Allocated memory is still 217.1MB. Free memory was 191.9MB in the beginning and 180.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 10:52:43,495 INFO L158 Benchmark]: TraceAbstraction took 3593.67ms. Allocated memory is still 217.1MB. Free memory was 179.9MB in the beginning and 152.1MB in the end (delta: 27.8MB). Peak memory consumption was 29.3MB. Max. memory is 8.0GB. [2022-04-27 10:52:43,496 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 180.4MB. Free memory is still 145.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.12ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 129.5MB in the beginning and 193.5MB in the end (delta: -64.1MB). Peak memory consumption was 7.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.60ms. Allocated memory is still 217.1MB. Free memory was 193.5MB in the beginning and 191.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 224.64ms. Allocated memory is still 217.1MB. Free memory was 191.9MB in the beginning and 180.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3593.67ms. Allocated memory is still 217.1MB. Free memory was 179.9MB in the beginning and 152.1MB in the end (delta: 27.8MB). Peak memory consumption was 29.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 126 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 236 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 143 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 259 IncrementalHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 93 mSDtfsCounter, 259 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=2, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 15 PreInvPairs, 23 NumberOfFragments, 100 HoareAnnotationTreeSize, 15 FomulaSimplifications, 236 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 131 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 300 SizeOfPredicates, 5 NumberOfNonLiveVariables, 131 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 10/14 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((0 <= m && 0 <= x) && m == 0) || ((0 <= m && m < n) && 0 <= x) RESULT: Ultimate proved your program to be correct! [2022-04-27 10:52:43,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...