/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/loops/sum01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:19:30,976 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:19:30,983 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:19:31,018 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:19:31,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:19:31,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:19:31,021 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:19:31,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:19:31,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:19:31,028 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:19:31,028 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:19:31,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:19:31,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:19:31,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:19:31,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:19:31,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:19:31,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:19:31,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:19:31,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:19:31,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:19:31,037 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:19:31,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:19:31,039 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:19:31,040 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:19:31,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:19:31,044 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:19:31,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:19:31,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:19:31,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:19:31,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:19:31,045 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:19:31,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:19:31,046 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:19:31,046 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:19:31,047 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:19:31,047 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:19:31,047 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:19:31,048 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:19:31,048 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:19:31,048 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:19:31,049 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:19:31,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:19:31,053 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:19:31,075 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:19:31,075 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:19:31,075 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:19:31,075 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:19:31,076 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:19:31,076 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:19:31,076 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:19:31,076 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:19:31,076 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:19:31,077 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:19:31,077 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:19:31,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:19:31,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:19:31,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:19:31,077 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:19:31,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:19:31,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:19:31,078 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:19:31,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:19:31,078 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:19:31,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:19:31,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:19:31,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:19:31,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:19:31,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:19:31,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:19:31,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:19:31,079 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:19:31,079 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:19:31,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:19:31,079 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:19:31,080 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:19:31,080 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:19:31,080 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:19:31,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:19:31,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:19:31,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:19:31,293 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:19:31,294 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:19:31,294 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01-2.i [2022-04-27 10:19:31,340 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/657c1154b/83eb37399e0449978ba538ba922f0105/FLAG554a49847 [2022-04-27 10:19:31,700 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:19:31,701 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-2.i [2022-04-27 10:19:31,704 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/657c1154b/83eb37399e0449978ba538ba922f0105/FLAG554a49847 [2022-04-27 10:19:31,729 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/657c1154b/83eb37399e0449978ba538ba922f0105 [2022-04-27 10:19:31,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:19:31,731 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:19:31,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:19:31,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:19:31,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:19:31,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:19:31" (1/1) ... [2022-04-27 10:19:31,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ed96ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:31, skipping insertion in model container [2022-04-27 10:19:31,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:19:31" (1/1) ... [2022-04-27 10:19:31,740 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:19:31,749 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:19:31,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-2.i[849,862] [2022-04-27 10:19:31,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:19:31,882 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:19:31,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-2.i[849,862] [2022-04-27 10:19:31,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:19:31,904 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:19:31,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:31 WrapperNode [2022-04-27 10:19:31,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:19:31,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:19:31,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:19:31,906 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:19:31,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:31" (1/1) ... [2022-04-27 10:19:31,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:31" (1/1) ... [2022-04-27 10:19:31,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:31" (1/1) ... [2022-04-27 10:19:31,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:31" (1/1) ... [2022-04-27 10:19:31,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:31" (1/1) ... [2022-04-27 10:19:31,928 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:31" (1/1) ... [2022-04-27 10:19:31,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:31" (1/1) ... [2022-04-27 10:19:31,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:19:31,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:19:31,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:19:31,939 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:19:31,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:31" (1/1) ... [2022-04-27 10:19:31,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:19:31,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:19:31,976 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:19:31,994 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:19:32,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:19:32,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:19:32,008 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:19:32,009 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:19:32,010 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:19:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:19:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:19:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:19:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:19:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:19:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:19:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:19:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:19:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:19:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:19:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:19:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:19:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:19:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:19:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:19:32,058 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:19:32,059 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:19:32,149 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:19:32,154 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:19:32,154 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:19:32,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:19:32 BoogieIcfgContainer [2022-04-27 10:19:32,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:19:32,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:19:32,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:19:32,158 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:19:32,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:19:31" (1/3) ... [2022-04-27 10:19:32,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b0ab0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:19:32, skipping insertion in model container [2022-04-27 10:19:32,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:31" (2/3) ... [2022-04-27 10:19:32,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b0ab0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:19:32, skipping insertion in model container [2022-04-27 10:19:32,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:19:32" (3/3) ... [2022-04-27 10:19:32,160 INFO L111 eAbstractionObserver]: Analyzing ICFG sum01-2.i [2022-04-27 10:19:32,169 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:19:32,169 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:19:32,197 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:19:32,201 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@5d42b3c7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6e1b2fc2 [2022-04-27 10:19:32,201 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:19:32,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:19:32,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:19:32,211 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:32,212 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:32,212 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:32,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:32,217 INFO L85 PathProgramCache]: Analyzing trace with hash -241432906, now seen corresponding path program 1 times [2022-04-27 10:19:32,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:32,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830959433] [2022-04-27 10:19:32,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:32,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:32,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:32,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(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(10, 2); {23#true} is VALID [2022-04-27 10:19:32,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 10:19:32,420 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #46#return; {23#true} is VALID [2022-04-27 10:19:32,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:32,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(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(10, 2); {23#true} is VALID [2022-04-27 10:19:32,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 10:19:32,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #46#return; {23#true} is VALID [2022-04-27 10:19:32,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2022-04-27 10:19:32,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;~sn~0 := 0; {28#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:32,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {28#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:32,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} assume !(~i~0 <= ~n~0); {28#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:32,429 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {29#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:19:32,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {30#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:19:32,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24#false} is VALID [2022-04-27 10:19:32,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-27 10:19:32,433 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:19:32,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:32,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830959433] [2022-04-27 10:19:32,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830959433] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:19:32,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:19:32,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:19:32,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986768584] [2022-04-27 10:19:32,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:19:32,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-27 10:19:32,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:32,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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:19:32,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:32,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:19:32,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:32,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:19:32,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:19:32,496 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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:19:32,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:32,712 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-04-27 10:19:32,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:19:32,713 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-27 10:19:32,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:32,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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:19:32,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-27 10:19:32,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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:19:32,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-27 10:19:32,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2022-04-27 10:19:32,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:32,764 INFO L225 Difference]: With dead ends: 39 [2022-04-27 10:19:32,764 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 10:19:32,766 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:19:32,768 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:32,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 35 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:19:32,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 10:19:32,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 10:19:32,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:32,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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:19:32,791 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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:19:32,791 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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:19:32,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:32,797 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 10:19:32,797 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 10:19:32,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:32,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:32,798 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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) Second operand 15 states. [2022-04-27 10:19:32,799 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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) Second operand 15 states. [2022-04-27 10:19:32,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:32,801 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 10:19:32,801 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 10:19:32,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:32,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:32,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:32,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:32,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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:19:32,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-27 10:19:32,817 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-27 10:19:32,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:32,817 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-27 10:19:32,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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:19:32,819 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 10:19:32,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 10:19:32,822 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:32,822 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:32,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:19:32,823 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:32,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:32,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1042759188, now seen corresponding path program 1 times [2022-04-27 10:19:32,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:32,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265261865] [2022-04-27 10:19:32,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:32,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:33,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:33,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {158#(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(10, 2); {146#true} is VALID [2022-04-27 10:19:33,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#true} assume true; {146#true} is VALID [2022-04-27 10:19:33,056 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {146#true} {146#true} #46#return; {146#true} is VALID [2022-04-27 10:19:33,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {146#true} call ULTIMATE.init(); {158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:33,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {158#(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(10, 2); {146#true} is VALID [2022-04-27 10:19:33,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {146#true} assume true; {146#true} is VALID [2022-04-27 10:19:33,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146#true} {146#true} #46#return; {146#true} is VALID [2022-04-27 10:19:33,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {146#true} call #t~ret3 := main(); {146#true} is VALID [2022-04-27 10:19:33,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {146#true} havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;~sn~0 := 0; {151#(= main_~sn~0 0)} is VALID [2022-04-27 10:19:33,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {151#(= main_~sn~0 0)} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {152#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 10:19:33,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {152#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {153#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} is VALID [2022-04-27 10:19:33,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {153#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {154#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-27 10:19:33,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {154#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} assume !(~i~0 <= ~n~0); {155#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:33,060 INFO L272 TraceCheckUtils]: 10: Hoare triple {155#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {156#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:19:33,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {156#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {157#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:19:33,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {157#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {147#false} is VALID [2022-04-27 10:19:33,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {147#false} assume !false; {147#false} is VALID [2022-04-27 10:19:33,062 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:19:33,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:33,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265261865] [2022-04-27 10:19:33,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265261865] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:19:33,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835873550] [2022-04-27 10:19:33,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:33,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:19:33,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:19:33,065 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:19:33,097 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:19:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:33,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 10:19:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:33,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:19:33,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {146#true} call ULTIMATE.init(); {146#true} is VALID [2022-04-27 10:19:33,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#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(10, 2); {146#true} is VALID [2022-04-27 10:19:33,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {146#true} assume true; {146#true} is VALID [2022-04-27 10:19:33,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146#true} {146#true} #46#return; {146#true} is VALID [2022-04-27 10:19:33,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {146#true} call #t~ret3 := main(); {146#true} is VALID [2022-04-27 10:19:33,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {146#true} havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;~sn~0 := 0; {151#(= main_~sn~0 0)} is VALID [2022-04-27 10:19:33,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {151#(= main_~sn~0 0)} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {152#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 10:19:33,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {152#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {183#(and (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 2) main_~sn~0) 0))} is VALID [2022-04-27 10:19:33,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {183#(and (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 2) main_~sn~0) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {187#(and (<= 1 main_~n~0) (<= main_~i~0 2) (= (+ (- 2) main_~sn~0) 0))} is VALID [2022-04-27 10:19:33,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {187#(and (<= 1 main_~n~0) (<= main_~i~0 2) (= (+ (- 2) main_~sn~0) 0))} assume !(~i~0 <= ~n~0); {191#(and (<= 1 main_~n~0) (< main_~n~0 2) (= (+ (- 2) main_~sn~0) 0))} is VALID [2022-04-27 10:19:33,420 INFO L272 TraceCheckUtils]: 10: Hoare triple {191#(and (<= 1 main_~n~0) (< main_~n~0 2) (= (+ (- 2) main_~sn~0) 0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {195#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:19:33,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {195#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {199#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:19:33,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {199#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {147#false} is VALID [2022-04-27 10:19:33,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {147#false} assume !false; {147#false} is VALID [2022-04-27 10:19:33,421 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:19:33,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:19:33,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {147#false} assume !false; {147#false} is VALID [2022-04-27 10:19:33,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {199#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {147#false} is VALID [2022-04-27 10:19:33,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {195#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {199#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:19:33,686 INFO L272 TraceCheckUtils]: 10: Hoare triple {215#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {195#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:19:33,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {219#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} assume !(~i~0 <= ~n~0); {215#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:33,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {223#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {219#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:33,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {227#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {223#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:33,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {231#(or (and (<= 2 (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) 1)) (= (+ 2 main_~sn~0) 0))} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {227#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-27 10:19:33,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {146#true} havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;~sn~0 := 0; {231#(or (and (<= 2 (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) 1)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-27 10:19:33,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {146#true} call #t~ret3 := main(); {146#true} is VALID [2022-04-27 10:19:33,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146#true} {146#true} #46#return; {146#true} is VALID [2022-04-27 10:19:33,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {146#true} assume true; {146#true} is VALID [2022-04-27 10:19:33,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#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(10, 2); {146#true} is VALID [2022-04-27 10:19:33,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {146#true} call ULTIMATE.init(); {146#true} is VALID [2022-04-27 10:19:33,691 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:19:33,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835873550] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:19:33,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:19:33,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-04-27 10:19:33,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959286051] [2022-04-27 10:19:33,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:19:33,693 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 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:19:33,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:33,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:33,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:33,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 10:19:33,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:33,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 10:19:33,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-04-27 10:19:33,713 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:34,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:34,039 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-04-27 10:19:34,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 10:19:34,039 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 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:19:34,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:34,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:34,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 26 transitions. [2022-04-27 10:19:34,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:34,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 26 transitions. [2022-04-27 10:19:34,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 26 transitions. [2022-04-27 10:19:34,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:34,068 INFO L225 Difference]: With dead ends: 25 [2022-04-27 10:19:34,068 INFO L226 Difference]: Without dead ends: 19 [2022-04-27 10:19:34,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2022-04-27 10:19:34,070 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:34,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 52 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:19:34,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-27 10:19:34,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-27 10:19:34,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:34,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 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:19:34,074 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 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:19:34,075 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 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:19:34,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:34,075 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-27 10:19:34,076 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-27 10:19:34,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:34,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:34,076 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 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) Second operand 19 states. [2022-04-27 10:19:34,076 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 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) Second operand 19 states. [2022-04-27 10:19:34,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:34,077 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-27 10:19:34,077 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-27 10:19:34,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:34,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:34,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:34,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:34,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 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:19:34,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-27 10:19:34,078 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 14 [2022-04-27 10:19:34,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:34,078 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-27 10:19:34,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:34,079 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-27 10:19:34,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 10:19:34,079 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:34,079 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:34,097 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:19:34,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:19:34,295 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:34,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:34,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1341755824, now seen corresponding path program 2 times [2022-04-27 10:19:34,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:34,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263537244] [2022-04-27 10:19:34,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:34,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:34,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:34,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {392#(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(10, 2); {377#true} is VALID [2022-04-27 10:19:34,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#true} assume true; {377#true} is VALID [2022-04-27 10:19:34,479 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {377#true} {377#true} #46#return; {377#true} is VALID [2022-04-27 10:19:34,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {377#true} call ULTIMATE.init(); {392#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:34,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {392#(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(10, 2); {377#true} is VALID [2022-04-27 10:19:34,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#true} assume true; {377#true} is VALID [2022-04-27 10:19:34,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#true} {377#true} #46#return; {377#true} is VALID [2022-04-27 10:19:34,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#true} call #t~ret3 := main(); {377#true} is VALID [2022-04-27 10:19:34,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {377#true} havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;~sn~0 := 0; {382#(= main_~sn~0 0)} is VALID [2022-04-27 10:19:34,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {382#(= main_~sn~0 0)} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {383#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 10:19:34,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {383#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {384#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-27 10:19:34,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {384#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {385#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-27 10:19:34,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {385#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {386#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:34,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {386#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {385#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-27 10:19:34,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {385#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {387#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-27 10:19:34,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {387#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {388#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-27 10:19:34,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {388#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} assume !(~i~0 <= ~n~0); {389#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:34,486 INFO L272 TraceCheckUtils]: 14: Hoare triple {389#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {390#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:19:34,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {390#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {391#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:19:34,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {391#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {378#false} is VALID [2022-04-27 10:19:34,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {378#false} assume !false; {378#false} is VALID [2022-04-27 10:19:34,487 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:19:34,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:34,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263537244] [2022-04-27 10:19:34,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263537244] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:19:34,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52732752] [2022-04-27 10:19:34,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:19:34,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:19:34,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:19:34,504 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:19:34,517 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:19:34,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:19:34,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:19:34,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 10:19:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:34,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:19:34,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {377#true} call ULTIMATE.init(); {377#true} is VALID [2022-04-27 10:19:34,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#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(10, 2); {377#true} is VALID [2022-04-27 10:19:34,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#true} assume true; {377#true} is VALID [2022-04-27 10:19:34,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#true} {377#true} #46#return; {377#true} is VALID [2022-04-27 10:19:34,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#true} call #t~ret3 := main(); {377#true} is VALID [2022-04-27 10:19:34,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {377#true} havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;~sn~0 := 0; {382#(= main_~sn~0 0)} is VALID [2022-04-27 10:19:34,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {382#(= main_~sn~0 0)} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {383#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 10:19:34,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {383#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {384#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-27 10:19:34,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {384#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {420#(and (= (+ (- 2) main_~i~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-27 10:19:34,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {420#(and (= (+ (- 2) main_~i~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {424#(and (= (+ (- 2) main_~i~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-27 10:19:34,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {424#(and (= (+ (- 2) main_~i~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {428#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= (+ main_~i~0 (- 3)) 0))} is VALID [2022-04-27 10:19:34,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {428#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= (+ main_~i~0 (- 3)) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {432#(and (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (= (+ main_~i~0 (- 3)) 0) (<= main_~sn~0 6))} is VALID [2022-04-27 10:19:34,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {432#(and (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (= (+ main_~i~0 (- 3)) 0) (<= main_~sn~0 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {436#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (<= main_~sn~0 6) (<= main_~i~0 4))} is VALID [2022-04-27 10:19:34,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {436#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (<= main_~sn~0 6) (<= main_~i~0 4))} assume !(~i~0 <= ~n~0); {440#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (< main_~n~0 4) (<= main_~sn~0 6))} is VALID [2022-04-27 10:19:34,948 INFO L272 TraceCheckUtils]: 14: Hoare triple {440#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (< main_~n~0 4) (<= main_~sn~0 6))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {444#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:19:34,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {444#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {448#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:19:34,949 INFO L290 TraceCheckUtils]: 16: Hoare triple {448#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {378#false} is VALID [2022-04-27 10:19:34,949 INFO L290 TraceCheckUtils]: 17: Hoare triple {378#false} assume !false; {378#false} is VALID [2022-04-27 10:19:34,949 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:19:34,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:19:35,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {378#false} assume !false; {378#false} is VALID [2022-04-27 10:19:35,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {448#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {378#false} is VALID [2022-04-27 10:19:35,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {444#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {448#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:19:35,357 INFO L272 TraceCheckUtils]: 14: Hoare triple {464#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {444#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:19:35,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {468#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} assume !(~i~0 <= ~n~0); {464#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:35,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {472#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {468#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:35,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {476#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {472#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:35,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {480#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {476#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-27 10:19:35,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {484#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {480#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-27 10:19:35,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {488#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {484#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-27 10:19:35,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {492#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {488#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-27 10:19:35,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {496#(or (= (+ 6 main_~sn~0) 0) (and (<= 4 (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2))) (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) 3)))} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {492#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} is VALID [2022-04-27 10:19:35,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {377#true} havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;~sn~0 := 0; {496#(or (= (+ 6 main_~sn~0) 0) (and (<= 4 (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2))) (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) 3)))} is VALID [2022-04-27 10:19:35,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#true} call #t~ret3 := main(); {377#true} is VALID [2022-04-27 10:19:35,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#true} {377#true} #46#return; {377#true} is VALID [2022-04-27 10:19:35,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#true} assume true; {377#true} is VALID [2022-04-27 10:19:35,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#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(10, 2); {377#true} is VALID [2022-04-27 10:19:35,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {377#true} call ULTIMATE.init(); {377#true} is VALID [2022-04-27 10:19:35,365 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:19:35,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52732752] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:19:35,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:19:35,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2022-04-27 10:19:35,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071017086] [2022-04-27 10:19:35,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:19:35,366 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 10:19:35,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:35,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:35,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:35,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-27 10:19:35,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:35,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-27 10:19:35,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=751, Unknown=0, NotChecked=0, Total=870 [2022-04-27 10:19:35,395 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:36,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:36,002 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-27 10:19:36,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 10:19:36,003 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 10:19:36,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:36,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:36,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2022-04-27 10:19:36,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:36,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2022-04-27 10:19:36,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 23 transitions. [2022-04-27 10:19:36,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:36,024 INFO L225 Difference]: With dead ends: 22 [2022-04-27 10:19:36,025 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:19:36,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=275, Invalid=1617, Unknown=0, NotChecked=0, Total=1892 [2022-04-27 10:19:36,026 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:36,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 80 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:19:36,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:19:36,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:19:36,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:36,027 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:19:36,027 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:19:36,027 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:19:36,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:36,027 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:19:36,027 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:19:36,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:36,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:36,027 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:19:36,028 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:19:36,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:36,028 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:19:36,028 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:19:36,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:36,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:36,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:36,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:36,028 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:19:36,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:19:36,028 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-04-27 10:19:36,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:36,028 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:19:36,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:36,028 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:19:36,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:36,030 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:19:36,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 10:19:36,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 10:19:36,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:19:36,304 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-27 10:19:36,304 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-27 10:19:36,304 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-27 10:19:36,304 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 22 29) the Hoare annotation is: true [2022-04-27 10:19:36,304 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 22 29) no Hoare annotation was computed. [2022-04-27 10:19:36,304 INFO L899 garLoopResultBuilder]: For program point L24(line 24) no Hoare annotation was computed. [2022-04-27 10:19:36,306 INFO L899 garLoopResultBuilder]: For program point L25-2(lines 25 27) no Hoare annotation was computed. [2022-04-27 10:19:36,306 INFO L895 garLoopResultBuilder]: At program point L25-3(lines 25 27) the Hoare annotation is: (or (and (= main_~sn~0 0) (= main_~i~0 1)) (let ((.cse1 (+ 2 main_~sn~0)) (.cse0 (* main_~i~0 2))) (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= .cse0 .cse1) (<= .cse1 .cse0)))) [2022-04-27 10:19:36,306 INFO L895 garLoopResultBuilder]: At program point L25-4(lines 25 27) the Hoare annotation is: (or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0)) [2022-04-27 10:19:36,306 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 22 29) no Hoare annotation was computed. [2022-04-27 10:19:36,306 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:19:36,306 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:19:36,306 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:19:36,308 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:19:36,308 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:19:36,308 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:19:36,308 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:19:36,310 INFO L899 garLoopResultBuilder]: For program point L17(line 17) no Hoare annotation was computed. [2022-04-27 10:19:36,311 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 18) no Hoare annotation was computed. [2022-04-27 10:19:36,311 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 15 20) the Hoare annotation is: true [2022-04-27 10:19:36,311 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 15 20) no Hoare annotation was computed. [2022-04-27 10:19:36,311 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 15 20) no Hoare annotation was computed. [2022-04-27 10:19:36,311 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-04-27 10:19:36,313 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1] [2022-04-27 10:19:36,315 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:19:36,320 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:19:36,320 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:19:36,320 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:19:36,320 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 10:19:36,320 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 10:19:36,320 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 10:19:36,320 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:19:36,320 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:19:36,321 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 10:19:36,321 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 10:19:36,321 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 10:19:36,321 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 10:19:36,321 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:19:36,321 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:19:36,321 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:19:36,324 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2022-04-27 10:19:36,324 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-27 10:19:36,324 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-27 10:19:36,324 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-27 10:19:36,324 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:19:36,324 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:19:36,324 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2022-04-27 10:19:36,324 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:19:36,324 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:19:36,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:19:36 BoogieIcfgContainer [2022-04-27 10:19:36,330 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:19:36,332 INFO L158 Benchmark]: Toolchain (without parser) took 4599.03ms. Allocated memory was 189.8MB in the beginning and 230.7MB in the end (delta: 40.9MB). Free memory was 161.6MB in the beginning and 176.9MB in the end (delta: -15.3MB). Peak memory consumption was 25.6MB. Max. memory is 8.0GB. [2022-04-27 10:19:36,333 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 189.8MB. Free memory is still 149.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:19:36,333 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.82ms. Allocated memory is still 189.8MB. Free memory was 161.4MB in the beginning and 160.2MB in the end (delta: 1.2MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. [2022-04-27 10:19:36,333 INFO L158 Benchmark]: Boogie Preprocessor took 32.36ms. Allocated memory is still 189.8MB. Free memory was 160.2MB in the beginning and 158.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 10:19:36,333 INFO L158 Benchmark]: RCFGBuilder took 216.54ms. Allocated memory is still 189.8MB. Free memory was 158.7MB in the beginning and 148.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 10:19:36,333 INFO L158 Benchmark]: TraceAbstraction took 4173.76ms. Allocated memory was 189.8MB in the beginning and 230.7MB in the end (delta: 40.9MB). Free memory was 147.4MB in the beginning and 176.9MB in the end (delta: -29.6MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-04-27 10:19:36,334 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.26ms. Allocated memory is still 189.8MB. Free memory is still 149.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 171.82ms. Allocated memory is still 189.8MB. Free memory was 161.4MB in the beginning and 160.2MB in the end (delta: 1.2MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.36ms. Allocated memory is still 189.8MB. Free memory was 160.2MB in the beginning and 158.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 216.54ms. Allocated memory is still 189.8MB. Free memory was 158.7MB in the beginning and 148.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4173.76ms. Allocated memory was 189.8MB in the beginning and 230.7MB in the end (delta: 40.9MB). Free memory was 147.4MB in the beginning and 176.9MB in the end (delta: -29.6MB). Peak memory consumption was 11.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: 17]: 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 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 55 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 167 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 291 IncrementalHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 32 mSDtfsCounter, 291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 20 NumberOfFragments, 50 HoareAnnotationTreeSize, 12 FomulaSimplifications, 23 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 138 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 763 SizeOfPredicates, 6 NumberOfNonLiveVariables, 130 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 1/30 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: 25]: Loop Invariant Derived loop invariant: (sn == 0 && i == 1) || ((sn < n * 2 + 1 && i * 2 <= 2 + sn) && 2 + sn <= i * 2) RESULT: Ultimate proved your program to be correct! [2022-04-27 10:19:36,360 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...