/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/loops/string-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:42:29,163 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:42:29,165 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:42:29,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:42:29,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:42:29,204 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:42:29,209 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:42:29,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:42:29,217 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:42:29,222 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:42:29,223 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:42:29,224 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:42:29,224 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:42:29,226 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:42:29,228 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:42:29,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:42:29,229 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:42:29,230 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:42:29,234 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:42:29,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:42:29,242 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:42:29,243 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:42:29,244 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:42:29,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:42:29,246 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:42:29,252 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:42:29,252 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:42:29,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:42:29,254 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:42:29,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:42:29,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:42:29,256 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:42:29,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:42:29,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:42:29,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:42:29,259 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:42:29,260 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:42:29,260 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:42:29,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:42:29,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:42:29,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:42:29,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:42:29,264 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 05:42:29,277 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:42:29,278 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:42:29,279 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:42:29,279 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 05:42:29,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:42:29,279 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 05:42:29,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:42:29,280 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:42:29,280 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:42:29,280 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:42:29,281 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 05:42:29,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:42:29,281 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:42:29,281 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:42:29,281 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:42:29,281 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:42:29,281 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 05:42:29,281 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:42:29,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:42:29,282 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:42:29,282 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 05:42:29,282 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 05:42:29,282 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 05:42:29,282 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:42:29,282 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 05:42:29,282 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-15 05:42:29,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:42:29,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:42:29,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:42:29,525 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:42:29,528 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:42:29,530 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/string-1.i [2022-04-15 05:42:29,587 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e2f4dc18/61cffce67ffc4196a9790531f6c2bd51/FLAGc2dfe7a70 [2022-04-15 05:42:29,983 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:42:29,984 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/string-1.i [2022-04-15 05:42:29,991 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e2f4dc18/61cffce67ffc4196a9790531f6c2bd51/FLAGc2dfe7a70 [2022-04-15 05:42:30,009 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e2f4dc18/61cffce67ffc4196a9790531f6c2bd51 [2022-04-15 05:42:30,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:42:30,012 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 05:42:30,013 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:42:30,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:42:30,020 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:42:30,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:42:30" (1/1) ... [2022-04-15 05:42:30,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@222f260f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:30, skipping insertion in model container [2022-04-15 05:42:30,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:42:30" (1/1) ... [2022-04-15 05:42:30,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:42:30,048 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:42:30,255 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/string-1.i[896,909] [2022-04-15 05:42:30,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:42:30,302 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:42:30,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/string-1.i[896,909] [2022-04-15 05:42:30,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:42:30,356 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:42:30,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:30 WrapperNode [2022-04-15 05:42:30,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:42:30,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:42:30,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:42:30,358 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:42:30,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:30" (1/1) ... [2022-04-15 05:42:30,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:30" (1/1) ... [2022-04-15 05:42:30,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:30" (1/1) ... [2022-04-15 05:42:30,385 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:30" (1/1) ... [2022-04-15 05:42:30,402 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:30" (1/1) ... [2022-04-15 05:42:30,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:30" (1/1) ... [2022-04-15 05:42:30,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:30" (1/1) ... [2022-04-15 05:42:30,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:42:30,424 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:42:30,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:42:30,424 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:42:30,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:30" (1/1) ... [2022-04-15 05:42:30,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:42:30,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:30,465 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-15 05:42:30,486 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-15 05:42:30,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:42:30,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:42:30,511 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:42:30,511 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 05:42:30,511 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 05:42:30,511 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:42:30,512 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:42:30,512 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:42:30,512 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 05:42:30,513 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 05:42:30,513 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:42:30,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:42:30,514 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 05:42:30,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 05:42:30,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 05:42:30,514 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:42:30,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 05:42:30,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:42:30,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:42:30,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:42:30,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:42:30,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:42:30,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:42:30,604 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:42:30,606 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:42:30,878 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:42:30,884 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:42:30,885 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-15 05:42:30,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:42:30 BoogieIcfgContainer [2022-04-15 05:42:30,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:42:30,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:42:30,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:42:30,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:42:30,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:42:30" (1/3) ... [2022-04-15 05:42:30,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd6b1e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:42:30, skipping insertion in model container [2022-04-15 05:42:30,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:30" (2/3) ... [2022-04-15 05:42:30,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd6b1e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:42:30, skipping insertion in model container [2022-04-15 05:42:30,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:42:30" (3/3) ... [2022-04-15 05:42:30,904 INFO L111 eAbstractionObserver]: Analyzing ICFG string-1.i [2022-04-15 05:42:30,909 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:42:30,909 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:42:30,957 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:42:30,966 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-15 05:42:30,967 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:42:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:42:30,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 05:42:30,995 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:30,996 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:30,996 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:31,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:31,002 INFO L85 PathProgramCache]: Analyzing trace with hash 739829093, now seen corresponding path program 1 times [2022-04-15 05:42:31,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:31,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1504055179] [2022-04-15 05:42:31,022 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:42:31,023 INFO L85 PathProgramCache]: Analyzing trace with hash 739829093, now seen corresponding path program 2 times [2022-04-15 05:42:31,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:31,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935027102] [2022-04-15 05:42:31,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:31,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:31,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:31,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {44#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {38#true} is VALID [2022-04-15 05:42:31,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-15 05:42:31,301 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #124#return; {38#true} is VALID [2022-04-15 05:42:31,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {44#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:31,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {44#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {38#true} is VALID [2022-04-15 05:42:31,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-15 05:42:31,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #124#return; {38#true} is VALID [2022-04-15 05:42:31,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret15 := main(); {38#true} is VALID [2022-04-15 05:42:31,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {38#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {43#(= main_~i~0 0)} is VALID [2022-04-15 05:42:31,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {43#(= main_~i~0 0)} assume !(~i~0 < 5); {39#false} is VALID [2022-04-15 05:42:31,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {39#false} is VALID [2022-04-15 05:42:31,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {39#false} is VALID [2022-04-15 05:42:31,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#false} assume !(~i~0 < 5); {39#false} is VALID [2022-04-15 05:42:31,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {39#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {39#false} is VALID [2022-04-15 05:42:31,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {39#false} is VALID [2022-04-15 05:42:31,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-04-15 05:42:31,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {39#false} ~nc_B~0 := 0; {39#false} is VALID [2022-04-15 05:42:31,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-04-15 05:42:31,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {39#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {39#false} is VALID [2022-04-15 05:42:31,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-04-15 05:42:31,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {39#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {39#false} is VALID [2022-04-15 05:42:31,313 INFO L272 TraceCheckUtils]: 18: Hoare triple {39#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {39#false} is VALID [2022-04-15 05:42:31,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2022-04-15 05:42:31,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2022-04-15 05:42:31,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-04-15 05:42:31,314 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-15 05:42:31,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:31,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935027102] [2022-04-15 05:42:31,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935027102] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:31,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:31,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:42:31,323 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:31,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1504055179] [2022-04-15 05:42:31,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1504055179] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:31,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:31,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:42:31,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71377383] [2022-04-15 05:42:31,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:31,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 05:42:31,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:31,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:31,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:31,381 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:42:31,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:31,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:42:31,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:42:31,409 INFO L87 Difference]: Start difference. First operand has 35 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:31,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:31,714 INFO L93 Difference]: Finished difference Result 73 states and 109 transitions. [2022-04-15 05:42:31,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:42:31,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 05:42:31,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:31,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:31,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-04-15 05:42:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-04-15 05:42:31,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 109 transitions. [2022-04-15 05:42:31,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:31,840 INFO L225 Difference]: With dead ends: 73 [2022-04-15 05:42:31,840 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 05:42:31,843 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:42:31,846 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 47 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:31,847 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 45 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:42:31,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 05:42:31,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2022-04-15 05:42:31,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:31,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:31,877 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:31,878 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:31,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:31,881 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-15 05:42:31,882 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-15 05:42:31,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:31,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:31,883 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-15 05:42:31,883 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-15 05:42:31,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:31,886 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-15 05:42:31,887 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-15 05:42:31,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:31,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:31,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:31,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:31,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:31,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-04-15 05:42:31,891 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 22 [2022-04-15 05:42:31,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:31,891 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-04-15 05:42:31,892 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:31,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 35 transitions. [2022-04-15 05:42:31,949 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-15 05:42:31,949 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-15 05:42:31,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 05:42:31,950 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:31,951 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:31,951 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 05:42:31,951 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:31,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:31,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1075962823, now seen corresponding path program 1 times [2022-04-15 05:42:31,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:31,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2102196889] [2022-04-15 05:42:32,022 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:32,022 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:32,022 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:32,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1075962823, now seen corresponding path program 2 times [2022-04-15 05:42:32,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:32,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463739381] [2022-04-15 05:42:32,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:32,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:32,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:32,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {334#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {327#true} is VALID [2022-04-15 05:42:32,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 05:42:32,098 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {327#true} {327#true} #124#return; {327#true} is VALID [2022-04-15 05:42:32,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {334#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:32,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {334#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {327#true} is VALID [2022-04-15 05:42:32,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 05:42:32,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #124#return; {327#true} is VALID [2022-04-15 05:42:32,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret15 := main(); {327#true} is VALID [2022-04-15 05:42:32,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {327#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {332#(= main_~i~0 0)} is VALID [2022-04-15 05:42:32,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {332#(= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {332#(= main_~i~0 0)} is VALID [2022-04-15 05:42:32,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {332#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {333#(<= main_~i~0 1)} is VALID [2022-04-15 05:42:32,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {333#(<= main_~i~0 1)} assume !(~i~0 < 5); {328#false} is VALID [2022-04-15 05:42:32,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {328#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {328#false} is VALID [2022-04-15 05:42:32,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {328#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {328#false} is VALID [2022-04-15 05:42:32,103 INFO L290 TraceCheckUtils]: 11: Hoare triple {328#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {328#false} is VALID [2022-04-15 05:42:32,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {328#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {328#false} is VALID [2022-04-15 05:42:32,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {328#false} assume !(~i~0 < 5); {328#false} is VALID [2022-04-15 05:42:32,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {328#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {328#false} is VALID [2022-04-15 05:42:32,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {328#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {328#false} is VALID [2022-04-15 05:42:32,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {328#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {328#false} is VALID [2022-04-15 05:42:32,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {328#false} assume !(0 != #t~mem7);havoc #t~mem7; {328#false} is VALID [2022-04-15 05:42:32,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {328#false} ~nc_B~0 := 0; {328#false} is VALID [2022-04-15 05:42:32,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {328#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {328#false} is VALID [2022-04-15 05:42:32,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {328#false} assume !(0 != #t~mem9);havoc #t~mem9; {328#false} is VALID [2022-04-15 05:42:32,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {328#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {328#false} is VALID [2022-04-15 05:42:32,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {328#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {328#false} is VALID [2022-04-15 05:42:32,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {328#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {328#false} is VALID [2022-04-15 05:42:32,107 INFO L272 TraceCheckUtils]: 24: Hoare triple {328#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {328#false} is VALID [2022-04-15 05:42:32,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {328#false} ~cond := #in~cond; {328#false} is VALID [2022-04-15 05:42:32,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {328#false} assume 0 == ~cond; {328#false} is VALID [2022-04-15 05:42:32,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-04-15 05:42:32,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 05:42:32,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:32,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463739381] [2022-04-15 05:42:32,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463739381] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:32,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336829446] [2022-04-15 05:42:32,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:42:32,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:32,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:32,111 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:42:32,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 05:42:32,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 05:42:32,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:32,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 05:42:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:32,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:32,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {327#true} is VALID [2022-04-15 05:42:32,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {327#true} is VALID [2022-04-15 05:42:32,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 05:42:32,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #124#return; {327#true} is VALID [2022-04-15 05:42:32,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret15 := main(); {327#true} is VALID [2022-04-15 05:42:32,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {327#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {327#true} is VALID [2022-04-15 05:42:32,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {327#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {327#true} is VALID [2022-04-15 05:42:32,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {327#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {327#true} is VALID [2022-04-15 05:42:32,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {327#true} assume !(~i~0 < 5); {327#true} is VALID [2022-04-15 05:42:32,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {327#true} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {327#true} is VALID [2022-04-15 05:42:32,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {327#true} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {327#true} is VALID [2022-04-15 05:42:32,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {327#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {327#true} is VALID [2022-04-15 05:42:32,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {327#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {327#true} is VALID [2022-04-15 05:42:32,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#true} assume !(~i~0 < 5); {327#true} is VALID [2022-04-15 05:42:32,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {327#true} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {327#true} is VALID [2022-04-15 05:42:32,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {327#true} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {327#true} is VALID [2022-04-15 05:42:32,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {327#true} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {327#true} is VALID [2022-04-15 05:42:32,541 INFO L290 TraceCheckUtils]: 17: Hoare triple {327#true} assume !(0 != #t~mem7);havoc #t~mem7; {327#true} is VALID [2022-04-15 05:42:32,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {327#true} ~nc_B~0 := 0; {392#(<= main_~nc_B~0 0)} is VALID [2022-04-15 05:42:32,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {392#(<= main_~nc_B~0 0)} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {392#(<= main_~nc_B~0 0)} is VALID [2022-04-15 05:42:32,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {392#(<= main_~nc_B~0 0)} assume !(0 != #t~mem9);havoc #t~mem9; {392#(<= main_~nc_B~0 0)} is VALID [2022-04-15 05:42:32,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {392#(<= main_~nc_B~0 0)} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {402#(and (<= main_~nc_B~0 0) (<= 0 main_~j~0))} is VALID [2022-04-15 05:42:32,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {402#(and (<= main_~nc_B~0 0) (<= 0 main_~j~0))} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {402#(and (<= main_~nc_B~0 0) (<= 0 main_~j~0))} is VALID [2022-04-15 05:42:32,545 INFO L290 TraceCheckUtils]: 23: Hoare triple {402#(and (<= main_~nc_B~0 0) (<= 0 main_~j~0))} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {409#(= 1 main_~found~0)} is VALID [2022-04-15 05:42:32,546 INFO L272 TraceCheckUtils]: 24: Hoare triple {409#(= 1 main_~found~0)} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {413#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:42:32,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {413#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {417#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:42:32,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {417#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {328#false} is VALID [2022-04-15 05:42:32,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-04-15 05:42:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 05:42:32,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 05:42:32,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336829446] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:32,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 05:42:32,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2022-04-15 05:42:32,550 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:32,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2102196889] [2022-04-15 05:42:32,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2102196889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:32,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:32,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 05:42:32,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191489661] [2022-04-15 05:42:32,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:32,552 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 05:42:32,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:32,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:32,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:32,579 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 05:42:32,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:32,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 05:42:32,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-15 05:42:32,580 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:32,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:32,739 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-04-15 05:42:32,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 05:42:32,740 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 05:42:32,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:32,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:32,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-04-15 05:42:32,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:32,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-04-15 05:42:32,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 52 transitions. [2022-04-15 05:42:32,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:32,801 INFO L225 Difference]: With dead ends: 46 [2022-04-15 05:42:32,802 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 05:42:32,803 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-15 05:42:32,805 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:32,808 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 127 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:42:32,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 05:42:32,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 05:42:32,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:32,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:32,819 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:32,820 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:32,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:32,827 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-15 05:42:32,827 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-15 05:42:32,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:32,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:32,828 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-15 05:42:32,829 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-15 05:42:32,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:32,832 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-15 05:42:32,832 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-15 05:42:32,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:32,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:32,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:32,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:32,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-15 05:42:32,841 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 28 [2022-04-15 05:42:32,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:32,842 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-15 05:42:32,842 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:32,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 37 transitions. [2022-04-15 05:42:32,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:32,902 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-15 05:42:32,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 05:42:32,903 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:32,903 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:32,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 05:42:33,104 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:33,105 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:33,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:33,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1813634220, now seen corresponding path program 1 times [2022-04-15 05:42:33,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:33,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [67505332] [2022-04-15 05:42:33,112 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:33,113 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:33,113 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:33,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1813634220, now seen corresponding path program 2 times [2022-04-15 05:42:33,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:33,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755336778] [2022-04-15 05:42:33,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:33,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:33,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:33,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {647#true} is VALID [2022-04-15 05:42:33,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {647#true} assume true; {647#true} is VALID [2022-04-15 05:42:33,191 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {647#true} {647#true} #124#return; {647#true} is VALID [2022-04-15 05:42:33,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {647#true} call ULTIMATE.init(); {654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:33,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {647#true} is VALID [2022-04-15 05:42:33,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {647#true} assume true; {647#true} is VALID [2022-04-15 05:42:33,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {647#true} {647#true} #124#return; {647#true} is VALID [2022-04-15 05:42:33,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {647#true} call #t~ret15 := main(); {647#true} is VALID [2022-04-15 05:42:33,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {647#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {652#(= main_~i~0 0)} is VALID [2022-04-15 05:42:33,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {652#(= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {652#(= main_~i~0 0)} is VALID [2022-04-15 05:42:33,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {652#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {653#(<= main_~i~0 1)} is VALID [2022-04-15 05:42:33,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {653#(<= main_~i~0 1)} assume !(~i~0 < 5); {648#false} is VALID [2022-04-15 05:42:33,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {648#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {648#false} is VALID [2022-04-15 05:42:33,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {648#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {648#false} is VALID [2022-04-15 05:42:33,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {648#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {648#false} is VALID [2022-04-15 05:42:33,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {648#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {648#false} is VALID [2022-04-15 05:42:33,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {648#false} assume !(~i~0 < 5); {648#false} is VALID [2022-04-15 05:42:33,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {648#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {648#false} is VALID [2022-04-15 05:42:33,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {648#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {648#false} is VALID [2022-04-15 05:42:33,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {648#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {648#false} is VALID [2022-04-15 05:42:33,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {648#false} assume !(0 != #t~mem7);havoc #t~mem7; {648#false} is VALID [2022-04-15 05:42:33,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {648#false} ~nc_B~0 := 0; {648#false} is VALID [2022-04-15 05:42:33,199 INFO L290 TraceCheckUtils]: 19: Hoare triple {648#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {648#false} is VALID [2022-04-15 05:42:33,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {648#false} assume !!(0 != #t~mem9);havoc #t~mem9;#t~post10 := ~nc_B~0;~nc_B~0 := 1 + #t~post10;havoc #t~post10; {648#false} is VALID [2022-04-15 05:42:33,199 INFO L290 TraceCheckUtils]: 21: Hoare triple {648#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {648#false} is VALID [2022-04-15 05:42:33,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {648#false} assume !(0 != #t~mem9);havoc #t~mem9; {648#false} is VALID [2022-04-15 05:42:33,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {648#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {648#false} is VALID [2022-04-15 05:42:33,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {648#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {648#false} is VALID [2022-04-15 05:42:33,200 INFO L290 TraceCheckUtils]: 25: Hoare triple {648#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {648#false} is VALID [2022-04-15 05:42:33,200 INFO L272 TraceCheckUtils]: 26: Hoare triple {648#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {648#false} is VALID [2022-04-15 05:42:33,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {648#false} ~cond := #in~cond; {648#false} is VALID [2022-04-15 05:42:33,200 INFO L290 TraceCheckUtils]: 28: Hoare triple {648#false} assume 0 == ~cond; {648#false} is VALID [2022-04-15 05:42:33,201 INFO L290 TraceCheckUtils]: 29: Hoare triple {648#false} assume !false; {648#false} is VALID [2022-04-15 05:42:33,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 05:42:33,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:33,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755336778] [2022-04-15 05:42:33,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755336778] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:33,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240216063] [2022-04-15 05:42:33,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:42:33,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:33,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:33,212 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:42:33,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 05:42:33,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 05:42:33,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:33,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 05:42:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:33,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:33,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {647#true} call ULTIMATE.init(); {647#true} is VALID [2022-04-15 05:42:33,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {647#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {647#true} is VALID [2022-04-15 05:42:33,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {647#true} assume true; {647#true} is VALID [2022-04-15 05:42:33,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {647#true} {647#true} #124#return; {647#true} is VALID [2022-04-15 05:42:33,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {647#true} call #t~ret15 := main(); {647#true} is VALID [2022-04-15 05:42:33,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {647#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {647#true} is VALID [2022-04-15 05:42:33,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {647#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {647#true} is VALID [2022-04-15 05:42:33,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {647#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {647#true} is VALID [2022-04-15 05:42:33,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {647#true} assume !(~i~0 < 5); {647#true} is VALID [2022-04-15 05:42:33,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {647#true} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {647#true} is VALID [2022-04-15 05:42:33,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {647#true} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {647#true} is VALID [2022-04-15 05:42:33,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {647#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {647#true} is VALID [2022-04-15 05:42:33,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {647#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {647#true} is VALID [2022-04-15 05:42:33,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {647#true} assume !(~i~0 < 5); {647#true} is VALID [2022-04-15 05:42:33,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {647#true} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {647#true} is VALID [2022-04-15 05:42:33,466 INFO L290 TraceCheckUtils]: 15: Hoare triple {647#true} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {647#true} is VALID [2022-04-15 05:42:33,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {647#true} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {647#true} is VALID [2022-04-15 05:42:33,467 INFO L290 TraceCheckUtils]: 17: Hoare triple {647#true} assume !(0 != #t~mem7);havoc #t~mem7; {647#true} is VALID [2022-04-15 05:42:33,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {647#true} ~nc_B~0 := 0; {647#true} is VALID [2022-04-15 05:42:33,467 INFO L290 TraceCheckUtils]: 19: Hoare triple {647#true} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {647#true} is VALID [2022-04-15 05:42:33,467 INFO L290 TraceCheckUtils]: 20: Hoare triple {647#true} assume !!(0 != #t~mem9);havoc #t~mem9;#t~post10 := ~nc_B~0;~nc_B~0 := 1 + #t~post10;havoc #t~post10; {647#true} is VALID [2022-04-15 05:42:33,467 INFO L290 TraceCheckUtils]: 21: Hoare triple {647#true} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {647#true} is VALID [2022-04-15 05:42:33,467 INFO L290 TraceCheckUtils]: 22: Hoare triple {647#true} assume !(0 != #t~mem9);havoc #t~mem9; {647#true} is VALID [2022-04-15 05:42:33,468 INFO L290 TraceCheckUtils]: 23: Hoare triple {647#true} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {647#true} is VALID [2022-04-15 05:42:33,468 INFO L290 TraceCheckUtils]: 24: Hoare triple {647#true} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {647#true} is VALID [2022-04-15 05:42:33,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {647#true} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {733#(or (= 1 main_~found~0) (= 0 main_~found~0))} is VALID [2022-04-15 05:42:33,469 INFO L272 TraceCheckUtils]: 26: Hoare triple {733#(or (= 1 main_~found~0) (= 0 main_~found~0))} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {737#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:42:33,470 INFO L290 TraceCheckUtils]: 27: Hoare triple {737#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {741#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:42:33,470 INFO L290 TraceCheckUtils]: 28: Hoare triple {741#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {648#false} is VALID [2022-04-15 05:42:33,471 INFO L290 TraceCheckUtils]: 29: Hoare triple {648#false} assume !false; {648#false} is VALID [2022-04-15 05:42:33,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 05:42:33,471 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 05:42:33,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240216063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:33,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 05:42:33,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-04-15 05:42:33,472 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:33,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [67505332] [2022-04-15 05:42:33,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [67505332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:33,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:33,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:42:33,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256659971] [2022-04-15 05:42:33,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:33,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 05:42:33,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:33,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:33,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:33,496 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 05:42:33,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:33,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 05:42:33,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 05:42:33,497 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:33,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:33,570 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-15 05:42:33,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:42:33,570 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 05:42:33,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:33,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:33,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-04-15 05:42:33,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:33,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-04-15 05:42:33,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2022-04-15 05:42:33,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:33,600 INFO L225 Difference]: With dead ends: 32 [2022-04-15 05:42:33,600 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 05:42:33,600 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-15 05:42:33,601 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 23 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:33,602 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 93 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:42:33,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 05:42:33,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 05:42:33,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:33,603 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-15 05:42:33,603 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-15 05:42:33,603 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-15 05:42:33,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:33,603 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 05:42:33,603 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 05:42:33,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:33,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:33,604 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-15 05:42:33,604 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-15 05:42:33,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:33,604 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 05:42:33,604 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 05:42:33,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:33,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:33,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:33,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:33,605 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-15 05:42:33,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 05:42:33,605 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-04-15 05:42:33,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:33,605 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 05:42:33,606 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:42:33,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 05:42:33,606 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-15 05:42:33,606 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 05:42:33,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:33,608 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 05:42:33,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 05:42:33,823 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 05:42:33,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 05:42:33,993 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-15 05:42:33,994 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-15 05:42:33,994 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-15 05:42:33,994 INFO L882 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-15 05:42:33,994 INFO L882 garLoopResultBuilder]: For program point L16-2(lines 15 17) no Hoare annotation was computed. [2022-04-15 05:42:33,994 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 15 17) no Hoare annotation was computed. [2022-04-15 05:42:33,994 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 15 17) no Hoare annotation was computed. [2022-04-15 05:42:33,994 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 28 72) the Hoare annotation is: true [2022-04-15 05:42:33,995 INFO L878 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (or (= 1 main_~found~0) (= 0 main_~found~0)) [2022-04-15 05:42:33,995 INFO L885 garLoopResultBuilder]: At program point L69-1(line 69) the Hoare annotation is: true [2022-04-15 05:42:33,995 INFO L878 garLoopResultBuilder]: At program point L53-2(lines 53 65) the Hoare annotation is: (or (and (<= main_~nc_B~0 0) (<= 0 main_~j~0)) (= 1 main_~found~0) (= 0 main_~found~0)) [2022-04-15 05:42:33,995 INFO L878 garLoopResultBuilder]: At program point L37-2(lines 37 38) the Hoare annotation is: (or (= 1 main_~found~0) (= 0 main_~found~0)) [2022-04-15 05:42:33,995 INFO L878 garLoopResultBuilder]: At program point L37-3(lines 37 38) the Hoare annotation is: (or (= 1 main_~found~0) (= 0 main_~found~0)) [2022-04-15 05:42:33,995 INFO L878 garLoopResultBuilder]: At program point L37-4(lines 37 38) the Hoare annotation is: (or (= 1 main_~found~0) (= 0 main_~found~0)) [2022-04-15 05:42:33,995 INFO L878 garLoopResultBuilder]: At program point L33-2(lines 33 34) the Hoare annotation is: (or (= 1 main_~found~0) (= 0 main_~found~0)) [2022-04-15 05:42:33,995 INFO L878 garLoopResultBuilder]: At program point L33-3(lines 33 34) the Hoare annotation is: (or (= 1 main_~found~0) (= 0 main_~found~0)) [2022-04-15 05:42:33,995 INFO L878 garLoopResultBuilder]: At program point L33-4(lines 33 34) the Hoare annotation is: (or (= 1 main_~found~0) (= 0 main_~found~0)) [2022-04-15 05:42:33,996 INFO L878 garLoopResultBuilder]: At program point L46-1(lines 46 47) the Hoare annotation is: (or (= 1 main_~found~0) (= 0 main_~found~0)) [2022-04-15 05:42:33,996 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 28 72) the Hoare annotation is: true [2022-04-15 05:42:33,996 INFO L878 garLoopResultBuilder]: At program point L46-3(lines 46 47) the Hoare annotation is: (or (= 1 main_~found~0) (= 0 main_~found~0)) [2022-04-15 05:42:33,996 INFO L878 garLoopResultBuilder]: At program point L46-4(lines 29 72) the Hoare annotation is: (or (<= main_~nc_B~0 0) (= 1 main_~found~0) (= 0 main_~found~0)) [2022-04-15 05:42:33,996 INFO L878 garLoopResultBuilder]: At program point L42-1(lines 42 43) the Hoare annotation is: (or (= 1 main_~found~0) (= 0 main_~found~0)) [2022-04-15 05:42:33,996 INFO L878 garLoopResultBuilder]: At program point L42-3(lines 42 43) the Hoare annotation is: (or (= 1 main_~found~0) (= 0 main_~found~0)) [2022-04-15 05:42:33,996 INFO L878 garLoopResultBuilder]: At program point L42-4(lines 42 43) the Hoare annotation is: (or (= 1 main_~found~0) (= 0 main_~found~0)) [2022-04-15 05:42:33,996 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 28 72) the Hoare annotation is: true [2022-04-15 05:42:33,996 INFO L878 garLoopResultBuilder]: At program point L55(lines 55 64) the Hoare annotation is: (or (= 1 main_~found~0) (= 0 main_~found~0)) [2022-04-15 05:42:33,997 INFO L878 garLoopResultBuilder]: At program point L55-2(lines 53 65) the Hoare annotation is: (or (and (<= main_~nc_B~0 0) (<= 0 main_~j~0)) (= 1 main_~found~0) (= 0 main_~found~0)) [2022-04-15 05:42:33,997 INFO L878 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (or (= 1 main_~found~0) (= 0 main_~found~0)) [2022-04-15 05:42:33,997 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (or (= 1 main_~found~0) (= 0 main_~found~0)) [2022-04-15 05:42:33,997 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 05:42:33,997 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 05:42:33,997 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 05:42:33,997 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 05:42:33,997 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 05:42:33,997 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 05:42:33,997 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 05:42:33,998 INFO L885 garLoopResultBuilder]: At program point L19-2(lines 18 23) the Hoare annotation is: true [2022-04-15 05:42:33,998 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 18 23) the Hoare annotation is: true [2022-04-15 05:42:33,998 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 18 23) the Hoare annotation is: true [2022-04-15 05:42:33,998 INFO L878 garLoopResultBuilder]: At program point L20(line 20) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 05:42:33,998 INFO L878 garLoopResultBuilder]: At program point L19(lines 19 21) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-15 05:42:33,998 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 05:42:34,001 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-15 05:42:34,003 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 05:42:34,006 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 05:42:34,006 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 05:42:34,007 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 05:42:34,008 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-15 05:42:34,008 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 05:42:34,008 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 05:42:34,010 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-15 05:42:34,022 INFO L163 areAnnotationChecker]: CFG has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 05:42:34,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 05:42:34 BoogieIcfgContainer [2022-04-15 05:42:34,030 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 05:42:34,032 INFO L158 Benchmark]: Toolchain (without parser) took 4019.68ms. Allocated memory was 180.4MB in the beginning and 227.5MB in the end (delta: 47.2MB). Free memory was 131.4MB in the beginning and 83.9MB in the end (delta: 47.6MB). Peak memory consumption was 95.2MB. Max. memory is 8.0GB. [2022-04-15 05:42:34,032 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 180.4MB. Free memory was 147.6MB in the beginning and 147.5MB in the end (delta: 148.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 05:42:34,032 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.91ms. Allocated memory is still 180.4MB. Free memory was 131.3MB in the beginning and 156.5MB in the end (delta: -25.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-15 05:42:34,033 INFO L158 Benchmark]: Boogie Preprocessor took 65.63ms. Allocated memory is still 180.4MB. Free memory was 156.5MB in the beginning and 154.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 05:42:34,033 INFO L158 Benchmark]: RCFGBuilder took 463.79ms. Allocated memory is still 180.4MB. Free memory was 154.4MB in the beginning and 139.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-15 05:42:34,033 INFO L158 Benchmark]: TraceAbstraction took 3141.37ms. Allocated memory was 180.4MB in the beginning and 227.5MB in the end (delta: 47.2MB). Free memory was 139.2MB in the beginning and 83.9MB in the end (delta: 55.3MB). Peak memory consumption was 102.5MB. Max. memory is 8.0GB. [2022-04-15 05:42:34,035 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.20ms. Allocated memory is still 180.4MB. Free memory was 147.6MB in the beginning and 147.5MB in the end (delta: 148.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 343.91ms. Allocated memory is still 180.4MB. Free memory was 131.3MB in the beginning and 156.5MB in the end (delta: -25.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 65.63ms. Allocated memory is still 180.4MB. Free memory was 156.5MB in the beginning and 154.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 463.79ms. Allocated memory is still 180.4MB. Free memory was 154.4MB in the beginning and 139.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 3141.37ms. Allocated memory was 180.4MB in the beginning and 227.5MB in the end (delta: 47.2MB). Free memory was 139.2MB in the beginning and 83.9MB in the end (delta: 55.3MB). Peak memory consumption was 102.5MB. 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: 20]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 265 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 172 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 92 IncrementalHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 93 mSDtfsCounter, 92 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, InterpolantAutomatonStates: 16, 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, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 35 LocationsWithAnnotation, 53 PreInvPairs, 91 NumberOfFragments, 179 HoareAnnotationTreeSize, 53 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 35 FomulaSimplificationsInter, 58 FormulaSimplificationTreeSizeReductionInter, 0.1s 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 1 specifications checked. All of them hold - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: ((nc_B <= 0 && 0 <= j) || 1 == found) || 0 == found - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: 1 == found || 0 == found - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: 1 == found || 0 == found - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: 1 == found || 0 == found - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 1 == found || 0 == found - ProcedureContractResult [Line: 28]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 18]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 05:42:34,071 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...