/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/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/id_build.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 03:53:31,882 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 03:53:31,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 03:53:31,902 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 03:53:31,902 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 03:53:31,903 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 03:53:31,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 03:53:31,911 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 03:53:31,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 03:53:31,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 03:53:31,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 03:53:31,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 03:53:31,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 03:53:31,919 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 03:53:31,920 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 03:53:31,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 03:53:31,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 03:53:31,922 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 03:53:31,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 03:53:31,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 03:53:31,930 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 03:53:31,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 03:53:31,931 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 03:53:31,931 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 03:53:31,932 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 03:53:31,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 03:53:31,937 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 03:53:31,937 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 03:53:31,938 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 03:53:31,939 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 03:53:31,940 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 03:53:31,940 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 03:53:31,941 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 03:53:31,942 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 03:53:31,942 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 03:53:31,943 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 03:53:31,943 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 03:53:31,943 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 03:53:31,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 03:53:31,944 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 03:53:31,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 03:53:31,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 03:53:31,946 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 03:53:31,954 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 03:53:31,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 03:53:31,955 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 03:53:31,955 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 03:53:31,956 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 03:53:31,956 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 03:53:31,956 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 03:53:31,956 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 03:53:31,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 03:53:31,957 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 03:53:31,957 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 03:53:31,957 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 03:53:31,957 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 03:53:31,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 03:53:31,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 03:53:31,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 03:53:31,957 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 03:53:31,958 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 03:53:31,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:53:31,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 03:53:31,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 03:53:31,958 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 03:53:31,958 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 03:53:31,958 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 03:53:31,958 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 03:53:31,958 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-08 03:53:32,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 03:53:32,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 03:53:32,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 03:53:32,185 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 03:53:32,187 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 03:53:32,187 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/id_build.i.v+lhb-reducer.c [2022-04-08 03:53:32,238 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50cf1cc1f/90a6768626774b6980580dd79b06af79/FLAG905c352b4 [2022-04-08 03:53:32,526 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 03:53:32,527 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_build.i.v+lhb-reducer.c [2022-04-08 03:53:32,531 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50cf1cc1f/90a6768626774b6980580dd79b06af79/FLAG905c352b4 [2022-04-08 03:53:32,974 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50cf1cc1f/90a6768626774b6980580dd79b06af79 [2022-04-08 03:53:32,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 03:53:32,977 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 03:53:32,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 03:53:32,981 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 03:53:32,984 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 03:53:32,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:53:32" (1/1) ... [2022-04-08 03:53:32,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7280d51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:32, skipping insertion in model container [2022-04-08 03:53:32,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:53:32" (1/1) ... [2022-04-08 03:53:32,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 03:53:33,005 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 03:53:33,126 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_build.i.v+lhb-reducer.c[854,867] [2022-04-08 03:53:33,130 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_build.i.v+lhb-reducer.c[1096,1109] [2022-04-08 03:53:33,132 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_build.i.v+lhb-reducer.c[1375,1388] [2022-04-08 03:53:33,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:53:33,149 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 03:53:33,160 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_build.i.v+lhb-reducer.c[854,867] [2022-04-08 03:53:33,162 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_build.i.v+lhb-reducer.c[1096,1109] [2022-04-08 03:53:33,164 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_build.i.v+lhb-reducer.c[1375,1388] [2022-04-08 03:53:33,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:53:33,178 INFO L208 MainTranslator]: Completed translation [2022-04-08 03:53:33,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:33 WrapperNode [2022-04-08 03:53:33,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 03:53:33,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 03:53:33,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 03:53:33,180 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 03:53:33,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:33" (1/1) ... [2022-04-08 03:53:33,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:33" (1/1) ... [2022-04-08 03:53:33,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:33" (1/1) ... [2022-04-08 03:53:33,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:33" (1/1) ... [2022-04-08 03:53:33,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:33" (1/1) ... [2022-04-08 03:53:33,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:33" (1/1) ... [2022-04-08 03:53:33,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:33" (1/1) ... [2022-04-08 03:53:33,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 03:53:33,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 03:53:33,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 03:53:33,205 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 03:53:33,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:33" (1/1) ... [2022-04-08 03:53:33,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:53:33,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:53:33,238 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-08 03:53:33,263 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-08 03:53:33,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 03:53:33,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 03:53:33,292 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 03:53:33,292 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 03:53:33,293 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 03:53:33,293 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 03:53:33,293 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 03:53:33,293 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 03:53:33,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 03:53:33,294 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 03:53:33,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 03:53:33,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 03:53:33,295 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 03:53:33,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 03:53:33,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 03:53:33,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 03:53:33,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 03:53:33,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 03:53:33,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 03:53:33,345 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 03:53:33,346 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 03:53:33,464 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 03:53:33,471 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 03:53:33,471 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-08 03:53:33,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:53:33 BoogieIcfgContainer [2022-04-08 03:53:33,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 03:53:33,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 03:53:33,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 03:53:33,478 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 03:53:33,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:53:32" (1/3) ... [2022-04-08 03:53:33,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5132201a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:53:33, skipping insertion in model container [2022-04-08 03:53:33,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:33" (2/3) ... [2022-04-08 03:53:33,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5132201a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:53:33, skipping insertion in model container [2022-04-08 03:53:33,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:53:33" (3/3) ... [2022-04-08 03:53:33,481 INFO L111 eAbstractionObserver]: Analyzing ICFG id_build.i.v+lhb-reducer.c [2022-04-08 03:53:33,486 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 03:53:33,486 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-04-08 03:53:33,542 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 03:53:33,548 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-04-08 03:53:33,548 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-04-08 03:53:33,565 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.625) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:53:33,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-04-08 03:53:33,571 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:33,572 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:53:33,572 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:33,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:33,577 INFO L85 PathProgramCache]: Analyzing trace with hash 557366739, now seen corresponding path program 1 times [2022-04-08 03:53:33,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:33,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1908330914] [2022-04-08 03:53:33,592 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:53:33,593 INFO L85 PathProgramCache]: Analyzing trace with hash 557366739, now seen corresponding path program 2 times [2022-04-08 03:53:33,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:53:33,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384478542] [2022-04-08 03:53:33,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:53:33,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:53:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:33,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:53:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:33,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_100~0)| ~__return_100~0) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_100~0 := 0; {27#true} is VALID [2022-04-08 03:53:33,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-08 03:53:33,874 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #59#return; {27#true} is VALID [2022-04-08 03:53:33,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {34#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_100~0)| ~__return_100~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:53:33,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_100~0)| ~__return_100~0) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_100~0 := 0; {27#true} is VALID [2022-04-08 03:53:33,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-08 03:53:33,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #59#return; {27#true} is VALID [2022-04-08 03:53:33,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret5 := main(); {27#true} is VALID [2022-04-08 03:53:33,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} havoc ~main__offset~0;havoc ~main__length~0;havoc ~main__nlen~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__nlen~0 := #t~nondet4;havoc #t~nondet4;havoc ~main__i~0;havoc ~main__j~0;~main__i~0 := 0; {27#true} is VALID [2022-04-08 03:53:33,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume ~main__i~0 < ~main__nlen~0;~main__j~0 := 0; {32#(< main_~main__i~0 main_~main__nlen~0)} is VALID [2022-04-08 03:53:33,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#(< main_~main__i~0 main_~main__nlen~0)} assume ~main__j~0 < 8;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__nlen~0 - 1 - ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {33#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-08 03:53:33,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {28#false} is VALID [2022-04-08 03:53:33,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-08 03:53:33,883 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-08 03:53:33,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:53:33,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384478542] [2022-04-08 03:53:33,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384478542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:33,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:33,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:53:33,889 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:53:33,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1908330914] [2022-04-08 03:53:33,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1908330914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:33,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:33,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:53:33,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840359957] [2022-04-08 03:53:33,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:53:33,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-04-08 03:53:33,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:53:33,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:33,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:33,913 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 03:53:33,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:33,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 03:53:33,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:53:33,936 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.625) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:34,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:34,129 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-08 03:53:34,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:53:34,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-04-08 03:53:34,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:53:34,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-04-08 03:53:34,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:34,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-04-08 03:53:34,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 35 transitions. [2022-04-08 03:53:34,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:34,170 INFO L225 Difference]: With dead ends: 30 [2022-04-08 03:53:34,171 INFO L226 Difference]: Without dead ends: 18 [2022-04-08 03:53:34,172 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-08 03:53:34,174 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 37 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:53:34,175 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 39 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:53:34,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-08 03:53:34,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-08 03:53:34,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:53:34,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:34,210 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:34,210 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:34,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:34,212 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-08 03:53:34,212 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-08 03:53:34,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:34,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:34,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-08 03:53:34,213 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-08 03:53:34,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:34,214 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-08 03:53:34,214 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-08 03:53:34,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:34,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:34,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:53:34,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:53:34,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:34,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-08 03:53:34,217 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 10 [2022-04-08 03:53:34,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:53:34,217 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-08 03:53:34,217 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:34,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-08 03:53:34,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:34,235 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-08 03:53:34,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 03:53:34,235 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:34,235 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:53:34,235 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 03:53:34,235 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:34,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:34,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1241381707, now seen corresponding path program 1 times [2022-04-08 03:53:34,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:34,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1373669585] [2022-04-08 03:53:34,237 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:53:34,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1241381707, now seen corresponding path program 2 times [2022-04-08 03:53:34,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:53:34,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835574049] [2022-04-08 03:53:34,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:53:34,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:53:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:34,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:53:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:34,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {182#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_100~0)| ~__return_100~0) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_100~0 := 0; {175#true} is VALID [2022-04-08 03:53:34,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {175#true} assume true; {175#true} is VALID [2022-04-08 03:53:34,296 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {175#true} {175#true} #59#return; {175#true} is VALID [2022-04-08 03:53:34,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {175#true} call ULTIMATE.init(); {182#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_100~0)| ~__return_100~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:53:34,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {182#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_100~0)| ~__return_100~0) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_100~0 := 0; {175#true} is VALID [2022-04-08 03:53:34,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {175#true} assume true; {175#true} is VALID [2022-04-08 03:53:34,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {175#true} {175#true} #59#return; {175#true} is VALID [2022-04-08 03:53:34,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {175#true} call #t~ret5 := main(); {175#true} is VALID [2022-04-08 03:53:34,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {175#true} havoc ~main__offset~0;havoc ~main__length~0;havoc ~main__nlen~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__nlen~0 := #t~nondet4;havoc #t~nondet4;havoc ~main__i~0;havoc ~main__j~0;~main__i~0 := 0; {180#(< 0 (+ main_~main__i~0 1))} is VALID [2022-04-08 03:53:34,299 INFO L290 TraceCheckUtils]: 6: Hoare triple {180#(< 0 (+ main_~main__i~0 1))} assume ~main__i~0 < ~main__nlen~0;~main__j~0 := 0; {180#(< 0 (+ main_~main__i~0 1))} is VALID [2022-04-08 03:53:34,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {180#(< 0 (+ main_~main__i~0 1))} assume ~main__j~0 < 8;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__nlen~0 - 1 - ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {180#(< 0 (+ main_~main__i~0 1))} is VALID [2022-04-08 03:53:34,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {180#(< 0 (+ main_~main__i~0 1))} assume !(0 == ~__VERIFIER_assert__cond~0); {180#(< 0 (+ main_~main__i~0 1))} is VALID [2022-04-08 03:53:34,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {180#(< 0 (+ main_~main__i~0 1))} havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__nlen~0 - 1 - ~main__i~0 < ~main__nlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {181#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-08 03:53:34,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {181#(not (= main_~__VERIFIER_assert__cond~1 0))} assume 0 == ~__VERIFIER_assert__cond~1; {176#false} is VALID [2022-04-08 03:53:34,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {176#false} assume !false; {176#false} is VALID [2022-04-08 03:53:34,301 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-08 03:53:34,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:53:34,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835574049] [2022-04-08 03:53:34,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835574049] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:34,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:34,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:53:34,302 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:53:34,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1373669585] [2022-04-08 03:53:34,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1373669585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:34,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:34,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:53:34,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566539400] [2022-04-08 03:53:34,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:53:34,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 03:53:34,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:53:34,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:34,311 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-08 03:53:34,311 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 03:53:34,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:34,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 03:53:34,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:53:34,312 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:34,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:34,393 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-08 03:53:34,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 03:53:34,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 03:53:34,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:53:34,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:34,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-04-08 03:53:34,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:34,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-04-08 03:53:34,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 21 transitions. [2022-04-08 03:53:34,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:34,416 INFO L225 Difference]: With dead ends: 19 [2022-04-08 03:53:34,416 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 03:53:34,416 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:53:34,417 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:53:34,418 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 22 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:53:34,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 03:53:34,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-08 03:53:34,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:53:34,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:34,431 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:34,431 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:34,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:34,432 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-08 03:53:34,432 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 03:53:34,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:34,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:34,432 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 03:53:34,433 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 03:53:34,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:34,433 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-08 03:53:34,434 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 03:53:34,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:34,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:34,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:53:34,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:53:34,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:34,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-08 03:53:34,435 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2022-04-08 03:53:34,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:53:34,435 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-08 03:53:34,435 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:34,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-08 03:53:34,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:34,452 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-08 03:53:34,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 03:53:34,453 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:34,453 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:53:34,453 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 03:53:34,453 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:34,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:34,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1033184217, now seen corresponding path program 1 times [2022-04-08 03:53:34,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:34,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [469769302] [2022-04-08 03:53:34,457 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:53:34,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1033184217, now seen corresponding path program 2 times [2022-04-08 03:53:34,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:53:34,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561417854] [2022-04-08 03:53:34,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:53:34,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:53:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:34,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:53:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:34,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {301#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_100~0)| ~__return_100~0) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_100~0 := 0; {293#true} is VALID [2022-04-08 03:53:34,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {293#true} assume true; {293#true} is VALID [2022-04-08 03:53:34,548 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {293#true} {293#true} #59#return; {293#true} is VALID [2022-04-08 03:53:34,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {293#true} call ULTIMATE.init(); {301#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_100~0)| ~__return_100~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:53:34,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_100~0)| ~__return_100~0) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_100~0 := 0; {293#true} is VALID [2022-04-08 03:53:34,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {293#true} assume true; {293#true} is VALID [2022-04-08 03:53:34,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {293#true} {293#true} #59#return; {293#true} is VALID [2022-04-08 03:53:34,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {293#true} call #t~ret5 := main(); {293#true} is VALID [2022-04-08 03:53:34,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {293#true} havoc ~main__offset~0;havoc ~main__length~0;havoc ~main__nlen~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__nlen~0 := #t~nondet4;havoc #t~nondet4;havoc ~main__i~0;havoc ~main__j~0;~main__i~0 := 0; {293#true} is VALID [2022-04-08 03:53:34,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {293#true} assume ~main__i~0 < ~main__nlen~0;~main__j~0 := 0; {293#true} is VALID [2022-04-08 03:53:34,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {293#true} assume ~main__j~0 < 8;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__nlen~0 - 1 - ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {298#(or (and (= main_~__VERIFIER_assert__cond~0 0) (not (<= (+ main_~main__i~0 1) main_~main__nlen~0))) (and (<= (+ main_~main__i~0 1) main_~main__nlen~0) (= main_~__VERIFIER_assert__cond~0 1)))} is VALID [2022-04-08 03:53:34,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {298#(or (and (= main_~__VERIFIER_assert__cond~0 0) (not (<= (+ main_~main__i~0 1) main_~main__nlen~0))) (and (<= (+ main_~main__i~0 1) main_~main__nlen~0) (= main_~__VERIFIER_assert__cond~0 1)))} assume !(0 == ~__VERIFIER_assert__cond~0); {299#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} is VALID [2022-04-08 03:53:34,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {299#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__nlen~0 - 1 - ~main__i~0 < ~main__nlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {299#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} is VALID [2022-04-08 03:53:34,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {299#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);~main__j~0 := 1 + ~main__j~0; {299#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} is VALID [2022-04-08 03:53:34,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {299#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} assume ~main__j~0 < 8;havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__nlen~0 - 1 - ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {300#(not (= main_~__VERIFIER_assert__cond~2 0))} is VALID [2022-04-08 03:53:34,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {300#(not (= main_~__VERIFIER_assert__cond~2 0))} assume 0 == ~__VERIFIER_assert__cond~2; {294#false} is VALID [2022-04-08 03:53:34,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#false} assume !false; {294#false} is VALID [2022-04-08 03:53:34,553 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-08 03:53:34,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:53:34,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561417854] [2022-04-08 03:53:34,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561417854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:34,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:34,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:53:34,553 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:53:34,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [469769302] [2022-04-08 03:53:34,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [469769302] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:34,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:34,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:53:34,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44469595] [2022-04-08 03:53:34,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:53:34,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 03:53:34,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:53:34,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:34,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:34,563 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:53:34,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:34,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:53:34,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 03:53:34,564 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:34,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:34,770 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-08 03:53:34,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 03:53:34,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 03:53:34,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:53:34,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:34,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-08 03:53:34,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:34,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-08 03:53:34,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2022-04-08 03:53:34,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:34,806 INFO L225 Difference]: With dead ends: 25 [2022-04-08 03:53:34,806 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 03:53:34,807 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-08 03:53:34,809 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:53:34,813 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 28 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:53:34,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 03:53:34,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 03:53:34,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:53:34,815 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-08 03:53:34,815 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-08 03:53:34,815 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-08 03:53:34,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:34,815 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 03:53:34,815 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:53:34,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:34,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:34,815 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-08 03:53:34,816 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-08 03:53:34,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:34,816 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 03:53:34,816 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:53:34,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:34,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:34,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:53:34,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:53:34,816 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-08 03:53:34,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 03:53:34,816 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-08 03:53:34,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:53:34,819 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 03:53:34,819 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:53:34,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 03:53:34,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:53:34,819 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:53:34,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:34,821 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-04-08 03:53:34,822 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-04-08 03:53:34,822 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-04-08 03:53:34,822 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 03:53:34,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 03:53:35,092 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-08 03:53:35,093 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-08 03:53:35,093 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-08 03:53:35,093 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-08 03:53:35,093 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-08 03:53:35,093 INFO L882 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-08 03:53:35,093 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-08 03:53:35,093 INFO L878 garLoopResultBuilder]: At program point L33(lines 33 89) the Hoare annotation is: (let ((.cse0 (+ main_~main__i~0 1))) (and (<= .cse0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (< 0 .cse0) (= main_~__VERIFIER_assert__cond~0 1))) [2022-04-08 03:53:35,093 INFO L878 garLoopResultBuilder]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 48) the Hoare annotation is: false [2022-04-08 03:53:35,093 INFO L878 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: false [2022-04-08 03:53:35,093 INFO L878 garLoopResultBuilder]: At program point L95(lines 14 102) the Hoare annotation is: (and (= |old(~__return_100~0)| ~__return_100~0) (< 0 (+ main_~main__i~0 1))) [2022-04-08 03:53:35,094 INFO L878 garLoopResultBuilder]: At program point L62(lines 62 70) the Hoare annotation is: (let ((.cse0 (+ main_~main__i~0 1))) (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= .cse0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (< 0 .cse0) (not (= main_~__VERIFIER_assert__cond~2 0)))) [2022-04-08 03:53:35,094 INFO L878 garLoopResultBuilder]: At program point mainEXIT(lines 13 102) the Hoare annotation is: (or (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_100~0)| ~__return_100~0)) [2022-04-08 03:53:35,094 INFO L878 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: false [2022-04-08 03:53:35,094 INFO L878 garLoopResultBuilder]: At program point L79(lines 52 87) the Hoare annotation is: (let ((.cse0 (+ main_~main__i~0 1))) (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= .cse0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (< 0 .cse0))) [2022-04-08 03:53:35,094 INFO L878 garLoopResultBuilder]: At program point L46(lines 46 87) the Hoare annotation is: (let ((.cse4 (+ main_~main__i~0 1))) (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse1 (<= .cse4 main_~main__nlen~0)) (.cse2 (= |old(~__return_100~0)| ~__return_100~0)) (.cse3 (< 0 .cse4))) (or (and .cse0 (not (= main_~__VERIFIER_assert__cond~0 0)) .cse1 .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~2 0))) (and .cse0 .cse1 .cse2 .cse3 (= main_~__VERIFIER_assert__cond~0 1))))) [2022-04-08 03:53:35,094 INFO L878 garLoopResultBuilder]: At program point mainFINAL(lines 13 102) the Hoare annotation is: (or (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_100~0)| ~__return_100~0)) [2022-04-08 03:53:35,094 INFO L878 garLoopResultBuilder]: At program point L69(lines 39 89) the Hoare annotation is: (let ((.cse4 (+ main_~main__i~0 1))) (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse1 (<= .cse4 main_~main__nlen~0)) (.cse2 (= |old(~__return_100~0)| ~__return_100~0)) (.cse3 (< 0 .cse4))) (or (and .cse0 .cse1 .cse2 .cse3 (= main_~__VERIFIER_assert__cond~0 1)) (and .cse0 .cse1 .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~2 0)))))) [2022-04-08 03:53:35,094 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 35) the Hoare annotation is: false [2022-04-08 03:53:35,094 INFO L878 garLoopResultBuilder]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 64) the Hoare annotation is: false [2022-04-08 03:53:35,094 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 13 102) the Hoare annotation is: (= |old(~__return_100~0)| ~__return_100~0) [2022-04-08 03:53:35,094 INFO L878 garLoopResultBuilder]: At program point L26(lines 26 96) the Hoare annotation is: (let ((.cse0 (+ main_~main__i~0 1))) (and (<= .cse0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (< 0 .cse0))) [2022-04-08 03:53:35,095 INFO L878 garLoopResultBuilder]: At program point L76(lines 76 85) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_100~0)| ~__return_100~0) (< 0 (+ main_~main__i~0 1))) [2022-04-08 03:53:35,095 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: false [2022-04-08 03:53:35,095 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 03:53:35,095 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_100~0)| ~__return_100~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 03:53:35,095 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 03:53:35,095 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 03:53:35,095 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 03:53:35,095 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 03:53:35,095 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 03:53:35,097 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-08 03:53:35,098 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 03:53:35,100 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 03:53:35,101 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 03:53:35,101 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 03:53:35,102 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-08 03:53:35,102 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-08 03:53:35,103 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-08 03:53:35,118 INFO L163 areAnnotationChecker]: CFG has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 03:53:35,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 03:53:35 BoogieIcfgContainer [2022-04-08 03:53:35,132 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 03:53:35,133 INFO L158 Benchmark]: Toolchain (without parser) took 2156.03ms. Allocated memory is still 178.3MB. Free memory was 130.0MB in the beginning and 64.8MB in the end (delta: 65.2MB). Peak memory consumption was 65.8MB. Max. memory is 8.0GB. [2022-04-08 03:53:35,133 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 178.3MB. Free memory is still 145.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 03:53:35,134 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.73ms. Allocated memory is still 178.3MB. Free memory was 129.8MB in the beginning and 155.7MB in the end (delta: -25.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 03:53:35,135 INFO L158 Benchmark]: Boogie Preprocessor took 24.20ms. Allocated memory is still 178.3MB. Free memory was 155.7MB in the beginning and 154.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 03:53:35,137 INFO L158 Benchmark]: RCFGBuilder took 268.89ms. Allocated memory is still 178.3MB. Free memory was 154.1MB in the beginning and 142.9MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 03:53:35,138 INFO L158 Benchmark]: TraceAbstraction took 1657.40ms. Allocated memory is still 178.3MB. Free memory was 142.4MB in the beginning and 64.8MB in the end (delta: 77.6MB). Peak memory consumption was 78.7MB. Max. memory is 8.0GB. [2022-04-08 03:53:35,139 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.11ms. Allocated memory is still 178.3MB. Free memory is still 145.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 198.73ms. Allocated memory is still 178.3MB. Free memory was 129.8MB in the beginning and 155.7MB in the end (delta: -25.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.20ms. Allocated memory is still 178.3MB. Free memory was 155.7MB in the beginning and 154.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 268.89ms. Allocated memory is still 178.3MB. Free memory was 154.1MB in the beginning and 142.9MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1657.40ms. Allocated memory is still 178.3MB. Free memory was 142.4MB in the beginning and 64.8MB in the end (delta: 77.6MB). Peak memory consumption was 78.7MB. 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: 35]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 48]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 64]: 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, 31 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 91 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 91 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 75 IncrementalHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 41 mSDtfsCounter, 75 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 24 PreInvPairs, 39 NumberOfFragments, 241 HoareAnnotationTreeSize, 24 FomulaSimplifications, 57 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 24 FomulaSimplificationsInter, 255 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 3 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: \old(__return_100) == __return_100 && 0 < main__i + 1 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: (((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && main__i + 1 <= main__nlen) && \old(__return_100) == __return_100) && 0 < main__i + 1 - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((((!(__VERIFIER_assert__cond == 0) && main__i + 1 <= main__nlen) && \old(__return_100) == __return_100) && 0 < main__i + 1) && __VERIFIER_assert__cond == 1) || ((((!(__VERIFIER_assert__cond == 0) && main__i + 1 <= main__nlen) && \old(__return_100) == __return_100) && 0 < main__i + 1) && !(__VERIFIER_assert__cond == 0)) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: !(__VERIFIER_assert__cond == 0) || \old(__return_100) == __return_100 RESULT: Ultimate proved your program to be correct! [2022-04-08 03:53:35,181 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...