/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/apache-get-tag.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 20:57:49,826 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 20:57:49,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 20:57:49,888 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 20:57:49,889 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 20:57:49,891 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 20:57:49,894 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 20:57:49,900 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 20:57:49,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 20:57:49,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 20:57:49,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 20:57:49,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 20:57:49,904 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 20:57:49,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 20:57:49,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 20:57:49,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 20:57:49,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 20:57:49,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 20:57:49,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 20:57:49,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 20:57:49,914 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 20:57:49,919 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 20:57:49,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 20:57:49,923 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 20:57:49,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 20:57:49,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 20:57:49,932 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 20:57:49,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 20:57:49,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 20:57:49,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 20:57:49,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 20:57:49,934 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 20:57:49,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 20:57:49,938 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 20:57:49,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 20:57:49,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 20:57:49,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 20:57:49,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 20:57:49,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 20:57:49,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 20:57:49,942 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 20:57:49,943 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-01-31 20:57:49,955 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 20:57:49,955 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 20:57:49,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 20:57:49,957 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 20:57:49,957 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 20:57:49,957 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 20:57:49,957 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 20:57:49,957 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 20:57:49,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 20:57:49,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 20:57:49,958 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 20:57:49,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 20:57:49,959 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 20:57:49,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 20:57:49,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 20:57:49,959 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 20:57:49,959 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 20:57:49,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 20:57:49,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 20:57:49,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 20:57:49,960 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 20:57:49,960 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 20:57:49,960 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 20:57:49,960 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-01-31 20:57:50,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 20:57:50,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 20:57:50,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 20:57:50,205 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 20:57:50,207 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 20:57:50,208 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i [2022-01-31 20:57:50,270 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0f386686/18d857a87bea4d1eadec6dedd7cd74ca/FLAG639f02a87 [2022-01-31 20:57:50,657 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 20:57:50,658 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i [2022-01-31 20:57:50,670 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0f386686/18d857a87bea4d1eadec6dedd7cd74ca/FLAG639f02a87 [2022-01-31 20:57:51,061 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0f386686/18d857a87bea4d1eadec6dedd7cd74ca [2022-01-31 20:57:51,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 20:57:51,064 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 20:57:51,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 20:57:51,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 20:57:51,068 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 20:57:51,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:57:51" (1/1) ... [2022-01-31 20:57:51,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@528a9bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:57:51, skipping insertion in model container [2022-01-31 20:57:51,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:57:51" (1/1) ... [2022-01-31 20:57:51,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 20:57:51,088 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 20:57:51,204 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/apache-get-tag.i[893,906] [2022-01-31 20:57:51,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 20:57:51,241 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 20:57:51,250 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/apache-get-tag.i[893,906] [2022-01-31 20:57:51,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 20:57:51,269 INFO L208 MainTranslator]: Completed translation [2022-01-31 20:57:51,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:57:51 WrapperNode [2022-01-31 20:57:51,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 20:57:51,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 20:57:51,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 20:57:51,270 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 20:57:51,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:57:51" (1/1) ... [2022-01-31 20:57:51,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:57:51" (1/1) ... [2022-01-31 20:57:51,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:57:51" (1/1) ... [2022-01-31 20:57:51,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:57:51" (1/1) ... [2022-01-31 20:57:51,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:57:51" (1/1) ... [2022-01-31 20:57:51,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:57:51" (1/1) ... [2022-01-31 20:57:51,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:57:51" (1/1) ... [2022-01-31 20:57:51,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 20:57:51,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 20:57:51,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 20:57:51,310 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 20:57:51,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:57:51" (1/1) ... [2022-01-31 20:57:51,319 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 20:57:51,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 20:57:51,340 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-01-31 20:57:51,342 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-01-31 20:57:51,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 20:57:51,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 20:57:51,367 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 20:57:51,367 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 20:57:51,367 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 20:57:51,368 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 20:57:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 20:57:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 20:57:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-01-31 20:57:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-01-31 20:57:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 20:57:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 20:57:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 20:57:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 20:57:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 20:57:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 20:57:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 20:57:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 20:57:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 20:57:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 20:57:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 20:57:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 20:57:51,448 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 20:57:51,450 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 20:57:51,673 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 20:57:51,684 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 20:57:51,684 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-31 20:57:51,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:57:51 BoogieIcfgContainer [2022-01-31 20:57:51,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 20:57:51,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 20:57:51,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 20:57:51,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 20:57:51,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:57:51" (1/3) ... [2022-01-31 20:57:51,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d73aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:57:51, skipping insertion in model container [2022-01-31 20:57:51,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:57:51" (2/3) ... [2022-01-31 20:57:51,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d73aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:57:51, skipping insertion in model container [2022-01-31 20:57:51,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:57:51" (3/3) ... [2022-01-31 20:57:51,697 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i [2022-01-31 20:57:51,704 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 20:57:51,704 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 20:57:51,750 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 20:57:51,761 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-01-31 20:57:51,761 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 20:57:51,778 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 25 states have (on average 1.56) internal successors, (39), 30 states have internal predecessors, (39), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-01-31 20:57:51,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-31 20:57:51,794 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:57:51,794 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:57:51,795 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:57:51,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:57:51,800 INFO L85 PathProgramCache]: Analyzing trace with hash 343233864, now seen corresponding path program 1 times [2022-01-31 20:57:51,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:57:51,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [282277928] [2022-01-31 20:57:51,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:57:51,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:57:51,864 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:57:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:51,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:57:51,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:51,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:57:51,983 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:57:51,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [282277928] [2022-01-31 20:57:51,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [282277928] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:57:51,985 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:57:51,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 20:57:51,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397198556] [2022-01-31 20:57:51,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:57:51,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 20:57:51,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:57:52,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 20:57:52,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 20:57:52,021 INFO L87 Difference]: Start difference. First operand has 48 states, 25 states have (on average 1.56) internal successors, (39), 30 states have internal predecessors, (39), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-01-31 20:57:52,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:57:52,167 INFO L93 Difference]: Finished difference Result 88 states and 157 transitions. [2022-01-31 20:57:52,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 20:57:52,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 13 [2022-01-31 20:57:52,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:57:52,187 INFO L225 Difference]: With dead ends: 88 [2022-01-31 20:57:52,187 INFO L226 Difference]: Without dead ends: 43 [2022-01-31 20:57:52,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 20:57:52,196 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 31 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:57:52,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 57 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:57:52,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-31 20:57:52,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-01-31 20:57:52,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 18 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-01-31 20:57:52,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2022-01-31 20:57:52,232 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 13 [2022-01-31 20:57:52,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:57:52,233 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2022-01-31 20:57:52,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-01-31 20:57:52,233 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-01-31 20:57:52,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-31 20:57:52,234 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:57:52,234 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:57:52,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 20:57:52,234 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:57:52,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:57:52,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1474362961, now seen corresponding path program 1 times [2022-01-31 20:57:52,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:57:52,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1711744568] [2022-01-31 20:57:52,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:57:52,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:57:52,238 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:57:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:52,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:57:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:52,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:57:52,354 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:57:52,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1711744568] [2022-01-31 20:57:52,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1711744568] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:57:52,354 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:57:52,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 20:57:52,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546906116] [2022-01-31 20:57:52,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:57:52,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 20:57:52,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:57:52,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 20:57:52,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 20:57:52,356 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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-01-31 20:57:52,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:57:52,583 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2022-01-31 20:57:52,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 20:57:52,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2022-01-31 20:57:52,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:57:52,589 INFO L225 Difference]: With dead ends: 49 [2022-01-31 20:57:52,589 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 20:57:52,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 20:57:52,596 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 47 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:57:52,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 54 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:57:52,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 20:57:52,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-01-31 20:57:52,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 1.32) internal successors, (33), 29 states have internal predecessors, (33), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-01-31 20:57:52,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2022-01-31 20:57:52,612 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 14 [2022-01-31 20:57:52,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:57:52,612 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2022-01-31 20:57:52,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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-01-31 20:57:52,613 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-01-31 20:57:52,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 20:57:52,613 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:57:52,613 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:57:52,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 20:57:52,614 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:57:52,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:57:52,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1520724128, now seen corresponding path program 1 times [2022-01-31 20:57:52,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:57:52,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [3348392] [2022-01-31 20:57:52,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:57:52,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:57:52,624 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:57:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:52,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:57:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:52,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 20:57:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:52,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:57:52,778 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:57:52,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [3348392] [2022-01-31 20:57:52,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [3348392] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:57:52,780 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:57:52,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 20:57:52,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157183667] [2022-01-31 20:57:52,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:57:52,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 20:57:52,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:57:52,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 20:57:52,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 20:57:52,783 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:57:53,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:57:53,101 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2022-01-31 20:57:53,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 20:57:53,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-01-31 20:57:53,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:57:53,103 INFO L225 Difference]: With dead ends: 62 [2022-01-31 20:57:53,103 INFO L226 Difference]: Without dead ends: 50 [2022-01-31 20:57:53,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 20:57:53,104 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 41 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 20:57:53,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 68 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 20:57:53,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-01-31 20:57:53,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2022-01-31 20:57:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-31 20:57:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2022-01-31 20:57:53,114 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 19 [2022-01-31 20:57:53,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:57:53,114 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2022-01-31 20:57:53,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:57:53,115 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2022-01-31 20:57:53,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 20:57:53,115 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:57:53,115 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:57:53,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 20:57:53,116 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:57:53,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:57:53,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1868871511, now seen corresponding path program 1 times [2022-01-31 20:57:53,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:57:53,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [765425942] [2022-01-31 20:57:53,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:57:53,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:57:53,118 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:57:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:53,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:57:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:53,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 20:57:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:53,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:57:53,177 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:57:53,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [765425942] [2022-01-31 20:57:53,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [765425942] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:57:53,177 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:57:53,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 20:57:53,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396449595] [2022-01-31 20:57:53,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:57:53,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 20:57:53,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:57:53,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 20:57:53,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-31 20:57:53,179 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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-01-31 20:57:53,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:57:53,398 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-01-31 20:57:53,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 20:57:53,399 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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 20 [2022-01-31 20:57:53,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:57:53,402 INFO L225 Difference]: With dead ends: 60 [2022-01-31 20:57:53,402 INFO L226 Difference]: Without dead ends: 58 [2022-01-31 20:57:53,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-01-31 20:57:53,405 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 57 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 20:57:53,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 55 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 20:57:53,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-31 20:57:53,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-01-31 20:57:53,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-01-31 20:57:53,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-01-31 20:57:53,417 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 20 [2022-01-31 20:57:53,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:57:53,417 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-01-31 20:57:53,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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-01-31 20:57:53,418 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-01-31 20:57:53,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 20:57:53,419 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:57:53,419 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:57:53,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 20:57:53,419 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:57:53,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:57:53,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1843501053, now seen corresponding path program 1 times [2022-01-31 20:57:53,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:57:53,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [530754232] [2022-01-31 20:57:53,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:57:53,600 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:57:53,601 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 20:57:53,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:57:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:53,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:57:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:53,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 20:57:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:57:53,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:58:23,862 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:23,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [530754232] [2022-01-31 20:58:23,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [530754232] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:23,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:23,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-31 20:58:23,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494091593] [2022-01-31 20:58:23,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:23,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 20:58:23,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:23,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 20:58:23,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=328, Unknown=24, NotChecked=0, Total=420 [2022-01-31 20:58:23,864 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 18 states, 16 states have (on average 1.5) internal successors, (24), 12 states have internal predecessors, (24), 4 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 20:58:44,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:44,844 INFO L93 Difference]: Finished difference Result 99 states and 122 transitions. [2022-01-31 20:58:44,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 20:58:44,844 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.5) internal successors, (24), 12 states have internal predecessors, (24), 4 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-01-31 20:58:44,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:44,845 INFO L225 Difference]: With dead ends: 99 [2022-01-31 20:58:44,846 INFO L226 Difference]: Without dead ends: 68 [2022-01-31 20:58:44,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 50.6s TimeCoverageRelationStatistics Valid=152, Invalid=790, Unknown=50, NotChecked=0, Total=992 [2022-01-31 20:58:44,847 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 57 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 351 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:44,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 104 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 295 Invalid, 0 Unknown, 351 Unchecked, 0.2s Time] [2022-01-31 20:58:44,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-01-31 20:58:44,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2022-01-31 20:58:44,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.146341463414634) internal successors, (47), 44 states have internal predecessors, (47), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-01-31 20:58:44,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2022-01-31 20:58:44,862 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 34 [2022-01-31 20:58:44,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:44,862 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2022-01-31 20:58:44,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.5) internal successors, (24), 12 states have internal predecessors, (24), 4 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 20:58:44,862 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2022-01-31 20:58:44,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 20:58:44,864 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:44,864 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:44,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 20:58:44,864 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:44,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:44,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1533190621, now seen corresponding path program 2 times [2022-01-31 20:58:44,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:44,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [862461116] [2022-01-31 20:58:44,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:44,950 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:58:44,950 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 20:58:44,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:45,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:45,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 20:58:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:45,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:59:50,868 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:59:50,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [862461116] [2022-01-31 20:59:50,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [862461116] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:59:50,868 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:59:50,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-31 20:59:50,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225578922] [2022-01-31 20:59:50,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:59:50,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 20:59:50,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:59:50,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 20:59:50,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=744, Unknown=53, NotChecked=0, Total=930 [2022-01-31 20:59:50,870 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand has 28 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 19 states have internal predecessors, (34), 6 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 21:00:10,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:00:10,221 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2022-01-31 21:00:10,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-31 21:00:10,222 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 19 states have internal predecessors, (34), 6 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 48 [2022-01-31 21:00:10,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:00:10,224 INFO L225 Difference]: With dead ends: 111 [2022-01-31 21:00:10,224 INFO L226 Difference]: Without dead ends: 109 [2022-01-31 21:00:10,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 84.8s TimeCoverageRelationStatistics Valid=233, Invalid=1490, Unknown=83, NotChecked=0, Total=1806 [2022-01-31 21:00:10,226 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 69 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 435 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:00:10,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 236 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 159 Invalid, 0 Unknown, 435 Unchecked, 0.2s Time] [2022-01-31 21:00:10,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-01-31 21:00:10,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2022-01-31 21:00:10,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 61 states have internal predecessors, (67), 20 states have call successors, (20), 12 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-01-31 21:00:10,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 105 transitions. [2022-01-31 21:00:10,262 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 105 transitions. Word has length 48 [2022-01-31 21:00:10,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:00:10,264 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 105 transitions. [2022-01-31 21:00:10,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 19 states have internal predecessors, (34), 6 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 21:00:10,265 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 105 transitions. [2022-01-31 21:00:10,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 21:00:10,272 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:00:10,272 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:00:10,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 21:00:10,273 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:00:10,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:00:10,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1004819677, now seen corresponding path program 1 times [2022-01-31 21:00:10,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:00:10,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1651967027] [2022-01-31 21:00:10,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:00:10,343 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:00:10,343 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:00:10,417 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:00:10,418 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:00:10,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:00:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:00:10,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:00:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:00:10,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:00:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:00:10,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:01:39,897 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:01:39,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1651967027] [2022-01-31 21:01:39,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1651967027] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:01:39,898 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:01:39,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-31 21:01:39,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94784594] [2022-01-31 21:01:39,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:01:39,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 21:01:39,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:01:39,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 21:01:39,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=691, Unknown=51, NotChecked=0, Total=870 [2022-01-31 21:01:39,900 INFO L87 Difference]: Start difference. First operand 90 states and 105 transitions. Second operand has 27 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 19 states have internal predecessors, (34), 5 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-31 21:02:22,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:02:22,223 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2022-01-31 21:02:22,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 21:02:22,224 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 19 states have internal predecessors, (34), 5 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 48 [2022-01-31 21:02:22,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:02:22,225 INFO L225 Difference]: With dead ends: 92 [2022-01-31 21:02:22,225 INFO L226 Difference]: Without dead ends: 90 [2022-01-31 21:02:22,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 131.4s TimeCoverageRelationStatistics Valid=269, Invalid=1628, Unknown=83, NotChecked=0, Total=1980 [2022-01-31 21:02:22,227 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 30 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:02:22,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 144 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 184 Invalid, 0 Unknown, 160 Unchecked, 0.1s Time] [2022-01-31 21:02:22,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-01-31 21:02:22,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 74. [2022-01-31 21:02:22,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 50 states have internal predecessors, (55), 16 states have call successors, (16), 10 states have call predecessors, (16), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-01-31 21:02:22,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2022-01-31 21:02:22,243 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 48 [2022-01-31 21:02:22,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:02:22,244 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2022-01-31 21:02:22,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 19 states have internal predecessors, (34), 5 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-31 21:02:22,244 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2022-01-31 21:02:22,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 21:02:22,245 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:02:22,245 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:02:22,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 21:02:22,245 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:02:22,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:02:22,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1190035473, now seen corresponding path program 1 times [2022-01-31 21:02:22,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:02:22,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [131508255] [2022-01-31 21:02:22,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:02:22,333 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:02:22,334 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:02:22,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:02:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:02:22,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:02:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:02:22,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:02:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:02:22,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:02:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:02:22,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 21:02:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:02:22,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 21:02:55,863 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:02:55,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [131508255] [2022-01-31 21:02:55,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [131508255] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:02:55,864 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:02:55,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 21:02:55,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366677108] [2022-01-31 21:02:55,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:02:55,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 21:02:55,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:02:55,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 21:02:55,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=363, Unknown=28, NotChecked=0, Total=462 [2022-01-31 21:02:55,865 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 19 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 13 states have internal predecessors, (29), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-31 21:03:10,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:03:10,041 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2022-01-31 21:03:10,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 21:03:10,042 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 13 states have internal predecessors, (29), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2022-01-31 21:03:10,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:03:10,043 INFO L225 Difference]: With dead ends: 86 [2022-01-31 21:03:10,043 INFO L226 Difference]: Without dead ends: 84 [2022-01-31 21:03:10,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 47.4s TimeCoverageRelationStatistics Valid=134, Invalid=746, Unknown=50, NotChecked=0, Total=930 [2022-01-31 21:03:10,044 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 39 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 297 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:03:10,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 157 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 127 Invalid, 0 Unknown, 297 Unchecked, 0.1s Time] [2022-01-31 21:03:10,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-01-31 21:03:10,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2022-01-31 21:03:10,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 55 states have internal predecessors, (62), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-01-31 21:03:10,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2022-01-31 21:03:10,060 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 49 [2022-01-31 21:03:10,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:03:10,060 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2022-01-31 21:03:10,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 13 states have internal predecessors, (29), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-31 21:03:10,060 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2022-01-31 21:03:10,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 21:03:10,061 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:03:10,061 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:03:10,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 21:03:10,061 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:03:10,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:03:10,062 INFO L85 PathProgramCache]: Analyzing trace with hash 820337557, now seen corresponding path program 1 times [2022-01-31 21:03:10,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:03:10,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1429362291] [2022-01-31 21:03:10,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:03:10,133 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 21:03:10,133 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 21:03:10,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:03:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:03:10,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:03:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:03:10,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:03:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:03:10,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:03:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:03:10,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 21:03:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:03:10,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 21:03:42,292 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:03:42,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1429362291] [2022-01-31 21:03:42,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1429362291] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:03:42,293 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:03:42,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 21:03:42,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146302655] [2022-01-31 21:03:42,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:03:42,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 21:03:42,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:03:42,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 21:03:42,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=363, Unknown=28, NotChecked=0, Total=462 [2022-01-31 21:03:42,294 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand has 19 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 13 states have internal predecessors, (29), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-31 21:03:55,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:03:55,606 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2022-01-31 21:03:55,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 21:03:55,607 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 13 states have internal predecessors, (29), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2022-01-31 21:03:55,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:03:55,607 INFO L225 Difference]: With dead ends: 81 [2022-01-31 21:03:55,607 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 21:03:55,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 45.1s TimeCoverageRelationStatistics Valid=135, Invalid=746, Unknown=49, NotChecked=0, Total=930 [2022-01-31 21:03:55,609 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 39 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 235 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:03:55,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 139 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 206 Invalid, 0 Unknown, 235 Unchecked, 0.2s Time] [2022-01-31 21:03:55,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 21:03:55,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 21:03:55,609 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-01-31 21:03:55,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 21:03:55,610 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2022-01-31 21:03:55,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:03:55,610 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 21:03:55,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 13 states have internal predecessors, (29), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-31 21:03:55,610 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 21:03:55,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 21:03:55,612 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 21:03:55,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 21:03:55,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 21:05:02,429 WARN L228 SmtUtils]: Spent 1.11m on a formula simplification. DAG size of input: 420 DAG size of output: 130 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-31 21:05:15,633 WARN L228 SmtUtils]: Spent 10.55s on a formula simplification. DAG size of input: 162 DAG size of output: 13 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-31 21:05:20,832 WARN L228 SmtUtils]: Spent 5.20s on a formula simplification. DAG size of input: 85 DAG size of output: 16 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-31 21:06:10,467 WARN L228 SmtUtils]: Spent 49.63s on a formula simplification. DAG size of input: 454 DAG size of output: 55 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-31 21:06:25,661 WARN L228 SmtUtils]: Spent 15.19s on a formula simplification. DAG size of input: 146 DAG size of output: 60 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-31 21:07:00,993 WARN L228 SmtUtils]: Spent 35.22s on a formula simplification. DAG size of input: 167 DAG size of output: 39 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-31 21:07:27,263 WARN L228 SmtUtils]: Spent 26.25s on a formula simplification. DAG size of input: 175 DAG size of output: 102 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-31 21:07:41,132 WARN L228 SmtUtils]: Spent 13.83s on a formula simplification. DAG size of input: 82 DAG size of output: 36 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-31 21:09:17,573 WARN L228 SmtUtils]: Spent 1.61m on a formula simplification. DAG size of input: 420 DAG size of output: 55 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-31 21:09:17,609 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-01-31 21:09:17,609 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-01-31 21:09:17,609 INFO L858 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-01-31 21:09:17,609 INFO L858 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-01-31 21:09:17,610 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-01-31 21:09:17,610 INFO L858 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-01-31 21:09:17,610 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-01-31 21:09:17,610 INFO L854 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-01-31 21:09:17,610 INFO L854 garLoopResultBuilder]: At program point L60-1(line 60) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-01-31 21:09:17,610 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 24 77) the Hoare annotation is: true [2022-01-31 21:09:17,610 INFO L854 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-01-31 21:09:17,610 INFO L854 garLoopResultBuilder]: At program point L56-1(line 56) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-01-31 21:09:17,610 INFO L854 garLoopResultBuilder]: At program point L48-2(lines 48 72) the Hoare annotation is: (and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 1 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-01-31 21:09:17,610 INFO L854 garLoopResultBuilder]: At program point L48-3(lines 48 72) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-01-31 21:09:17,610 INFO L854 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-01-31 21:09:17,611 INFO L854 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-01-31 21:09:17,611 INFO L854 garLoopResultBuilder]: At program point L32-2(lines 32 44) the Hoare annotation is: (or (and (<= 1 main_~tagbuf_len~0) (<= main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~t~0)) (and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))) [2022-01-31 21:09:17,611 INFO L854 garLoopResultBuilder]: At program point L32-3(lines 32 44) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-01-31 21:09:17,611 INFO L854 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-01-31 21:09:17,611 INFO L854 garLoopResultBuilder]: At program point L49(lines 49 53) the Hoare annotation is: (and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 1 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-01-31 21:09:17,611 INFO L854 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-01-31 21:09:17,611 INFO L861 garLoopResultBuilder]: At program point L74(lines 25 77) the Hoare annotation is: true [2022-01-31 21:09:17,611 INFO L854 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (exists ((v_main_~t~0_77 Int) (v_main_~t~0_78 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_7 Int) (v_main_~tagbuf_len~0_BEFORE_RETURN_4 Int)) (let ((.cse2 (= v___VERIFIER_assert_~cond_BEFORE_RETURN_7 1)) (.cse0 (= v___VERIFIER_assert_~cond_BEFORE_RETURN_7 0))) (and (not (= v_main_~t~0_77 v_main_~tagbuf_len~0_BEFORE_RETURN_4)) (let ((.cse1 (<= 0 v_main_~t~0_78))) (or (and .cse0 (not .cse1)) (and .cse2 .cse1))) (or (= v_main_~t~0_77 0) (and (not (<= (+ v_main_~tagbuf_len~0_BEFORE_RETURN_4 1) v_main_~t~0_77)) (< 0 v_main_~t~0_77))) (let ((.cse3 (<= 0 v_main_~t~0_77))) (or (and .cse2 .cse3) (and .cse0 (not .cse3)))) (<= 0 v_main_~tagbuf_len~0_BEFORE_RETURN_4)))) (<= 0 main_~t~0)) [2022-01-31 21:09:17,612 INFO L854 garLoopResultBuilder]: At program point L41-1(line 41) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (let ((.cse4 (exists ((v_main_~t~0_77 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_7 Int) (v_main_~tagbuf_len~0_BEFORE_RETURN_4 Int)) (let ((.cse5 (= v___VERIFIER_assert_~cond_BEFORE_RETURN_7 1)) (.cse7 (= v___VERIFIER_assert_~cond_BEFORE_RETURN_7 0))) (and (not (= v_main_~t~0_77 v_main_~tagbuf_len~0_BEFORE_RETURN_4)) (let ((.cse6 (<= 0 main_~t~0))) (or (and .cse5 .cse6) (and .cse7 (not .cse6)))) (or (= v_main_~t~0_77 0) (and (not (<= (+ v_main_~tagbuf_len~0_BEFORE_RETURN_4 1) v_main_~t~0_77)) (< 0 v_main_~t~0_77))) (let ((.cse8 (<= 0 v_main_~t~0_77))) (or (and .cse5 .cse8) (and .cse7 (not .cse8)))) (<= 0 v_main_~tagbuf_len~0_BEFORE_RETURN_4)))))) (or (and (exists ((v_main_~tagbuf_len~0_BEFORE_RETURN_2 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_3 Int) (v_main_~t~0_62 Int)) (let ((.cse2 (= v___VERIFIER_assert_~cond_BEFORE_RETURN_3 0)) (.cse0 (= v___VERIFIER_assert_~cond_BEFORE_RETURN_3 1))) (and (not (= v_main_~t~0_62 v_main_~tagbuf_len~0_BEFORE_RETURN_2)) (let ((.cse1 (<= 0 main_~t~0))) (or (and .cse0 .cse1) (and (not .cse1) .cse2))) (<= 0 v_main_~tagbuf_len~0_BEFORE_RETURN_2) (let ((.cse3 (<= 0 v_main_~t~0_62))) (or (and .cse2 (not .cse3)) (and .cse3 .cse0))) (or (and (not (<= (+ v_main_~tagbuf_len~0_BEFORE_RETURN_2 1) v_main_~t~0_62)) (< 0 v_main_~t~0_62)) (= v_main_~t~0_62 0))))) .cse4) .cse4))) [2022-01-31 21:09:17,612 INFO L854 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-01-31 21:09:17,612 INFO L854 garLoopResultBuilder]: At program point L66(lines 66 68) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-01-31 21:09:17,612 INFO L854 garLoopResultBuilder]: At program point L33(lines 33 37) the Hoare annotation is: (or (and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 1 main_~tagbuf_len~0) (<= 0 main_~t~0)) (and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0) (exists ((v_main_~t~0_77 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_7 Int) (v_main_~tagbuf_len~0_BEFORE_RETURN_4 Int)) (let ((.cse0 (= v___VERIFIER_assert_~cond_BEFORE_RETURN_7 1)) (.cse2 (= v___VERIFIER_assert_~cond_BEFORE_RETURN_7 0))) (and (not (= v_main_~t~0_77 v_main_~tagbuf_len~0_BEFORE_RETURN_4)) (let ((.cse1 (<= 0 main_~t~0))) (or (and .cse0 .cse1) (and .cse2 (not .cse1)))) (or (= v_main_~t~0_77 0) (and (not (<= (+ v_main_~tagbuf_len~0_BEFORE_RETURN_4 1) v_main_~t~0_77)) (< 0 v_main_~t~0_77))) (let ((.cse3 (<= 0 v_main_~t~0_77))) (or (and .cse0 .cse3) (and .cse2 (not .cse3)))) (<= 0 v_main_~tagbuf_len~0_BEFORE_RETURN_4)))))) [2022-01-31 21:09:17,612 INFO L861 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-01-31 21:09:17,612 INFO L854 garLoopResultBuilder]: At program point L29-1(line 29) the Hoare annotation is: (<= 1 main_~tagbuf_len~0) [2022-01-31 21:09:17,612 INFO L854 garLoopResultBuilder]: At program point L54(lines 54 68) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-01-31 21:09:17,613 INFO L854 garLoopResultBuilder]: At program point L54-1(lines 54 68) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-01-31 21:09:17,613 INFO L854 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-01-31 21:09:17,613 INFO L854 garLoopResultBuilder]: At program point L50-1(line 50) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-01-31 21:09:17,613 INFO L854 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-01-31 21:09:17,613 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 24 77) the Hoare annotation is: true [2022-01-31 21:09:17,613 INFO L854 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (let ((.cse12 (<= 0 main_~t~0))) (or (and (exists ((v_main_~t~0_97 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_13 Int) (v_main_~tagbuf_len~0_BEFORE_RETURN_7 Int) (v_main_~tagbuf_len~0_48 Int) (v_main_~t~0_96 Int)) (let ((.cse1 (= v___VERIFIER_assert_~cond_BEFORE_RETURN_13 0)) (.cse2 (= v___VERIFIER_assert_~cond_BEFORE_RETURN_13 1))) (and (not (= v_main_~t~0_96 v_main_~tagbuf_len~0_BEFORE_RETURN_7)) (let ((.cse0 (<= 0 v_main_~t~0_97))) (or (and (not .cse0) .cse1) (and .cse0 .cse2))) (or (and (< 0 v_main_~t~0_96) (not (<= (+ v_main_~tagbuf_len~0_BEFORE_RETURN_7 1) v_main_~t~0_96))) (= v_main_~t~0_96 0)) (<= 0 v_main_~tagbuf_len~0_BEFORE_RETURN_7) (<= v_main_~t~0_97 v_main_~tagbuf_len~0_48) (let ((.cse3 (<= 0 v_main_~t~0_96))) (or (and .cse1 (not .cse3)) (and .cse2 .cse3)))))) (<= 1 main_~tagbuf_len~0) (exists ((v_main_~tagbuf_len~0_32 Int) (v_main_~t~0_54 Int) (v_main_~t~0_55 Int) (v_main_~tagbuf_len~0_BEFORE_RETURN_1 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_1 Int)) (let ((.cse6 (= v___VERIFIER_assert_~cond_BEFORE_RETURN_1 0)) (.cse5 (= v___VERIFIER_assert_~cond_BEFORE_RETURN_1 1))) (and (let ((.cse4 (<= 0 v_main_~t~0_54))) (or (and .cse4 .cse5) (and .cse6 (not .cse4)))) (not (= v_main_~t~0_54 v_main_~tagbuf_len~0_BEFORE_RETURN_1)) (let ((.cse7 (<= 0 v_main_~t~0_55))) (or (and .cse6 (not .cse7)) (and .cse5 .cse7))) (<= 0 v_main_~tagbuf_len~0_BEFORE_RETURN_1) (<= v_main_~t~0_55 v_main_~tagbuf_len~0_32) (or (and (< 0 v_main_~t~0_54) (not (<= (+ v_main_~tagbuf_len~0_BEFORE_RETURN_1 1) v_main_~t~0_54))) (= v_main_~t~0_54 0))))) (<= main_~t~0 main_~tagbuf_len~0) (exists ((v_main_~t~0_88 Int) (v_main_~tagbuf_len~0_45 Int) (v_main_~t~0_89 Int) (v_main_~tagbuf_len~0_BEFORE_RETURN_6 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_11 Int)) (let ((.cse10 (= v___VERIFIER_assert_~cond_BEFORE_RETURN_11 1)) (.cse8 (= v___VERIFIER_assert_~cond_BEFORE_RETURN_11 0))) (and (let ((.cse9 (<= 0 v_main_~t~0_88))) (or (and .cse8 (not .cse9)) (and .cse10 .cse9))) (or (and (not (<= (+ v_main_~tagbuf_len~0_BEFORE_RETURN_6 1) v_main_~t~0_88)) (< 0 v_main_~t~0_88)) (= v_main_~t~0_88 0)) (let ((.cse11 (<= 0 v_main_~t~0_89))) (or (and .cse10 .cse11) (and .cse8 (not .cse11)))) (not (= v_main_~t~0_88 v_main_~tagbuf_len~0_BEFORE_RETURN_6)) (<= v_main_~t~0_89 v_main_~tagbuf_len~0_45) (<= 0 v_main_~tagbuf_len~0_BEFORE_RETURN_6)))) .cse12) (and (< main_~t~0 main_~tagbuf_len~0) .cse12))) [2022-01-31 21:09:17,613 INFO L854 garLoopResultBuilder]: At program point L38(lines 38 40) the Hoare annotation is: (and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 (+ 2147483648 |main_#t~nondet3|)) (<= |main_#t~nondet3| 2147483647) (not (= main_~tagbuf_len~0 main_~t~0)) (<= 0 main_~t~0)) [2022-01-31 21:09:17,614 INFO L854 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-01-31 21:09:17,614 INFO L854 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-01-31 21:09:17,614 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 24 77) the Hoare annotation is: true [2022-01-31 21:09:17,614 INFO L854 garLoopResultBuilder]: At program point L59(lines 59 63) the Hoare annotation is: (and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 1 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-01-31 21:09:17,614 INFO L854 garLoopResultBuilder]: At program point L55(lines 55 64) the Hoare annotation is: (and (< main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-01-31 21:09:17,614 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-01-31 21:09:17,614 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-01-31 21:09:17,614 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-01-31 21:09:17,614 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-01-31 21:09:17,614 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-01-31 21:09:17,615 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-01-31 21:09:17,615 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-01-31 21:09:17,615 INFO L854 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (let ((.cse0 (forall ((v_main_~t~0_78 Int) (v_main_~tagbuf_len~0_41 Int)) (or (let ((.cse12 (<= v_main_~t~0_78 v_main_~tagbuf_len~0_41))) (and (or (not (= |__VERIFIER_assert_#in~cond| 0)) .cse12) (or (not .cse12) (not (= |__VERIFIER_assert_#in~cond| 1))))) (forall ((v_main_~t~0_77 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_7 Int) (v_main_~tagbuf_len~0_BEFORE_RETURN_4 Int)) (let ((.cse13 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_7 0))) (.cse15 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_7 1)))) (or (let ((.cse14 (<= 0 v_main_~t~0_77))) (and (or .cse13 .cse14) (or .cse15 (not .cse14)))) (and (not (= v_main_~t~0_77 0)) (or (not (< 0 v_main_~t~0_77)) (<= (+ v_main_~tagbuf_len~0_BEFORE_RETURN_4 1) v_main_~t~0_77))) (not (<= 0 v_main_~tagbuf_len~0_BEFORE_RETURN_4)) (let ((.cse16 (<= 0 v_main_~t~0_78))) (and (or .cse13 .cse16) (or .cse15 (not .cse16)))) (= v_main_~t~0_77 v_main_~tagbuf_len~0_BEFORE_RETURN_4))))))) (.cse6 (= |__VERIFIER_assert_#in~cond| 0))) (and (or .cse0 (forall ((v_main_~tagbuf_len~0_35 Int) (v_main_~t~0_63 Int)) (or (forall ((v_main_~tagbuf_len~0_BEFORE_RETURN_2 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_3 Int) (v_main_~t~0_62 Int)) (let ((.cse3 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_3 1))) (.cse2 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_3 0)))) (or (let ((.cse1 (<= 0 v_main_~t~0_63))) (and (or .cse1 .cse2) (or .cse3 (not .cse1)))) (not (<= 0 v_main_~tagbuf_len~0_BEFORE_RETURN_2)) (and (not (= v_main_~t~0_62 0)) (or (<= (+ v_main_~tagbuf_len~0_BEFORE_RETURN_2 1) v_main_~t~0_62) (not (< 0 v_main_~t~0_62)))) (= v_main_~t~0_62 v_main_~tagbuf_len~0_BEFORE_RETURN_2) (let ((.cse4 (<= 0 v_main_~t~0_62))) (and (or .cse3 (not .cse4)) (or .cse4 .cse2)))))) (let ((.cse5 (<= v_main_~t~0_63 v_main_~tagbuf_len~0_35))) (and (or (not (= |__VERIFIER_assert_#in~cond| 0)) .cse5) (or (not (= |__VERIFIER_assert_#in~cond| 1)) (not .cse5)))))) .cse6 (exists ((v_main_~tagbuf_len~0_32 Int) (v_main_~t~0_55 Int)) (and (exists ((v_main_~t~0_54 Int) (v_main_~tagbuf_len~0_BEFORE_RETURN_1 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_1 Int)) (let ((.cse9 (= v___VERIFIER_assert_~cond_BEFORE_RETURN_1 0)) (.cse8 (= v___VERIFIER_assert_~cond_BEFORE_RETURN_1 1))) (and (let ((.cse7 (<= 0 v_main_~t~0_54))) (or (and .cse7 .cse8) (and .cse9 (not .cse7)))) (not (= v_main_~t~0_54 v_main_~tagbuf_len~0_BEFORE_RETURN_1)) (let ((.cse10 (<= 0 v_main_~t~0_55))) (or (and .cse9 (not .cse10)) (and .cse8 .cse10))) (<= 0 v_main_~tagbuf_len~0_BEFORE_RETURN_1) (or (and (< 0 v_main_~t~0_54) (not (<= (+ v_main_~tagbuf_len~0_BEFORE_RETURN_1 1) v_main_~t~0_54))) (= v_main_~t~0_54 0))))) (let ((.cse11 (<= v_main_~t~0_55 v_main_~tagbuf_len~0_32))) (or (and .cse11 (= |__VERIFIER_assert_#in~cond| 1)) (and (not .cse11) (= |__VERIFIER_assert_#in~cond| 0))))))) (or .cse0 (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) .cse6) (or .cse6 (not (= __VERIFIER_assert_~cond 0))))) [2022-01-31 21:09:17,615 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-01-31 21:09:17,615 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (let ((.cse5 (= |__VERIFIER_assert_#in~cond| 0))) (and (or (forall ((v_main_~t~0_78 Int) (v_main_~tagbuf_len~0_41 Int)) (or (let ((.cse0 (<= v_main_~t~0_78 v_main_~tagbuf_len~0_41))) (and (or (not (= |__VERIFIER_assert_#in~cond| 0)) .cse0) (or (not .cse0) (not (= |__VERIFIER_assert_#in~cond| 1))))) (forall ((v_main_~t~0_77 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_7 Int) (v_main_~tagbuf_len~0_BEFORE_RETURN_4 Int)) (let ((.cse1 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_7 0))) (.cse3 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_7 1)))) (or (let ((.cse2 (<= 0 v_main_~t~0_77))) (and (or .cse1 .cse2) (or .cse3 (not .cse2)))) (and (not (= v_main_~t~0_77 0)) (or (not (< 0 v_main_~t~0_77)) (<= (+ v_main_~tagbuf_len~0_BEFORE_RETURN_4 1) v_main_~t~0_77))) (not (<= 0 v_main_~tagbuf_len~0_BEFORE_RETURN_4)) (let ((.cse4 (<= 0 v_main_~t~0_78))) (and (or .cse1 .cse4) (or .cse3 (not .cse4)))) (= v_main_~t~0_77 v_main_~tagbuf_len~0_BEFORE_RETURN_4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) .cse5) (or .cse5 (not (= __VERIFIER_assert_~cond 0))))) [2022-01-31 21:09:17,615 INFO L854 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-01-31 21:09:17,615 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-01-31 21:09:17,616 INFO L854 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (let ((.cse5 (= |__VERIFIER_assert_#in~cond| 0))) (and (or (forall ((v_main_~t~0_78 Int) (v_main_~tagbuf_len~0_41 Int)) (or (let ((.cse0 (<= v_main_~t~0_78 v_main_~tagbuf_len~0_41))) (and (or (not (= |__VERIFIER_assert_#in~cond| 0)) .cse0) (or (not .cse0) (not (= |__VERIFIER_assert_#in~cond| 1))))) (forall ((v_main_~t~0_77 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_7 Int) (v_main_~tagbuf_len~0_BEFORE_RETURN_4 Int)) (let ((.cse1 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_7 0))) (.cse3 (not (= v___VERIFIER_assert_~cond_BEFORE_RETURN_7 1)))) (or (let ((.cse2 (<= 0 v_main_~t~0_77))) (and (or .cse1 .cse2) (or .cse3 (not .cse2)))) (and (not (= v_main_~t~0_77 0)) (or (not (< 0 v_main_~t~0_77)) (<= (+ v_main_~tagbuf_len~0_BEFORE_RETURN_4 1) v_main_~t~0_77))) (not (<= 0 v_main_~tagbuf_len~0_BEFORE_RETURN_4)) (let ((.cse4 (<= 0 v_main_~t~0_78))) (and (or .cse1 .cse4) (or .cse3 (not .cse4)))) (= v_main_~t~0_77 v_main_~tagbuf_len~0_BEFORE_RETURN_4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) .cse5) (or .cse5 (not (= __VERIFIER_assert_~cond 0))))) [2022-01-31 21:09:17,618 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:09:17,620 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 21:09:17,632 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_78,QUANTIFIED] [2022-01-31 21:09:17,633 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_41,QUANTIFIED] [2022-01-31 21:09:17,633 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_78,QUANTIFIED] [2022-01-31 21:09:17,633 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_41,QUANTIFIED] [2022-01-31 21:09:17,633 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_7,QUANTIFIED] [2022-01-31 21:09:17,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_77,QUANTIFIED] [2022-01-31 21:09:17,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_7,QUANTIFIED] [2022-01-31 21:09:17,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_77,QUANTIFIED] [2022-01-31 21:09:17,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_77,QUANTIFIED] [2022-01-31 21:09:17,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_77,QUANTIFIED] [2022-01-31 21:09:17,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_BEFORE_RETURN_4,QUANTIFIED] [2022-01-31 21:09:17,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_77,QUANTIFIED] [2022-01-31 21:09:17,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_BEFORE_RETURN_4,QUANTIFIED] [2022-01-31 21:09:17,635 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_7,QUANTIFIED] [2022-01-31 21:09:17,635 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_78,QUANTIFIED] [2022-01-31 21:09:17,635 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_7,QUANTIFIED] [2022-01-31 21:09:17,635 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_78,QUANTIFIED] [2022-01-31 21:09:17,635 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_77,QUANTIFIED] [2022-01-31 21:09:17,635 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_BEFORE_RETURN_4,QUANTIFIED] [2022-01-31 21:09:17,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:09:17 BoogieIcfgContainer [2022-01-31 21:09:17,636 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 21:09:17,637 INFO L158 Benchmark]: Toolchain (without parser) took 686573.05ms. Allocated memory was 207.6MB in the beginning and 253.8MB in the end (delta: 46.1MB). Free memory was 152.4MB in the beginning and 82.2MB in the end (delta: 70.2MB). Peak memory consumption was 121.6MB. Max. memory is 8.0GB. [2022-01-31 21:09:17,637 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 207.6MB. Free memory is still 168.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 21:09:17,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.83ms. Allocated memory was 207.6MB in the beginning and 253.8MB in the end (delta: 46.1MB). Free memory was 152.1MB in the beginning and 224.0MB in the end (delta: -71.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-01-31 21:09:17,638 INFO L158 Benchmark]: Boogie Preprocessor took 39.19ms. Allocated memory is still 253.8MB. Free memory was 224.0MB in the beginning and 222.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-31 21:09:17,638 INFO L158 Benchmark]: RCFGBuilder took 376.22ms. Allocated memory is still 253.8MB. Free memory was 222.4MB in the beginning and 210.4MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-31 21:09:17,638 INFO L158 Benchmark]: TraceAbstraction took 685947.47ms. Allocated memory is still 253.8MB. Free memory was 210.4MB in the beginning and 82.2MB in the end (delta: 128.2MB). Peak memory consumption was 133.4MB. Max. memory is 8.0GB. [2022-01-31 21:09:17,639 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 207.6MB. Free memory is still 168.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 203.83ms. Allocated memory was 207.6MB in the beginning and 253.8MB in the end (delta: 46.1MB). Free memory was 152.1MB in the beginning and 224.0MB in the end (delta: -71.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.19ms. Allocated memory is still 253.8MB. Free memory was 224.0MB in the beginning and 222.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 376.22ms. Allocated memory is still 253.8MB. Free memory was 222.4MB in the beginning and 210.4MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 685947.47ms. Allocated memory is still 253.8MB. Free memory was 210.4MB in the beginning and 82.2MB in the end (delta: 128.2MB). Peak memory consumption was 133.4MB. 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_~t~0_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_BEFORE_RETURN_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_BEFORE_RETURN_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_BEFORE_RETURN_4,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, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 685.9s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 111.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 322.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 465 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 410 mSDsluCounter, 1014 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1478 IncrementalHoareTripleChecker+Unchecked, 624 mSDsCounter, 454 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1568 IncrementalHoareTripleChecker+Invalid, 3500 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 454 mSolverCounterUnsat, 390 mSDtfsCounter, 1568 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 306 GetRequests, 83 SyntacticMatches, 21 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 1894 ImplicationChecksByTransitivity, 359.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=6, InterpolantAutomatonStates: 144, 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, 9 MinimizatonAttempts, 51 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 48 LocationsWithAnnotation, 318 PreInvPairs, 465 NumberOfFragments, 1270 HoareAnnotationTreeSize, 318 FomulaSimplifications, 1059 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 48 FomulaSimplificationsInter, 14737 FormulaSimplificationTreeSizeReductionInter, 321.8s 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: 32]: Loop Invariant Derived loop invariant: ((1 <= tagbuf_len && t <= tagbuf_len + 1) && 0 <= t) || (0 <= tagbuf_len && t == 0) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: (t < tagbuf_len + 1 && 1 <= tagbuf_len) && 0 <= t - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert [2022-01-31 21:09:17,645 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_78,QUANTIFIED] [2022-01-31 21:09:17,645 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_41,QUANTIFIED] [2022-01-31 21:09:17,646 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_78,QUANTIFIED] [2022-01-31 21:09:17,646 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_41,QUANTIFIED] [2022-01-31 21:09:17,646 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_7,QUANTIFIED] [2022-01-31 21:09:17,646 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_77,QUANTIFIED] [2022-01-31 21:09:17,646 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_7,QUANTIFIED] [2022-01-31 21:09:17,646 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_77,QUANTIFIED] [2022-01-31 21:09:17,646 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_77,QUANTIFIED] [2022-01-31 21:09:17,646 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_77,QUANTIFIED] [2022-01-31 21:09:17,646 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_BEFORE_RETURN_4,QUANTIFIED] [2022-01-31 21:09:17,646 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_77,QUANTIFIED] [2022-01-31 21:09:17,647 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_BEFORE_RETURN_4,QUANTIFIED] [2022-01-31 21:09:17,647 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_7,QUANTIFIED] [2022-01-31 21:09:17,647 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_78,QUANTIFIED] [2022-01-31 21:09:17,647 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_7,QUANTIFIED] [2022-01-31 21:09:17,647 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_78,QUANTIFIED] [2022-01-31 21:09:17,647 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_77,QUANTIFIED] [2022-01-31 21:09:17,647 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_BEFORE_RETURN_4,QUANTIFIED] [2022-01-31 21:09:17,648 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_78,QUANTIFIED] [2022-01-31 21:09:17,648 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_41,QUANTIFIED] [2022-01-31 21:09:17,648 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_78,QUANTIFIED] [2022-01-31 21:09:17,648 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_41,QUANTIFIED] [2022-01-31 21:09:17,648 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_7,QUANTIFIED] [2022-01-31 21:09:17,648 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_77,QUANTIFIED] [2022-01-31 21:09:17,648 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_7,QUANTIFIED] [2022-01-31 21:09:17,648 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_77,QUANTIFIED] [2022-01-31 21:09:17,648 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_77,QUANTIFIED] [2022-01-31 21:09:17,648 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_77,QUANTIFIED] [2022-01-31 21:09:17,649 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_BEFORE_RETURN_4,QUANTIFIED] [2022-01-31 21:09:17,649 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_77,QUANTIFIED] [2022-01-31 21:09:17,649 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_BEFORE_RETURN_4,QUANTIFIED] [2022-01-31 21:09:17,649 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_7,QUANTIFIED] [2022-01-31 21:09:17,649 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_78,QUANTIFIED] [2022-01-31 21:09:17,649 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___VERIFIER_assert_~cond_BEFORE_RETURN_7,QUANTIFIED] [2022-01-31 21:09:17,649 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_78,QUANTIFIED] [2022-01-31 21:09:17,649 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~t~0_77,QUANTIFIED] [2022-01-31 21:09:17,649 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~tagbuf_len~0_BEFORE_RETURN_4,QUANTIFIED] Derived contract for procedure __VERIFIER_assert: (((forall v_main_~t~0_78 : int, v_main_~tagbuf_len~0_41 : int :: ((!(\old(cond) == 0) || v_main_~t~0_78 <= v_main_~tagbuf_len~0_41) && (!(v_main_~t~0_78 <= v_main_~tagbuf_len~0_41) || !(\old(cond) == 1))) || (forall v_main_~t~0_77 : int, v___VERIFIER_assert_~cond_BEFORE_RETURN_7 : int, v_main_~tagbuf_len~0_BEFORE_RETURN_4 : int :: (((((!(v___VERIFIER_assert_~cond_BEFORE_RETURN_7 == 0) || 0 <= v_main_~t~0_77) && (!(v___VERIFIER_assert_~cond_BEFORE_RETURN_7 == 1) || !(0 <= v_main_~t~0_77))) || (!(v_main_~t~0_77 == 0) && (!(0 < v_main_~t~0_77) || v_main_~tagbuf_len~0_BEFORE_RETURN_4 + 1 <= v_main_~t~0_77))) || !(0 <= v_main_~tagbuf_len~0_BEFORE_RETURN_4)) || ((!(v___VERIFIER_assert_~cond_BEFORE_RETURN_7 == 0) || 0 <= v_main_~t~0_78) && (!(v___VERIFIER_assert_~cond_BEFORE_RETURN_7 == 1) || !(0 <= v_main_~t~0_78)))) || v_main_~t~0_77 == v_main_~tagbuf_len~0_BEFORE_RETURN_4)) || \old(cond) == cond) || \old(cond) == 0) && (\old(cond) == 0 || !(cond == 0)) RESULT: Ultimate proved your program to be correct! [2022-01-31 21:09:17,874 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-01-31 21:09:17,968 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...