/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/MADWiFi-encode_ie_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-15 01:27:18,802 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 01:27:18,803 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 01:27:18,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 01:27:18,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 01:27:18,857 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 01:27:18,860 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 01:27:18,864 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 01:27:18,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 01:27:18,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 01:27:18,867 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 01:27:18,867 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 01:27:18,867 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 01:27:18,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 01:27:18,869 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 01:27:18,869 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 01:27:18,870 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 01:27:18,870 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 01:27:18,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 01:27:18,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 01:27:18,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 01:27:18,876 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 01:27:18,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 01:27:18,878 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 01:27:18,880 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 01:27:18,880 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 01:27:18,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 01:27:18,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 01:27:18,881 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 01:27:18,882 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 01:27:18,882 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 01:27:18,882 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 01:27:18,883 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 01:27:18,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 01:27:18,884 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 01:27:18,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 01:27:18,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 01:27:18,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 01:27:18,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 01:27:18,885 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 01:27:18,886 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 01:27:18,886 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-02-15 01:27:18,896 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 01:27:18,896 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 01:27:18,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 01:27:18,897 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-15 01:27:18,897 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 01:27:18,897 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-15 01:27:18,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 01:27:18,898 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 01:27:18,898 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 01:27:18,898 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 01:27:18,898 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-15 01:27:18,898 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 01:27:18,898 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 01:27:18,899 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 01:27:18,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 01:27:18,899 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 01:27:18,899 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 01:27:18,899 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 01:27:18,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 01:27:18,899 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 01:27:18,900 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-02-15 01:27:18,900 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-15 01:27:18,900 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-02-15 01:27:18,900 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-02-15 01:27:19,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 01:27:19,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 01:27:19,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 01:27:19,126 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 01:27:19,135 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 01:27:19,136 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/MADWiFi-encode_ie_ok.i [2022-02-15 01:27:19,201 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73f97fee0/3d55ea4bf5484eb88120cf3e8c9ca422/FLAG282619585 [2022-02-15 01:27:19,531 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 01:27:19,532 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/MADWiFi-encode_ie_ok.i [2022-02-15 01:27:19,538 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73f97fee0/3d55ea4bf5484eb88120cf3e8c9ca422/FLAG282619585 [2022-02-15 01:27:19,550 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73f97fee0/3d55ea4bf5484eb88120cf3e8c9ca422 [2022-02-15 01:27:19,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 01:27:19,553 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-15 01:27:19,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 01:27:19,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 01:27:19,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 01:27:19,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:27:19" (1/1) ... [2022-02-15 01:27:19,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c0dc26a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:19, skipping insertion in model container [2022-02-15 01:27:19,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:27:19" (1/1) ... [2022-02-15 01:27:19,565 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 01:27:19,578 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 01:27:19,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/MADWiFi-encode_ie_ok.i[893,906] [2022-02-15 01:27:19,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 01:27:19,763 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 01:27:19,771 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/MADWiFi-encode_ie_ok.i[893,906] [2022-02-15 01:27:19,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 01:27:19,788 INFO L208 MainTranslator]: Completed translation [2022-02-15 01:27:19,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:19 WrapperNode [2022-02-15 01:27:19,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 01:27:19,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 01:27:19,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 01:27:19,789 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 01:27:19,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:19" (1/1) ... [2022-02-15 01:27:19,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:19" (1/1) ... [2022-02-15 01:27:19,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:19" (1/1) ... [2022-02-15 01:27:19,807 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:19" (1/1) ... [2022-02-15 01:27:19,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:19" (1/1) ... [2022-02-15 01:27:19,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:19" (1/1) ... [2022-02-15 01:27:19,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:19" (1/1) ... [2022-02-15 01:27:19,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 01:27:19,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 01:27:19,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 01:27:19,826 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 01:27:19,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:19" (1/1) ... [2022-02-15 01:27:19,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 01:27:19,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 01:27:19,862 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-15 01:27:19,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-15 01:27:19,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-15 01:27:19,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 01:27:19,899 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-15 01:27:19,899 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-15 01:27:19,900 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-15 01:27:19,900 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-15 01:27:19,900 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-15 01:27:19,900 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-15 01:27:19,900 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-02-15 01:27:19,900 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-02-15 01:27:19,900 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-15 01:27:19,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 01:27:19,901 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-15 01:27:19,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-15 01:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-15 01:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-15 01:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-15 01:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 01:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 01:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 01:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 01:27:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 01:27:19,953 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 01:27:19,955 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 01:27:20,057 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 01:27:20,063 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 01:27:20,063 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-15 01:27:20,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:27:20 BoogieIcfgContainer [2022-02-15 01:27:20,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 01:27:20,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 01:27:20,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 01:27:20,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 01:27:20,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:27:19" (1/3) ... [2022-02-15 01:27:20,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a9926e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:27:20, skipping insertion in model container [2022-02-15 01:27:20,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:27:19" (2/3) ... [2022-02-15 01:27:20,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a9926e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:27:20, skipping insertion in model container [2022-02-15 01:27:20,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:27:20" (3/3) ... [2022-02-15 01:27:20,076 INFO L111 eAbstractionObserver]: Analyzing ICFG MADWiFi-encode_ie_ok.i [2022-02-15 01:27:20,079 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-02-15 01:27:20,080 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-15 01:27:20,115 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 01:27:20,119 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, 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, mLoopAccelerationTechnique=JORDAN [2022-02-15 01:27:20,119 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-15 01:27:20,131 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-15 01:27:20,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-15 01:27:20,136 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:27:20,137 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:27:20,137 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:27:20,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:27:20,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1180455853, now seen corresponding path program 1 times [2022-02-15 01:27:20,147 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:27:20,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1076005480] [2022-02-15 01:27:20,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:27:20,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:27:20,191 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 01:27:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:27:20,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:27:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:27:20,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:27:20,349 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:27:20,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1076005480] [2022-02-15 01:27:20,350 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1076005480] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:27:20,350 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:27:20,351 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-15 01:27:20,351 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772137019] [2022-02-15 01:27:20,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:27:20,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-15 01:27:20,355 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:27:20,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-15 01:27:20,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-15 01:27:20,376 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 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-02-15 01:27:20,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:27:20,567 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2022-02-15 01:27:20,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 01:27:20,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 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 19 [2022-02-15 01:27:20,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:27:20,574 INFO L225 Difference]: With dead ends: 52 [2022-02-15 01:27:20,574 INFO L226 Difference]: Without dead ends: 29 [2022-02-15 01:27:20,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-02-15 01:27:20,581 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 50 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:27:20,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 60 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:27:20,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-15 01:27:20,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-15 01:27:20,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-15 01:27:20,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-02-15 01:27:20,608 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 19 [2022-02-15 01:27:20,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:27:20,609 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-02-15 01:27:20,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 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-02-15 01:27:20,609 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-02-15 01:27:20,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-15 01:27:20,610 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:27:20,610 INFO L514 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] [2022-02-15 01:27:20,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 01:27:20,610 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:27:20,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:27:20,611 INFO L85 PathProgramCache]: Analyzing trace with hash -107986180, now seen corresponding path program 1 times [2022-02-15 01:27:20,611 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:27:20,611 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1892790662] [2022-02-15 01:27:20,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:27:20,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:27:20,614 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 01:27:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:27:20,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:27:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:27:20,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-15 01:27:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:27:20,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:27:20,718 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:27:20,718 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1892790662] [2022-02-15 01:27:20,718 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1892790662] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:27:20,718 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:27:20,719 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-15 01:27:20,719 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393572218] [2022-02-15 01:27:20,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:27:20,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-15 01:27:20,719 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:27:20,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-15 01:27:20,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-15 01:27:20,720 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-15 01:27:20,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:27:20,866 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-02-15 01:27:20,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 01:27:20,866 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-02-15 01:27:20,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:27:20,869 INFO L225 Difference]: With dead ends: 39 [2022-02-15 01:27:20,869 INFO L226 Difference]: Without dead ends: 37 [2022-02-15 01:27:20,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-02-15 01:27:20,875 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:27:20,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 44 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:27:20,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-15 01:27:20,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-02-15 01:27:20,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-15 01:27:20,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-02-15 01:27:20,904 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 24 [2022-02-15 01:27:20,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:27:20,905 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-02-15 01:27:20,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-15 01:27:20,906 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-02-15 01:27:20,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-15 01:27:20,911 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:27:20,913 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:27:20,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 01:27:20,917 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:27:20,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:27:20,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1340590469, now seen corresponding path program 1 times [2022-02-15 01:27:20,918 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:27:20,918 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1602304709] [2022-02-15 01:27:20,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:27:21,112 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:27:21,113 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:27:21,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:27:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:27:21,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:27:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:27:21,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-15 01:27:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:27:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:27:21,958 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:27:21,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1602304709] [2022-02-15 01:27:21,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1602304709] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:27:21,958 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:27:21,958 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-02-15 01:27:21,958 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199181100] [2022-02-15 01:27:21,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:27:21,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-15 01:27:21,959 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:27:21,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-15 01:27:21,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-02-15 01:27:21,960 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 17 states, 15 states have (on average 1.8) internal successors, (27), 12 states have internal predecessors, (27), 4 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-15 01:27:22,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:27:22,103 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-02-15 01:27:22,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-15 01:27:22,104 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.8) internal successors, (27), 12 states have internal predecessors, (27), 4 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 37 [2022-02-15 01:27:22,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:27:22,106 INFO L225 Difference]: With dead ends: 49 [2022-02-15 01:27:22,106 INFO L226 Difference]: Without dead ends: 47 [2022-02-15 01:27:22,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2022-02-15 01:27:22,107 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:27:22,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 106 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 46 Invalid, 0 Unknown, 81 Unchecked, 0.0s Time] [2022-02-15 01:27:22,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-15 01:27:22,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-02-15 01:27:22,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-15 01:27:22,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-02-15 01:27:22,138 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 37 [2022-02-15 01:27:22,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:27:22,138 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-02-15 01:27:22,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.8) internal successors, (27), 12 states have internal predecessors, (27), 4 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-15 01:27:22,139 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-02-15 01:27:22,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-15 01:27:22,141 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:27:22,142 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:27:22,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 01:27:22,142 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:27:22,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:27:22,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1604703908, now seen corresponding path program 2 times [2022-02-15 01:27:22,143 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:27:22,143 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [525374388] [2022-02-15 01:27:22,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:27:22,232 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:27:22,232 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:27:22,341 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:27:22,341 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:27:22,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:27:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:27:22,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:27:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:27:22,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-15 01:27:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:27:22,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:28:17,036 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:28:17,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [525374388] [2022-02-15 01:28:17,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [525374388] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:28:17,037 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:28:17,037 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-02-15 01:28:17,037 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091125149] [2022-02-15 01:28:17,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:28:17,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-15 01:28:17,037 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:28:17,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-15 01:28:17,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=625, Unknown=23, NotChecked=0, Total=756 [2022-02-15 01:28:17,038 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 25 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 17 states have internal predecessors, (33), 5 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-15 01:28:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:28:37,281 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-02-15 01:28:37,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-15 01:28:37,282 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 17 states have internal predecessors, (33), 5 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 50 [2022-02-15 01:28:37,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:28:37,282 INFO L225 Difference]: With dead ends: 47 [2022-02-15 01:28:37,282 INFO L226 Difference]: Without dead ends: 0 [2022-02-15 01:28:37,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 15 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 74.3s TimeCoverageRelationStatistics Valid=200, Invalid=1244, Unknown=38, NotChecked=0, Total=1482 [2022-02-15 01:28:37,284 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 29 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 01:28:37,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 121 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 81 Unchecked, 0.0s Time] [2022-02-15 01:28:37,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-15 01:28:37,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-15 01:28:37,285 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-02-15 01:28:37,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-15 01:28:37,285 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2022-02-15 01:28:37,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:28:37,285 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-15 01:28:37,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 17 states have internal predecessors, (33), 5 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-15 01:28:37,286 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-15 01:28:37,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-15 01:28:37,287 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-15 01:28:37,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-15 01:28:37,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-15 01:29:07,003 WARN L228 SmtUtils]: Spent 29.68s on a formula simplification. DAG size of input: 288 DAG size of output: 79 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-02-15 01:29:20,020 WARN L228 SmtUtils]: Spent 13.01s on a formula simplification. DAG size of input: 223 DAG size of output: 77 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-02-15 01:30:07,193 WARN L228 SmtUtils]: Spent 44.60s on a formula simplification. DAG size of input: 288 DAG size of output: 79 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-02-15 01:30:30,010 WARN L228 SmtUtils]: Spent 22.81s on a formula simplification. DAG size of input: 223 DAG size of output: 98 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-02-15 01:31:16,905 WARN L228 SmtUtils]: Spent 46.49s on a formula simplification. DAG size of input: 288 DAG size of output: 79 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-02-15 01:31:16,972 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-02-15 01:31:16,972 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-02-15 01:31:16,972 INFO L858 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-02-15 01:31:16,972 INFO L858 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-02-15 01:31:16,972 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-02-15 01:31:16,972 INFO L858 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-02-15 01:31:16,972 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-02-15 01:31:16,973 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 24 56) the Hoare annotation is: true [2022-02-15 01:31:16,973 INFO L854 garLoopResultBuilder]: At program point L40(lines 25 56) the Hoare annotation is: (and (<= 1 main_~ielen~0) (<= 1 main_~leader_len~0)) [2022-02-15 01:31:16,973 INFO L861 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: true [2022-02-15 01:31:16,973 INFO L854 garLoopResultBuilder]: At program point L49-2(lines 49 53) the Hoare annotation is: (and (<= 1 main_~p~0) (<= 1 main_~leader_len~0) (< main_~p~0 (+ main_~bufsize_0~0 1))) [2022-02-15 01:31:16,973 INFO L854 garLoopResultBuilder]: At program point L49-3(lines 49 53) the Hoare annotation is: (and (<= 1 main_~p~0) (<= 1 main_~leader_len~0) (< main_~p~0 (+ main_~bufsize_0~0 1))) [2022-02-15 01:31:16,973 INFO L861 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: true [2022-02-15 01:31:16,973 INFO L861 garLoopResultBuilder]: At program point L54(lines 24 56) the Hoare annotation is: true [2022-02-15 01:31:16,973 INFO L854 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (and (< main_~i~0 main_~ielen~0) (<= 1 main_~p~0) (< 2 main_~bufsize~0) (<= (+ main_~p~0 2) main_~bufsize_0~0) (<= 1 main_~leader_len~0)) [2022-02-15 01:31:16,973 INFO L854 garLoopResultBuilder]: At program point L50-1(line 50) the Hoare annotation is: (and (<= 1 main_~p~0) (<= (+ main_~p~0 2) main_~bufsize_0~0) (<= 1 main_~leader_len~0)) [2022-02-15 01:31:16,973 INFO L861 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: true [2022-02-15 01:31:16,974 INFO L854 garLoopResultBuilder]: At program point L38-1(lines 25 56) the Hoare annotation is: (<= 1 main_~leader_len~0) [2022-02-15 01:31:16,974 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 24 56) the Hoare annotation is: true [2022-02-15 01:31:16,974 INFO L854 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (and (<= 1 main_~p~0) (<= (+ main_~p~0 2) main_~bufsize_0~0) (<= 1 main_~leader_len~0)) [2022-02-15 01:31:16,974 INFO L854 garLoopResultBuilder]: At program point L47(lines 47 48) the Hoare annotation is: (and (<= 1 main_~p~0) (<= 1 main_~ielen~0) (<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0) (<= 1 main_~leader_len~0)) [2022-02-15 01:31:16,974 INFO L854 garLoopResultBuilder]: At program point L39(lines 25 56) the Hoare annotation is: (<= 1 main_~leader_len~0) [2022-02-15 01:31:16,974 INFO L861 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: true [2022-02-15 01:31:16,974 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-02-15 01:31:16,974 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-02-15 01:31:16,974 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-02-15 01:31:16,974 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-02-15 01:31:16,974 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-02-15 01:31:16,974 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-02-15 01:31:16,974 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-02-15 01:31:16,975 INFO L854 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| 0) (forall ((v_main_~bufsize_0~0_BEFORE_CALL_4 Int) (v_main_~p~0_BEFORE_CALL_4 Int)) (or (let ((.cse0 (< (+ v_main_~p~0_BEFORE_CALL_4 1) v_main_~bufsize_0~0_BEFORE_CALL_4))) (and (or (not (= |__VERIFIER_assert_#in~cond| 1)) (not .cse0)) (or (not (= |__VERIFIER_assert_#in~cond| 0)) .cse0))) (forall ((v_main_~bufsize_0~0_BEFORE_RETURN_2 Int) (|v_main_#t~post4_10| Int) (|v_main_#t~post4_BEFORE_RETURN_2| Int) (v_main_~i~0_BEFORE_RETURN_2 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_3 Int) (v_main_~p~0_26 Int) (v_main_~ielen~0_BEFORE_RETURN_2 Int) (v_main_~p~0_27 Int)) (let ((.cse3 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_3 0))) (.cse2 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_3 1)))) (or (not (<= (+ v_main_~p~0_26 (* v_main_~ielen~0_BEFORE_RETURN_2 2)) v_main_~bufsize_0~0_BEFORE_RETURN_2)) (not (< (+ v_main_~p~0_26 2) v_main_~bufsize_0~0_BEFORE_RETURN_2)) (and (or (not (< v_main_~i~0_BEFORE_RETURN_2 (+ 2 (div (+ v_main_~bufsize_0~0_BEFORE_RETURN_2 (- 2) (* (- 1) v_main_~p~0_26)) 2)))) (not (< 0 v_main_~i~0_BEFORE_RETURN_2)) (not (= v_main_~p~0_27 (+ v_main_~p~0_26 (* 2 v_main_~i~0_BEFORE_RETURN_2))))) (or (not (= |v_main_#t~post4_10| |v_main_#t~post4_BEFORE_RETURN_2|)) (not (= v_main_~p~0_27 v_main_~p~0_26)) (not (= v_main_~i~0_BEFORE_RETURN_2 0)))) (let ((.cse1 (<= 0 v_main_~p~0_27))) (and (or (not .cse1) .cse2) (or .cse1 .cse3))) (let ((.cse4 (<= 0 v_main_~p~0_BEFORE_CALL_4))) (and (or .cse4 .cse3) (or .cse2 (not .cse4)))) (not (<= 1 v_main_~p~0_26)) (not (< v_main_~i~0_BEFORE_RETURN_2 v_main_~ielen~0_BEFORE_RETURN_2)))))))) [2022-02-15 01:31:16,975 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-02-15 01:31:16,975 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| 0) (forall ((v_main_~bufsize_0~0_BEFORE_CALL_4 Int) (v_main_~p~0_BEFORE_CALL_4 Int)) (or (let ((.cse0 (< (+ v_main_~p~0_BEFORE_CALL_4 1) v_main_~bufsize_0~0_BEFORE_CALL_4))) (and (or (not (= |__VERIFIER_assert_#in~cond| 1)) (not .cse0)) (or (not (= |__VERIFIER_assert_#in~cond| 0)) .cse0))) (forall ((v_main_~bufsize_0~0_BEFORE_RETURN_2 Int) (|v_main_#t~post4_10| Int) (|v_main_#t~post4_BEFORE_RETURN_2| Int) (v_main_~i~0_BEFORE_RETURN_2 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_3 Int) (v_main_~p~0_26 Int) (v_main_~ielen~0_BEFORE_RETURN_2 Int) (v_main_~p~0_27 Int)) (let ((.cse3 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_3 0))) (.cse2 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_3 1)))) (or (not (<= (+ v_main_~p~0_26 (* v_main_~ielen~0_BEFORE_RETURN_2 2)) v_main_~bufsize_0~0_BEFORE_RETURN_2)) (not (< (+ v_main_~p~0_26 2) v_main_~bufsize_0~0_BEFORE_RETURN_2)) (and (or (not (< v_main_~i~0_BEFORE_RETURN_2 (+ 2 (div (+ v_main_~bufsize_0~0_BEFORE_RETURN_2 (- 2) (* (- 1) v_main_~p~0_26)) 2)))) (not (< 0 v_main_~i~0_BEFORE_RETURN_2)) (not (= v_main_~p~0_27 (+ v_main_~p~0_26 (* 2 v_main_~i~0_BEFORE_RETURN_2))))) (or (not (= |v_main_#t~post4_10| |v_main_#t~post4_BEFORE_RETURN_2|)) (not (= v_main_~p~0_27 v_main_~p~0_26)) (not (= v_main_~i~0_BEFORE_RETURN_2 0)))) (let ((.cse1 (<= 0 v_main_~p~0_27))) (and (or (not .cse1) .cse2) (or .cse1 .cse3))) (let ((.cse4 (<= 0 v_main_~p~0_BEFORE_CALL_4))) (and (or .cse4 .cse3) (or .cse2 (not .cse4)))) (not (<= 1 v_main_~p~0_26)) (not (< v_main_~i~0_BEFORE_RETURN_2 v_main_~ielen~0_BEFORE_RETURN_2)))))))) [2022-02-15 01:31:16,975 INFO L854 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (forall ((v_main_~bufsize_0~0_BEFORE_CALL_4 Int) (v_main_~p~0_BEFORE_CALL_4 Int)) (or (let ((.cse0 (< (+ v_main_~p~0_BEFORE_CALL_4 1) v_main_~bufsize_0~0_BEFORE_CALL_4))) (and (or (not (= |__VERIFIER_assert_#in~cond| 1)) (not .cse0)) (or (not (= |__VERIFIER_assert_#in~cond| 0)) .cse0))) (forall ((v_main_~bufsize_0~0_BEFORE_RETURN_2 Int) (|v_main_#t~post4_10| Int) (|v_main_#t~post4_BEFORE_RETURN_2| Int) (v_main_~i~0_BEFORE_RETURN_2 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_3 Int) (v_main_~p~0_26 Int) (v_main_~ielen~0_BEFORE_RETURN_2 Int) (v_main_~p~0_27 Int)) (let ((.cse3 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_3 0))) (.cse2 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_3 1)))) (or (not (<= (+ v_main_~p~0_26 (* v_main_~ielen~0_BEFORE_RETURN_2 2)) v_main_~bufsize_0~0_BEFORE_RETURN_2)) (not (< (+ v_main_~p~0_26 2) v_main_~bufsize_0~0_BEFORE_RETURN_2)) (and (or (not (< v_main_~i~0_BEFORE_RETURN_2 (+ 2 (div (+ v_main_~bufsize_0~0_BEFORE_RETURN_2 (- 2) (* (- 1) v_main_~p~0_26)) 2)))) (not (< 0 v_main_~i~0_BEFORE_RETURN_2)) (not (= v_main_~p~0_27 (+ v_main_~p~0_26 (* 2 v_main_~i~0_BEFORE_RETURN_2))))) (or (not (= |v_main_#t~post4_10| |v_main_#t~post4_BEFORE_RETURN_2|)) (not (= v_main_~p~0_27 v_main_~p~0_26)) (not (= v_main_~i~0_BEFORE_RETURN_2 0)))) (let ((.cse1 (<= 0 v_main_~p~0_27))) (and (or (not .cse1) .cse2) (or .cse1 .cse3))) (let ((.cse4 (<= 0 v_main_~p~0_BEFORE_CALL_4))) (and (or .cse4 .cse3) (or .cse2 (not .cse4)))) (not (<= 1 v_main_~p~0_26)) (not (< v_main_~i~0_BEFORE_RETURN_2 v_main_~ielen~0_BEFORE_RETURN_2)))))))) [2022-02-15 01:31:16,975 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (let ((.cse0 (= |__VERIFIER_assert_#in~cond| 0))) (and (or .cse0 (forall ((v_main_~bufsize_0~0_BEFORE_CALL_4 Int) (v_main_~p~0_BEFORE_CALL_4 Int)) (or (let ((.cse1 (< (+ v_main_~p~0_BEFORE_CALL_4 1) v_main_~bufsize_0~0_BEFORE_CALL_4))) (and (or (not (= |__VERIFIER_assert_#in~cond| 1)) (not .cse1)) (or (not (= |__VERIFIER_assert_#in~cond| 0)) .cse1))) (forall ((v_main_~bufsize_0~0_BEFORE_RETURN_2 Int) (|v_main_#t~post4_10| Int) (|v_main_#t~post4_BEFORE_RETURN_2| Int) (v_main_~i~0_BEFORE_RETURN_2 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_3 Int) (v_main_~p~0_26 Int) (v_main_~ielen~0_BEFORE_RETURN_2 Int) (v_main_~p~0_27 Int)) (let ((.cse4 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_3 0))) (.cse3 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_3 1)))) (or (not (<= (+ v_main_~p~0_26 (* v_main_~ielen~0_BEFORE_RETURN_2 2)) v_main_~bufsize_0~0_BEFORE_RETURN_2)) (not (< (+ v_main_~p~0_26 2) v_main_~bufsize_0~0_BEFORE_RETURN_2)) (and (or (not (< v_main_~i~0_BEFORE_RETURN_2 (+ 2 (div (+ v_main_~bufsize_0~0_BEFORE_RETURN_2 (- 2) (* (- 1) v_main_~p~0_26)) 2)))) (not (< 0 v_main_~i~0_BEFORE_RETURN_2)) (not (= v_main_~p~0_27 (+ v_main_~p~0_26 (* 2 v_main_~i~0_BEFORE_RETURN_2))))) (or (not (= |v_main_#t~post4_10| |v_main_#t~post4_BEFORE_RETURN_2|)) (not (= v_main_~p~0_27 v_main_~p~0_26)) (not (= v_main_~i~0_BEFORE_RETURN_2 0)))) (let ((.cse2 (<= 0 v_main_~p~0_27))) (and (or (not .cse2) .cse3) (or .cse2 .cse4))) (let ((.cse5 (<= 0 v_main_~p~0_BEFORE_CALL_4))) (and (or .cse5 .cse4) (or .cse3 (not .cse5)))) (not (<= 1 v_main_~p~0_26)) (not (< v_main_~i~0_BEFORE_RETURN_2 v_main_~ielen~0_BEFORE_RETURN_2)))))))) (or (not (< 2 main_~bufsize~0)) (not (< main_~i~0 main_~ielen~0)) .cse0 (forall ((v_main_~p~0_30 Int)) (or (not (< v_main_~p~0_30 (+ main_~bufsize_0~0 1))) (let ((.cse6 (<= 0 v_main_~p~0_30))) (and (or (not (= |__VERIFIER_assert_#in~cond| 0)) .cse6) (or (not .cse6) (not (= |__VERIFIER_assert_#in~cond| 1)))))))))) [2022-02-15 01:31:16,975 INFO L854 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| 0) (forall ((v_main_~bufsize_0~0_BEFORE_CALL_4 Int) (v_main_~p~0_BEFORE_CALL_4 Int)) (or (let ((.cse0 (< (+ v_main_~p~0_BEFORE_CALL_4 1) v_main_~bufsize_0~0_BEFORE_CALL_4))) (and (or (not (= |__VERIFIER_assert_#in~cond| 1)) (not .cse0)) (or (not (= |__VERIFIER_assert_#in~cond| 0)) .cse0))) (forall ((v_main_~bufsize_0~0_BEFORE_RETURN_2 Int) (|v_main_#t~post4_10| Int) (|v_main_#t~post4_BEFORE_RETURN_2| Int) (v_main_~i~0_BEFORE_RETURN_2 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_3 Int) (v_main_~p~0_26 Int) (v_main_~ielen~0_BEFORE_RETURN_2 Int) (v_main_~p~0_27 Int)) (let ((.cse3 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_3 0))) (.cse2 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_3 1)))) (or (not (<= (+ v_main_~p~0_26 (* v_main_~ielen~0_BEFORE_RETURN_2 2)) v_main_~bufsize_0~0_BEFORE_RETURN_2)) (not (< (+ v_main_~p~0_26 2) v_main_~bufsize_0~0_BEFORE_RETURN_2)) (and (or (not (< v_main_~i~0_BEFORE_RETURN_2 (+ 2 (div (+ v_main_~bufsize_0~0_BEFORE_RETURN_2 (- 2) (* (- 1) v_main_~p~0_26)) 2)))) (not (< 0 v_main_~i~0_BEFORE_RETURN_2)) (not (= v_main_~p~0_27 (+ v_main_~p~0_26 (* 2 v_main_~i~0_BEFORE_RETURN_2))))) (or (not (= |v_main_#t~post4_10| |v_main_#t~post4_BEFORE_RETURN_2|)) (not (= v_main_~p~0_27 v_main_~p~0_26)) (not (= v_main_~i~0_BEFORE_RETURN_2 0)))) (let ((.cse1 (<= 0 v_main_~p~0_27))) (and (or (not .cse1) .cse2) (or .cse1 .cse3))) (let ((.cse4 (<= 0 v_main_~p~0_BEFORE_CALL_4))) (and (or .cse4 .cse3) (or .cse2 (not .cse4)))) (not (<= 1 v_main_~p~0_26)) (not (< v_main_~i~0_BEFORE_RETURN_2 v_main_~ielen~0_BEFORE_RETURN_2)))))))) [2022-02-15 01:31:16,977 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-02-15 01:31:16,978 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-15 01:31:17,000 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_BEFORE_CALL_4,QUANTIFIED] [2022-02-15 01:31:17,002 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufsize_0~0_BEFORE_CALL_4,QUANTIFIED] [2022-02-15 01:31:17,002 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_BEFORE_CALL_4,QUANTIFIED] [2022-02-15 01:31:17,002 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufsize_0~0_BEFORE_CALL_4,QUANTIFIED] [2022-02-15 01:31:17,002 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_26,QUANTIFIED] [2022-02-15 01:31:17,002 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~ielen~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,002 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufsize_0~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,002 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_26,QUANTIFIED] [2022-02-15 01:31:17,002 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufsize_0~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,002 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,003 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufsize_0~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,003 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_26,QUANTIFIED] [2022-02-15 01:31:17,003 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,003 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_27,QUANTIFIED] [2022-02-15 01:31:17,003 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_26,QUANTIFIED] [2022-02-15 01:31:17,003 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,003 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post4_10,QUANTIFIED] [2022-02-15 01:31:17,003 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post4_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,003 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_27,QUANTIFIED] [2022-02-15 01:31:17,003 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_26,QUANTIFIED] [2022-02-15 01:31:17,004 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,011 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_27,QUANTIFIED] [2022-02-15 01:31:17,011 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_3,QUANTIFIED] [2022-02-15 01:31:17,012 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_27,QUANTIFIED] [2022-02-15 01:31:17,012 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_3,QUANTIFIED] [2022-02-15 01:31:17,012 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_BEFORE_CALL_4,QUANTIFIED] [2022-02-15 01:31:17,012 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_3,QUANTIFIED] [2022-02-15 01:31:17,012 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_3,QUANTIFIED] [2022-02-15 01:31:17,012 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_BEFORE_CALL_4,QUANTIFIED] [2022-02-15 01:31:17,012 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_26,QUANTIFIED] [2022-02-15 01:31:17,012 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,012 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~ielen~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:31:17 BoogieIcfgContainer [2022-02-15 01:31:17,014 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-15 01:31:17,016 INFO L158 Benchmark]: Toolchain (without parser) took 237462.08ms. Allocated memory was 187.7MB in the beginning and 225.4MB in the end (delta: 37.7MB). Free memory was 138.5MB in the beginning and 201.9MB in the end (delta: -63.4MB). Peak memory consumption was 102.2MB. Max. memory is 8.0GB. [2022-02-15 01:31:17,017 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 187.7MB. Free memory was 154.8MB in the beginning and 154.7MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-02-15 01:31:17,017 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.43ms. Allocated memory is still 187.7MB. Free memory was 138.3MB in the beginning and 164.4MB in the end (delta: -26.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-02-15 01:31:17,018 INFO L158 Benchmark]: Boogie Preprocessor took 36.36ms. Allocated memory is still 187.7MB. Free memory was 164.4MB in the beginning and 162.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-15 01:31:17,018 INFO L158 Benchmark]: RCFGBuilder took 239.49ms. Allocated memory is still 187.7MB. Free memory was 162.9MB in the beginning and 151.8MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-02-15 01:31:17,019 INFO L158 Benchmark]: TraceAbstraction took 236948.30ms. Allocated memory was 187.7MB in the beginning and 225.4MB in the end (delta: 37.7MB). Free memory was 151.3MB in the beginning and 201.9MB in the end (delta: -50.6MB). Peak memory consumption was 115.1MB. Max. memory is 8.0GB. [2022-02-15 01:31:17,020 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 187.7MB. Free memory was 154.8MB in the beginning and 154.7MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 231.43ms. Allocated memory is still 187.7MB. Free memory was 138.3MB in the beginning and 164.4MB in the end (delta: -26.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.36ms. Allocated memory is still 187.7MB. Free memory was 164.4MB in the beginning and 162.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 239.49ms. Allocated memory is still 187.7MB. Free memory was 162.9MB in the beginning and 151.8MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 236948.30ms. Allocated memory was 187.7MB in the beginning and 225.4MB in the end (delta: 37.7MB). Free memory was 151.3MB in the beginning and 201.9MB in the end (delta: -50.6MB). Peak memory consumption was 115.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufsize_0~0_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufsize_0~0_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~ielen~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufsize_0~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufsize_0~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufsize_0~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post4_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post4_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~ielen~0_BEFORE_RETURN_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 236.9s, OverallIterations: 4, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 20.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 159.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 129 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 125 mSDsluCounter, 331 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 162 IncrementalHoareTripleChecker+Unchecked, 235 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 286 IncrementalHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 96 mSDtfsCounter, 286 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 33 SyntacticMatches, 10 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 74.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=3, InterpolantAutomatonStates: 53, 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, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 71 PreInvPairs, 102 NumberOfFragments, 803 HoareAnnotationTreeSize, 71 FomulaSimplifications, 23 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 6532 FormulaSimplificationTreeSizeReductionInter, 159.6s 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: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (1 <= p && 1 <= leader_len) && p < bufsize_0 + 1 - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert [2022-02-15 01:31:17,027 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_BEFORE_CALL_4,QUANTIFIED] [2022-02-15 01:31:17,027 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufsize_0~0_BEFORE_CALL_4,QUANTIFIED] [2022-02-15 01:31:17,027 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_BEFORE_CALL_4,QUANTIFIED] [2022-02-15 01:31:17,027 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufsize_0~0_BEFORE_CALL_4,QUANTIFIED] [2022-02-15 01:31:17,027 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_26,QUANTIFIED] [2022-02-15 01:31:17,027 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~ielen~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,027 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufsize_0~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,027 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_26,QUANTIFIED] [2022-02-15 01:31:17,027 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufsize_0~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,029 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,029 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufsize_0~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,029 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_26,QUANTIFIED] [2022-02-15 01:31:17,029 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,029 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_27,QUANTIFIED] [2022-02-15 01:31:17,029 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_26,QUANTIFIED] [2022-02-15 01:31:17,029 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post4_10,QUANTIFIED] [2022-02-15 01:31:17,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post4_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_27,QUANTIFIED] [2022-02-15 01:31:17,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_26,QUANTIFIED] [2022-02-15 01:31:17,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_27,QUANTIFIED] [2022-02-15 01:31:17,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_3,QUANTIFIED] [2022-02-15 01:31:17,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_27,QUANTIFIED] [2022-02-15 01:31:17,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_3,QUANTIFIED] [2022-02-15 01:31:17,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_BEFORE_CALL_4,QUANTIFIED] [2022-02-15 01:31:17,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_3,QUANTIFIED] [2022-02-15 01:31:17,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_3,QUANTIFIED] [2022-02-15 01:31:17,031 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_BEFORE_CALL_4,QUANTIFIED] [2022-02-15 01:31:17,031 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_26,QUANTIFIED] [2022-02-15 01:31:17,031 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,031 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~ielen~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,035 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_BEFORE_CALL_4,QUANTIFIED] [2022-02-15 01:31:17,035 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufsize_0~0_BEFORE_CALL_4,QUANTIFIED] [2022-02-15 01:31:17,035 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_BEFORE_CALL_4,QUANTIFIED] [2022-02-15 01:31:17,035 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufsize_0~0_BEFORE_CALL_4,QUANTIFIED] [2022-02-15 01:31:17,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_26,QUANTIFIED] [2022-02-15 01:31:17,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~ielen~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufsize_0~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_26,QUANTIFIED] [2022-02-15 01:31:17,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufsize_0~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~bufsize_0~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_26,QUANTIFIED] [2022-02-15 01:31:17,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_27,QUANTIFIED] [2022-02-15 01:31:17,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_26,QUANTIFIED] [2022-02-15 01:31:17,037 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,037 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post4_10,QUANTIFIED] [2022-02-15 01:31:17,037 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post4_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,037 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_27,QUANTIFIED] [2022-02-15 01:31:17,037 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_26,QUANTIFIED] [2022-02-15 01:31:17,037 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,037 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_27,QUANTIFIED] [2022-02-15 01:31:17,037 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_3,QUANTIFIED] [2022-02-15 01:31:17,037 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_27,QUANTIFIED] [2022-02-15 01:31:17,037 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_3,QUANTIFIED] [2022-02-15 01:31:17,037 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_BEFORE_CALL_4,QUANTIFIED] [2022-02-15 01:31:17,038 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_3,QUANTIFIED] [2022-02-15 01:31:17,038 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_3,QUANTIFIED] [2022-02-15 01:31:17,038 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_BEFORE_CALL_4,QUANTIFIED] [2022-02-15 01:31:17,038 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_26,QUANTIFIED] [2022-02-15 01:31:17,038 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_2,QUANTIFIED] [2022-02-15 01:31:17,038 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~ielen~0_BEFORE_RETURN_2,QUANTIFIED] Derived contract for procedure __VERIFIER_assert: (\old(cond) == cond || \old(cond) == 0) || (forall v_main_~bufsize_0~0_BEFORE_CALL_4 : int, v_main_~p~0_BEFORE_CALL_4 : int :: ((!(\old(cond) == 1) || !(v_main_~p~0_BEFORE_CALL_4 + 1 < v_main_~bufsize_0~0_BEFORE_CALL_4)) && (!(\old(cond) == 0) || v_main_~p~0_BEFORE_CALL_4 + 1 < v_main_~bufsize_0~0_BEFORE_CALL_4)) || (forall v_main_~bufsize_0~0_BEFORE_RETURN_2 : int, v_main_#t~post4_10 : int, v_main_#t~post4_BEFORE_RETURN_2 : int, v_main_~i~0_BEFORE_RETURN_2 : int, v___VERIFIER_assert_~cond_BEFORE_RETURN_3 : int, v_main_~p~0_26 : int, v_main_~ielen~0_BEFORE_RETURN_2 : int, v_main_~p~0_27 : int :: (((((!(v_main_~p~0_26 + v_main_~ielen~0_BEFORE_RETURN_2 * 2 <= v_main_~bufsize_0~0_BEFORE_RETURN_2) || !(v_main_~p~0_26 + 2 < v_main_~bufsize_0~0_BEFORE_RETURN_2)) || (((!(v_main_~i~0_BEFORE_RETURN_2 < 2 + (v_main_~bufsize_0~0_BEFORE_RETURN_2 + -2 + -1 * v_main_~p~0_26) / 2) || !(0 < v_main_~i~0_BEFORE_RETURN_2)) || !(v_main_~p~0_27 == v_main_~p~0_26 + 2 * v_main_~i~0_BEFORE_RETURN_2)) && ((!(v_main_#t~post4_10 == v_main_#t~post4_BEFORE_RETURN_2) || !(v_main_~p~0_27 == v_main_~p~0_26)) || !(v_main_~i~0_BEFORE_RETURN_2 == 0)))) || ((!(0 <= v_main_~p~0_27) || !(v___VERIFIER_assert_~cond_BEFORE_RETURN_3 == 1)) && (0 <= v_main_~p~0_27 || !(v___VERIFIER_assert_~cond_BEFORE_RETURN_3 == 0)))) || ((0 <= v_main_~p~0_BEFORE_CALL_4 || !(v___VERIFIER_assert_~cond_BEFORE_RETURN_3 == 0)) && (!(v___VERIFIER_assert_~cond_BEFORE_RETURN_3 == 1) || !(0 <= v_main_~p~0_BEFORE_CALL_4)))) || !(1 <= v_main_~p~0_26)) || !(v_main_~i~0_BEFORE_RETURN_2 < v_main_~ielen~0_BEFORE_RETURN_2))) RESULT: Ultimate proved your program to be correct! [2022-02-15 01:31:17,255 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-02-15 01:31:17,295 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 137 Received shutdown request...